Proposals
Below are some proposals for talks from the past (and current). By clicking on the ID number, more details are shown. By default, these are sorted chronologically (recent first) and by then by last name. The data can be sorted by alternate means by using the links at the top right, each allowing ascending or descending orders.
Displaying 241-260 of 471 results.
Sort by:
ID:
497
Year: 2018
Name: Kevin Bombardier
Institution: University of Iowa
Subject area(s): Commutative Ring Theory, Algebra
Title of Talk: An Exploration of Factorization: Mathematical Atoms
Abstract: The mathematical system of the integers has many useful properties. One of these is unique factorization. For example, we can write the number 14 in a unique way: 14 = 2 * 7. However, the numbers 2 and 7 cannot be factored into "smaller pieces" in a nontrivial way. So in this sense, they could be called atoms of this mathematical system. Other mathematical systems usually do not have all of the nice properties that the integers do. Some useful properties can still be salvaged in certain cases. An atomic domain is a special mathematical system where its members have a factorization into a product of atoms. However, despite the ability to still factor elements into atoms, some are not as well-behaved as the integers were. For example, there are atomic domains where elements have an infinite number of distinct factorizations! We will discuss some important cases of these atomic domains. Of particular interest will be an atomic domain that only has finitely many atoms.
Year: 2018
Name: Kevin Bombardier
Institution: University of Iowa
Subject area(s): Commutative Ring Theory, Algebra
Title of Talk: An Exploration of Factorization: Mathematical Atoms
Abstract: The mathematical system of the integers has many useful properties. One of these is unique factorization. For example, we can write the number 14 in a unique way: 14 = 2 * 7. However, the numbers 2 and 7 cannot be factored into "smaller pieces" in a nontrivial way. So in this sense, they could be called atoms of this mathematical system. Other mathematical systems usually do not have all of the nice properties that the integers do. Some useful properties can still be salvaged in certain cases. An atomic domain is a special mathematical system where its members have a factorization into a product of atoms. However, despite the ability to still factor elements into atoms, some are not as well-behaved as the integers were. For example, there are atomic domains where elements have an infinite number of distinct factorizations! We will discuss some important cases of these atomic domains. Of particular interest will be an atomic domain that only has finitely many atoms.
ID:
400
Year: 2014
Name: Debasis Mandal
Institution: Iowa State University
Subject area(s): Complexity Theory
Title of Talk: Separation of NP-Completeness Notions
Abstract: Informally speaking, reductions translate instances of one problem to instances of another problem; a problem A is polynomial-time reducible to a problem B if A can be solved in polynomial-time by making queries to problem B. By varying the manner in which the queries are allowed to make, we obtain a wide spectrum of reductions. At one end of the spectrum is Cook/Turing reduction where multiple queries are allowed and the i-th query made depends on answers to previous queries. On the other end is the most restrictive reduction, Karp-Levin/many-one reduction, where each positive instance of problem A is mapped to a positive instance of problem B, and so are the negative instances. This raises the following question: For complexity class NP, is there a Turing complete language that is not many-one complete? The first result that achieves such separation, under a reasonable hypothesis, is due to Lutz and Mayordomo. We show this separation for NP, under a believable worst-case hardness hypothesis. This is a joint work with A. Pavan and Rajeswari Venugopalan.
Year: 2014
Name: Debasis Mandal
Institution: Iowa State University
Subject area(s): Complexity Theory
Title of Talk: Separation of NP-Completeness Notions
Abstract: Informally speaking, reductions translate instances of one problem to instances of another problem; a problem A is polynomial-time reducible to a problem B if A can be solved in polynomial-time by making queries to problem B. By varying the manner in which the queries are allowed to make, we obtain a wide spectrum of reductions. At one end of the spectrum is Cook/Turing reduction where multiple queries are allowed and the i-th query made depends on answers to previous queries. On the other end is the most restrictive reduction, Karp-Levin/many-one reduction, where each positive instance of problem A is mapped to a positive instance of problem B, and so are the negative instances. This raises the following question: For complexity class NP, is there a Turing complete language that is not many-one complete? The first result that achieves such separation, under a reasonable hypothesis, is due to Lutz and Mayordomo. We show this separation for NP, under a believable worst-case hardness hypothesis. This is a joint work with A. Pavan and Rajeswari Venugopalan.
ID:
478
Year: 2017
Name: Diego Rojas
Institution: Iowa State University
Subject area(s): Computability Theory, Analysis
Title of Talk: Differentiation of Functions on the Cantor Space and Connections to Real-Valued Functions
Abstract: The notion of online functions of the Cantor space $2^{\mathbb{N}}$, and more generally, of continuous and of computable functions on $2^{\mathbb{N}}$, have been studied recently in connection with algorithmic randomness. In this talk, we present a notion of the derivative of functions on $2^{\mathbb{N}}$, and we establish some connections between functions and their derivatives on $2^{\mathbb{N}}$ and on $\mathbb{R}$, where we can represent real-valued functions as functions acting on the dyadic representation of real numbers. This is joint work with Douglas Cenzer.
Year: 2017
Name: Diego Rojas
Institution: Iowa State University
Subject area(s): Computability Theory, Analysis
Title of Talk: Differentiation of Functions on the Cantor Space and Connections to Real-Valued Functions
Abstract: The notion of online functions of the Cantor space $2^{\mathbb{N}}$, and more generally, of continuous and of computable functions on $2^{\mathbb{N}}$, have been studied recently in connection with algorithmic randomness. In this talk, we present a notion of the derivative of functions on $2^{\mathbb{N}}$, and we establish some connections between functions and their derivatives on $2^{\mathbb{N}}$ and on $\mathbb{R}$, where we can represent real-valued functions as functions acting on the dyadic representation of real numbers. This is joint work with Douglas Cenzer.
ID:
155
Year: 2006
Name: Di Wu
Institution: Iowa State University
Subject area(s): Computational Biology and Applied Mathematics
Title of Talk: Protein Structure Determination: A Rigid Geometric Build-up Algorithm for Solving a Distance Geometry Problem with Sparse Exact Distance Data
Abstract: Protein Structure Determination: A Rigid Geometric Build-up Algorithm for Solving a Distance Geometry Problem with Sparse Exact Distance Data Di Wu and Zhijun Wu Program on Bioinformatics and Computational Biology Department of Mathematics Iowa State University Ames, Iowa 50011 Abstract. Given a set of distances for certain pairs of atoms in a protein, the coordinates of the atoms and hence the protein structure can then be determined through solving a so-called distance geometry problem. However, it has been proved to be a NP hard problem when only a set of partial distances given. Previously, we used a so-called geometric build-up approach to develop several algorithms for solving the distance geometry problem with a set of sparse distance data. In this method, the coordinates of the atoms in a protein are determined as one atom at a time, with the distances from four base atoms to the atom to be determined. However, the requirement for four base atoms for the unique determination of each atom is sufficient, but unnecessary and even redundant for rigid structural determination. Here we investigate a rigid geometric build-up algorithm, which requires three base atoms instead of four base atoms for the determination of each atom. It could generate rigid structures, even a unique structure for very sparse distance data of a protein eventually. Due to the reflection in the determination for some atoms, this algorithm may also produce multiple structures satisfying given distances. We present the results obtained by using the algorithm for the determination of the structures, which suggests the potential of applying the algorithm to the distance based protein structural modeling.
Year: 2006
Name: Di Wu
Institution: Iowa State University
Subject area(s): Computational Biology and Applied Mathematics
Title of Talk: Protein Structure Determination: A Rigid Geometric Build-up Algorithm for Solving a Distance Geometry Problem with Sparse Exact Distance Data
Abstract: Protein Structure Determination: A Rigid Geometric Build-up Algorithm for Solving a Distance Geometry Problem with Sparse Exact Distance Data Di Wu and Zhijun Wu Program on Bioinformatics and Computational Biology Department of Mathematics Iowa State University Ames, Iowa 50011 Abstract. Given a set of distances for certain pairs of atoms in a protein, the coordinates of the atoms and hence the protein structure can then be determined through solving a so-called distance geometry problem. However, it has been proved to be a NP hard problem when only a set of partial distances given. Previously, we used a so-called geometric build-up approach to develop several algorithms for solving the distance geometry problem with a set of sparse distance data. In this method, the coordinates of the atoms in a protein are determined as one atom at a time, with the distances from four base atoms to the atom to be determined. However, the requirement for four base atoms for the unique determination of each atom is sufficient, but unnecessary and even redundant for rigid structural determination. Here we investigate a rigid geometric build-up algorithm, which requires three base atoms instead of four base atoms for the determination of each atom. It could generate rigid structures, even a unique structure for very sparse distance data of a protein eventually. Due to the reflection in the determination for some atoms, this algorithm may also produce multiple structures satisfying given distances. We present the results obtained by using the algorithm for the determination of the structures, which suggests the potential of applying the algorithm to the distance based protein structural modeling.
ID:
119
Year: 2005
Name: Christopher French
Institution: Grinnell College
Subject area(s): convex geometry
Title of Talk: Graphs of Polytopes
Abstract: A polytope is a bounded intersection of half-spaces in R^n. The vertices and edges of a polytope form a graph. The graph of a 3 dimensional polytope is planar, since the surface of the polytope is homeomorphic to a sphere. It follows that such graphs cannot have K_5 minors. We generalize this fact, showing that graphs of n-dimensional polytopes cannot have K_{n+2} minors.
Year: 2005
Name: Christopher French
Institution: Grinnell College
Subject area(s): convex geometry
Title of Talk: Graphs of Polytopes
Abstract: A polytope is a bounded intersection of half-spaces in R^n. The vertices and edges of a polytope form a graph. The graph of a 3 dimensional polytope is planar, since the surface of the polytope is homeomorphic to a sphere. It follows that such graphs cannot have K_5 minors. We generalize this fact, showing that graphs of n-dimensional polytopes cannot have K_{n+2} minors.
ID:
186
Year: 2007
Name: David Romano
Institution: Grinnell College
Subject area(s): Convex geometry
Title of Talk: Connected goalies for convex polygons
Abstract: Given a compact convex body K in the plane, call a connected 1-dimensional set G in the plane a goalie if it intersects all the straight lines that intersect K. This talk is concerned with the problem of finding the minimal length goalie for polygons. For any polygon P with n sides, we prove that any shortest goalie G for P has convex hull CH(G) a polygon with at most 2n sides. For triangles T, the minimal length goalie is the Steiner minimal tree for T. This is no longer true in the case of quadrilaterals, in which case a Steiner minimal tree need not be a minimal goalie.
Year: 2007
Name: David Romano
Institution: Grinnell College
Subject area(s): Convex geometry
Title of Talk: Connected goalies for convex polygons
Abstract: Given a compact convex body K in the plane, call a connected 1-dimensional set G in the plane a goalie if it intersects all the straight lines that intersect K. This talk is concerned with the problem of finding the minimal length goalie for polygons. For any polygon P with n sides, we prove that any shortest goalie G for P has convex hull CH(G) a polygon with at most 2n sides. For triangles T, the minimal length goalie is the Steiner minimal tree for T. This is no longer true in the case of quadrilaterals, in which case a Steiner minimal tree need not be a minimal goalie.
ID:
441
Year: 2016
Name: Henry Walker
Institution: Grinnell College
Subject area(s): Course Syllabi and Online Materials
Title of Talk: Using a Database to Support a Course Home Page, Syllabus, Schedule, and Other Online Materials
Abstract: With static Web pages for a course, posting of daily readings, assignments, etc. requires either constant editing of pages or a search for materials relevant for each given day. Further, adjustments in time allocated for one topic likely requires manual changes in several days that follow. As a result, modifications in a course to accomodate student needs are labor intensive and consistency of schedules can be troublesome. Use of a database behind the scenes resolves many of these maintenance challenges. A student going to a course home page can view the assignments for the previous day, current day, and next day, together with a statement of the next course deadlines. Links to readings and assignments can be dynamic — automatically updated daily. Adjustments to course schedules can be made with the click of just a few buttons. Part of the talk will include a demonstration of a sample dynamic format for a current course. (Development of this type of course interface might make an interesting assignment for one or more computing students!)
Year: 2016
Name: Henry Walker
Institution: Grinnell College
Subject area(s): Course Syllabi and Online Materials
Title of Talk: Using a Database to Support a Course Home Page, Syllabus, Schedule, and Other Online Materials
Abstract: With static Web pages for a course, posting of daily readings, assignments, etc. requires either constant editing of pages or a search for materials relevant for each given day. Further, adjustments in time allocated for one topic likely requires manual changes in several days that follow. As a result, modifications in a course to accomodate student needs are labor intensive and consistency of schedules can be troublesome. Use of a database behind the scenes resolves many of these maintenance challenges. A student going to a course home page can view the assignments for the previous day, current day, and next day, together with a statement of the next course deadlines. Links to readings and assignments can be dynamic — automatically updated daily. Adjustments to course schedules can be made with the click of just a few buttons. Part of the talk will include a demonstration of a sample dynamic format for a current course. (Development of this type of course interface might make an interesting assignment for one or more computing students!)
ID:
111
Year: 2005
Name: Kristen Meyer
Institution: Iowa State University
Subject area(s): Cryptography
Title of Talk: Message Authentication Codes and Quasigroups
Abstract: Message Authentication Codes, or MACs, are commonly used cryptographic tools to ensure that a message has not been changed in transit. MACs can be constructed from a variety of mathematical structures and in a variety of ways. In this talk, I will describe a new MAC (called QMAC) which is based on the non-associativity of quasigroups. In order to obtain security against forgeries, quasigroups of large order must be used. I will also discuss how to create and represent such quasigroups.
Year: 2005
Name: Kristen Meyer
Institution: Iowa State University
Subject area(s): Cryptography
Title of Talk: Message Authentication Codes and Quasigroups
Abstract: Message Authentication Codes, or MACs, are commonly used cryptographic tools to ensure that a message has not been changed in transit. MACs can be constructed from a variety of mathematical structures and in a variety of ways. In this talk, I will describe a new MAC (called QMAC) which is based on the non-associativity of quasigroups. In order to obtain security against forgeries, quasigroups of large order must be used. I will also discuss how to create and represent such quasigroups.
ID:
473
Year: 2017
Name: Kevin Bombardier
Institution: University of Iowa
Subject area(s): cryptography, algebra, number theory
Title of Talk: Cryptography - Secure Communication
Abstract: Essential to our modern technological world, cryptography is the study of secure communication. In this talk we will discuss some of the basic ideas in cryptography, explain the differences between symmetric and asymmetric-key cryptosystems, and explore some basic examples of cryptosystems. As an illustration of the mathematics involved, we will do a simplified computational example by computing keys using the RSA algorithm. This talk will be self-contained; no prior knowledge of cryptography will be assumed.
Year: 2017
Name: Kevin Bombardier
Institution: University of Iowa
Subject area(s): cryptography, algebra, number theory
Title of Talk: Cryptography - Secure Communication
Abstract: Essential to our modern technological world, cryptography is the study of secure communication. In this talk we will discuss some of the basic ideas in cryptography, explain the differences between symmetric and asymmetric-key cryptosystems, and explore some basic examples of cryptosystems. As an illustration of the mathematics involved, we will do a simplified computational example by computing keys using the RSA algorithm. This talk will be self-contained; no prior knowledge of cryptography will be assumed.
ID:
106
Year: 2005
Name: Scott Searcy
Institution: Waldorf College
Subject area(s): Data Compression
Title of Talk: The Efficiency of Morse Code as Data Compression.
Abstract: Morse code was invented to allow the efficient transmission of textual data in a digital mode. This talk examines the efficiency in comparison with more modern methods of textual data transmission.
Year: 2005
Name: Scott Searcy
Institution: Waldorf College
Subject area(s): Data Compression
Title of Talk: The Efficiency of Morse Code as Data Compression.
Abstract: Morse code was invented to allow the efficient transmission of textual data in a digital mode. This talk examines the efficiency in comparison with more modern methods of textual data transmission.
ID:
563
Year: 2021
Name: Mariah Birgen
Institution: Wartburg College
Subject area(s): Data Science
Title of Talk: Data Science and The Pandemic
Abstract: This talk could be titled "What I did on my COVID-19 Sabbatical." I will discuss data collection and cleaning, the use of R for data analysis, where we are as a state, and where we are going. I will also give advice to people newly interested in Data Science and take advice from the people in the audience who have been doing this a lot longer than I have.
Year: 2021
Name: Mariah Birgen
Institution: Wartburg College
Subject area(s): Data Science
Title of Talk: Data Science and The Pandemic
Abstract: This talk could be titled "What I did on my COVID-19 Sabbatical." I will discuss data collection and cleaning, the use of R for data analysis, where we are as a state, and where we are going. I will also give advice to people newly interested in Data Science and take advice from the people in the audience who have been doing this a lot longer than I have.
ID:
365
Year: 2013
Name: Chris Schultz
Institution: Iowa State University
Subject area(s): Developmental Math
Title of Talk: Remedial Mathematics at Iowa State University
Abstract: Success in a developmental math course is not truly measured until the student success rate in the downstream class is measured. Iowa State University’s Department of Mathematics has started such a study and would like to share our preliminary data for discussion. Concern is often also expressed that students who start in developmental math classes will never graduate and we have gathered 2 years’ worth of data addressing this concern. The format of our developmental course, Math 10, will be shared as well as the data described above.
Year: 2013
Name: Chris Schultz
Institution: Iowa State University
Subject area(s): Developmental Math
Title of Talk: Remedial Mathematics at Iowa State University
Abstract: Success in a developmental math course is not truly measured until the student success rate in the downstream class is measured. Iowa State University’s Department of Mathematics has started such a study and would like to share our preliminary data for discussion. Concern is often also expressed that students who start in developmental math classes will never graduate and we have gathered 2 years’ worth of data addressing this concern. The format of our developmental course, Math 10, will be shared as well as the data described above.
ID:
173
Year: 2006
Name: M. Anne Dow
Institution: Maharishi University of Management
Subject area(s): Developmental math course materials
Title of Talk: Some Hands-on Workshops for Elementary and Intermediate Algebra Courses
Abstract: I found all the topics of my Elementary and Intermediate Algebra courses in the greenhouses we recently built on campus to provide organic vegetables for our campus dining hall. In my talk I will present two workshops on linear functions, one about the amount of broccoli seed needed to produce N thousand pounds of broccoli per week, and one about heat loss to the greenhouse during winter. Both require students to think carefully about what the slope means.
Year: 2006
Name: M. Anne Dow
Institution: Maharishi University of Management
Subject area(s): Developmental math course materials
Title of Talk: Some Hands-on Workshops for Elementary and Intermediate Algebra Courses
Abstract: I found all the topics of my Elementary and Intermediate Algebra courses in the greenhouses we recently built on campus to provide organic vegetables for our campus dining hall. In my talk I will present two workshops on linear functions, one about the amount of broccoli seed needed to produce N thousand pounds of broccoli per week, and one about heat loss to the greenhouse during winter. Both require students to think carefully about what the slope means.
ID:
148
Year: 2006
Name: Alfredo Villanueva
Institution: University of Iowa
Subject area(s): Differential Geometry
Title of Talk: Prolongations on a Riemannian Manifold
Abstract: Traditionally the method of prolongations is carry out by algebraic manipulations which become very complex, especially in cases of partial differential equations on curved spaces, here we are applying some results from representation theory and differential operators to have a systematic method that allow us to close some overdetermined systems on a Riemannian manifold.
Year: 2006
Name: Alfredo Villanueva
Institution: University of Iowa
Subject area(s): Differential Geometry
Title of Talk: Prolongations on a Riemannian Manifold
Abstract: Traditionally the method of prolongations is carry out by algebraic manipulations which become very complex, especially in cases of partial differential equations on curved spaces, here we are applying some results from representation theory and differential operators to have a systematic method that allow us to close some overdetermined systems on a Riemannian manifold.
ID:
447
Year: 2016
Name: Richard Ligo
Institution: University of Iowa
Subject area(s): Differential geometry
Title of Talk: Escaping Flatland: An Introduction to Surface Curvature
Abstract: What if I told you that the majority of ideas conveyed in high school geometry classes are thousands of years old? What if I told you that your understanding of geometry was tremendously incomplete? Believe it or not, one can argue that the first true departure from ancient Greek geometry wasn't published until 1826! In this talk, we describe one such departure and its implications. We begin by describing the curvature of a curve, use this to define the curvature of a surface, and conclude by visiting a famous egregious result. This talk even includes snacks!
Year: 2016
Name: Richard Ligo
Institution: University of Iowa
Subject area(s): Differential geometry
Title of Talk: Escaping Flatland: An Introduction to Surface Curvature
Abstract: What if I told you that the majority of ideas conveyed in high school geometry classes are thousands of years old? What if I told you that your understanding of geometry was tremendously incomplete? Believe it or not, one can argue that the first true departure from ancient Greek geometry wasn't published until 1826! In this talk, we describe one such departure and its implications. We begin by describing the curvature of a curve, use this to define the curvature of a surface, and conclude by visiting a famous egregious result. This talk even includes snacks!
ID:
531
Year: 2019
Name: Alvaro Carbonero
Institution: University of Nevada, Las Vegas
Subject area(s): Discrete Geometry
Title of Talk: Exploring Preference Orderings Through Discrete Geometry
Abstract: Consider $n + 1$ points in the plane: a set $S$ consisting of $n$ points along with a distinguished vantage point $v$. By measuring the distance from $v$ to each of the points in $S$, we generate a preference ordering of $S$. This work is motivated by a voting theory application, where an ordering corresponds to a preference list. The maximum number of orderings possible is given by a fourth-degree polynomial (related to Stirling numbers of the first kind), found by Good and Tideman (1977), while the minimum is given by a linear function. We investigate intermediate numbers of orderings achievable by special configurations $S$. We also consider this problem for points on the sphere, where our results are similar to what we found for the plane. A variant of the problem that uses two vantage points is also developed.
Year: 2019
Name: Alvaro Carbonero
Institution: University of Nevada, Las Vegas
Subject area(s): Discrete Geometry
Title of Talk: Exploring Preference Orderings Through Discrete Geometry
Abstract: Consider $n + 1$ points in the plane: a set $S$ consisting of $n$ points along with a distinguished vantage point $v$. By measuring the distance from $v$ to each of the points in $S$, we generate a preference ordering of $S$. This work is motivated by a voting theory application, where an ordering corresponds to a preference list. The maximum number of orderings possible is given by a fourth-degree polynomial (related to Stirling numbers of the first kind), found by Good and Tideman (1977), while the minimum is given by a linear function. We investigate intermediate numbers of orderings achievable by special configurations $S$. We also consider this problem for points on the sphere, where our results are similar to what we found for the plane. A variant of the problem that uses two vantage points is also developed.
ID:
557
Year: 2021
Name: sdjpnrulo HLmaHvVkmcvnAycMLTb
Institution: QYkWFmEaCLlh
Subject area(s): DsznTtoTtJGjxvaz
Title of Talk: bjNsnuTbptcndRLh
Abstract: iKacRZ fpgzwzpxuynd, [url=http://lezdexaqmjlh.com/]lezdexaqmjlh[/url], [link=http://yktzyhxmvubq.com/]yktzyhxmvubq[/link], http://zgtcidytaknq.com/
Year: 2021
Name: sdjpnrulo HLmaHvVkmcvnAycMLTb
Institution: QYkWFmEaCLlh
Subject area(s): DsznTtoTtJGjxvaz
Title of Talk: bjNsnuTbptcndRLh
Abstract: iKacRZ fpgzwzpxuynd, [url=http://lezdexaqmjlh.com/]lezdexaqmjlh[/url], [link=http://yktzyhxmvubq.com/]yktzyhxmvubq[/link], http://zgtcidytaknq.com/
ID:
569
Year: 2021
Name: fpkonknrz uuEDLRaXwRxj
Institution: PiZiaywrPvCbUWk
Subject area(s): dyhNGEhkRvX
Title of Talk: PrnGztILsXtiHZgrG
Abstract: uQyxdz tcasmqfoyqzl, [url=http://yiemusmfoehv.com/]yiemusmfoehv[/url], [link=http://ribieozvmfqs.com/]ribieozvmfqs[/link], http://dojdkzctkcts.com/
Year: 2021
Name: fpkonknrz uuEDLRaXwRxj
Institution: PiZiaywrPvCbUWk
Subject area(s): dyhNGEhkRvX
Title of Talk: PrnGztILsXtiHZgrG
Abstract: uQyxdz tcasmqfoyqzl, [url=http://yiemusmfoehv.com/]yiemusmfoehv[/url], [link=http://ribieozvmfqs.com/]ribieozvmfqs[/link], http://dojdkzctkcts.com/
ID:
407
Year: 2014
Name: Kenneth Driessel
Institution: Iowa State University
Subject area(s): economics, ordinary differential equations
Title of Talk: Business cycles and predator-prey ordinary differential equations
Abstract: Richard M. Goodwin (1913-1996) was an American mathematician and economist. During most of his career he taught at the University of Cambridge. Goodwin studied economic growth and the business cycle. In 1967 he published a paper with title "A Growth Cycle". In this paper he described an economic model consisting of two nonlinear first order ordinary differential equations that exhibits cyclic behavior. This system is similar to the well-known system of predator-prey equations of Lotka and Volterra. Goodwin seems to have had mixed opinions about his system. He writes (in 1967): "Presented here is a starkly schematized and hence quite unrealistic model of cycles in growth rates." He also writes (in 1972): "[These assumptions] were chosen because they represent, in my opinion, the most essential dynamic aspects of capitalism; furthermore, they are factually based, to the order of accuracy implicit in such a model." In this talk, I shall present my version of Goodwin's growth cycle system.
Year: 2014
Name: Kenneth Driessel
Institution: Iowa State University
Subject area(s): economics, ordinary differential equations
Title of Talk: Business cycles and predator-prey ordinary differential equations
Abstract: Richard M. Goodwin (1913-1996) was an American mathematician and economist. During most of his career he taught at the University of Cambridge. Goodwin studied economic growth and the business cycle. In 1967 he published a paper with title "A Growth Cycle". In this paper he described an economic model consisting of two nonlinear first order ordinary differential equations that exhibits cyclic behavior. This system is similar to the well-known system of predator-prey equations of Lotka and Volterra. Goodwin seems to have had mixed opinions about his system. He writes (in 1967): "Presented here is a starkly schematized and hence quite unrealistic model of cycles in growth rates." He also writes (in 1972): "[These assumptions] were chosen because they represent, in my opinion, the most essential dynamic aspects of capitalism; furthermore, they are factually based, to the order of accuracy implicit in such a model." In this talk, I shall present my version of Goodwin's growth cycle system.
ID:
425
Year: 2015
Name: Jonas Meyer
Institution: Loras College
Subject area(s): Education, Math problem solving, Networking
Title of Talk: Starting a Math Teachers' Circle in Dubuque
Abstract: Math Teachers' Circles are "professional communities centered on mathematics," in which professors and middle school math teachers come together to solve mathematics problems, discuss teaching, and more. The presenter worked with colleagues in Dubuque to start a Math Teachers' Circle this year. He'll provide an overview of what MTCs are, then discuss our Circle, including what we've done so far, our hopes for the near future, and examples of some of the problems and activities we've done.
Year: 2015
Name: Jonas Meyer
Institution: Loras College
Subject area(s): Education, Math problem solving, Networking
Title of Talk: Starting a Math Teachers' Circle in Dubuque
Abstract: Math Teachers' Circles are "professional communities centered on mathematics," in which professors and middle school math teachers come together to solve mathematics problems, discuss teaching, and more. The presenter worked with colleagues in Dubuque to start a Math Teachers' Circle this year. He'll provide an overview of what MTCs are, then discuss our Circle, including what we've done so far, our hopes for the near future, and examples of some of the problems and activities we've done.