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 81-100 of 471 results.
Sort by:
ID:
321
Year: 2011
Name: David Bressoud
Institution: #non-IA section
Subject area(s):
Title of Talk: The Truth of Proofs
Abstract: Mathematicians often delude themselves into thinking that we create proofs in order to establish truth. In fact, that which is "proven" is often not true, and mathematical results are often known with certainty to be true long before a proof is found. I will use some illustrations from the history of mathematics to make this point and to show that proof is more about making connections than establishing truth.
Year: 2011
Name: David Bressoud
Institution: #non-IA section
Subject area(s):
Title of Talk: The Truth of Proofs
Abstract: Mathematicians often delude themselves into thinking that we create proofs in order to establish truth. In fact, that which is "proven" is often not true, and mathematical results are often known with certainty to be true long before a proof is found. I will use some illustrations from the history of mathematics to make this point and to show that proof is more about making connections than establishing truth.
ID:
136
Year: 2005
Name: David Bressoud
Institution: Macalester College
Subject area(s): Mathematics Curriculum
Title of Talk: Undergraduate Programs and Courses in the Mathematical Sciences: CUPM Curriculum Guide 2004
Abstract: The MAA's Committee on the Undergraduate Program in Mathematics (CUPM) is charged with making recommendations to guide mathematics departments in designing curricula for their undergraduate students. The CUPM Curriculum Guide 2004, published last Fall provides an up-to-date perspective on the mathematics curriculum for many different student audiences, including of course our own majors. This session will be a presentation followed by a question and answer session with committee member David Bressoud from Macalester College. Free copies of the Guide and Curriculum Foundations Project will be available for those who come to the session.
Year: 2005
Name: David Bressoud
Institution: Macalester College
Subject area(s): Mathematics Curriculum
Title of Talk: Undergraduate Programs and Courses in the Mathematical Sciences: CUPM Curriculum Guide 2004
Abstract: The MAA's Committee on the Undergraduate Program in Mathematics (CUPM) is charged with making recommendations to guide mathematics departments in designing curricula for their undergraduate students. The CUPM Curriculum Guide 2004, published last Fall provides an up-to-date perspective on the mathematics curriculum for many different student audiences, including of course our own majors. This session will be a presentation followed by a question and answer session with committee member David Bressoud from Macalester College. Free copies of the Guide and Curriculum Foundations Project will be available for those who come to the session.
ID:
187
Year: 2007
Name: Thomas Britton
Institution: Coe College
Subject area(s):
Title of Talk: Dots and Lines
Abstract:
Year: 2007
Name: Thomas Britton
Institution: Coe College
Subject area(s):
Title of Talk: Dots and Lines
Abstract:
ID:
498
Year: 2018
Name: Wako Bungula
Institution: University of Iowa
Subject area(s): Topological Data Analysis
Title of Talk: Filtration and Stability of Mapper Graph for Point Cloud Data
Abstract: Filtration and stability of TDA Mapper graph for topological spaces have been studied; and using a generalization of the Bottleneck distance called interleaving distance, the stability of Mapper graph for the topological spaces has been proven. A problem arises when trying to extend this stability theorem to the point cloud data case because clustering algorithms do not usually give filtration. I will be talking about the conditions required for the stability theorem to be extended to point cloud data case.
Year: 2018
Name: Wako Bungula
Institution: University of Iowa
Subject area(s): Topological Data Analysis
Title of Talk: Filtration and Stability of Mapper Graph for Point Cloud Data
Abstract: Filtration and stability of TDA Mapper graph for topological spaces have been studied; and using a generalization of the Bottleneck distance called interleaving distance, the stability of Mapper graph for the topological spaces has been proven. A problem arises when trying to extend this stability theorem to the point cloud data case because clustering algorithms do not usually give filtration. I will be talking about the conditions required for the stability theorem to be extended to point cloud data case.
ID:
411
Year: 2014
Name: Riley Burkart
Institution: Central College
Subject area(s):
Title of Talk: History of the Iowa Section of the MAA
Abstract: The history of the Iowa Section stretches back to 1915, even predating the foundation of the Mathematical Association of America by a month. In this talk, the speaker will present his research on the history of the Iowa Section from its origin to the present, examining the trends and changes in the organization.
Year: 2014
Name: Riley Burkart
Institution: Central College
Subject area(s):
Title of Talk: History of the Iowa Section of the MAA
Abstract: The history of the Iowa Section stretches back to 1915, even predating the foundation of the Mathematical Association of America by a month. In this talk, the speaker will present his research on the history of the Iowa Section from its origin to the present, examining the trends and changes in the organization.
ID:
366
Year: 2013
Name: Steve Butler
Institution: Iowa State University
Subject area(s): Combinatorics
Title of Talk: 291 decillion ways to tile with Tetirs
Abstract: We look at the problem of finding the number of ways to tile a board using tetronimoes (i.e., Tetris pieces). In particular, we show how to transform tiling problems into problems of counting walks. Using this approach we were able to get the exact number of ways to tile the 10x20 board.
Year: 2013
Name: Steve Butler
Institution: Iowa State University
Subject area(s): Combinatorics
Title of Talk: 291 decillion ways to tile with Tetirs
Abstract: We look at the problem of finding the number of ways to tile a board using tetronimoes (i.e., Tetris pieces). In particular, we show how to transform tiling problems into problems of counting walks. Using this approach we were able to get the exact number of ways to tile the 10x20 board.
ID:
458
Year: 2016
Name: Steve Butler
Institution: Iowa State University
Subject area(s):
Title of Talk: An Introduction to the Mathematics of Juggling
Abstract: Juggling and mathematics have been done for thousands of years, but the mathematics of juggling is a relatively new field that dates back a few decades and looks at using the tools of mathematics to analyze, connect, and count various juggling patterns. We will introduce some of the very basic results related to the mathematics of juggling with a particular emphasis at looking at the various methods used to describe juggling patterns.
Year: 2016
Name: Steve Butler
Institution: Iowa State University
Subject area(s):
Title of Talk: An Introduction to the Mathematics of Juggling
Abstract: Juggling and mathematics have been done for thousands of years, but the mathematics of juggling is a relatively new field that dates back a few decades and looks at using the tools of mathematics to analyze, connect, and count various juggling patterns. We will introduce some of the very basic results related to the mathematics of juggling with a particular emphasis at looking at the various methods used to describe juggling patterns.
ID:
480
Year: 2017
Name: Robert Calcaterra
Institution: University of Wisconsin - Platteville
Subject area(s): real analysis
Title of Talk: Jordan's Proof of the Fundamental Theorem of Algebra
Abstract: The most common proofs of the Fundamental Theorem of Algebra rely on either Galois Theory or complex variables. This talk will present a proof of this theorem that primarily employs real analysis and DeMoivre's Theorem that appeared in Jordan's text from nineteenth century. Undergraduate mathematics majors who have had an undergraduate real analysis course should be able follow the talk.
Year: 2017
Name: Robert Calcaterra
Institution: University of Wisconsin - Platteville
Subject area(s): real analysis
Title of Talk: Jordan's Proof of the Fundamental Theorem of Algebra
Abstract: The most common proofs of the Fundamental Theorem of Algebra rely on either Galois Theory or complex variables. This talk will present a proof of this theorem that primarily employs real analysis and DeMoivre's Theorem that appeared in Jordan's text from nineteenth century. Undergraduate mathematics majors who have had an undergraduate real analysis course should be able follow the talk.
ID:
129
Year: 2005
Name: Cindee Calton
Institution: University of Northern Iowa
Subject area(s): Ethnomathematics
Title of Talk: Axioms of Kinship
Abstract: Throughout the world, there are many different ways of defining our relationships with our family members. Who we choose to group together with the same kinship term reveals much about how we view those relatives. Throughout the world, there are only 6 basic ways of grouping relatives, despite the many possible ways of doing so. This talk explores how to think about human kinship axiomatically and discover why only certain patterns appear, using both mathematical and anthropological thinking. Interesting case studies of elaborate patterns of marriage are also explored briefly at the end of the talk.
Year: 2005
Name: Cindee Calton
Institution: University of Northern Iowa
Subject area(s): Ethnomathematics
Title of Talk: Axioms of Kinship
Abstract: Throughout the world, there are many different ways of defining our relationships with our family members. Who we choose to group together with the same kinship term reveals much about how we view those relatives. Throughout the world, there are only 6 basic ways of grouping relatives, despite the many possible ways of doing so. This talk explores how to think about human kinship axiomatically and discover why only certain patterns appear, using both mathematical and anthropological thinking. Interesting case studies of elaborate patterns of marriage are also explored briefly at the end of the talk.
ID:
519
Year: 2018
Name: Eric Canning
Institution: Morningside College
Subject area(s): Mathematics Pedagogy
Title of Talk: The Use of Projects in Calculus II and Linear Algebra
Abstract: I will share my experiences having students, in small groups, create posters and make presentations in Calculus II and Linear Algebra courses. Several students gave poster presentations of their projects at an undergraduate research symposium.
Year: 2018
Name: Eric Canning
Institution: Morningside College
Subject area(s): Mathematics Pedagogy
Title of Talk: The Use of Projects in Calculus II and Linear Algebra
Abstract: I will share my experiences having students, in small groups, create posters and make presentations in Calculus II and Linear Algebra courses. Several students gave poster presentations of their projects at an undergraduate research symposium.
ID:
327
Year: 2012
Name: Eric Canning
Institution: Morningside College
Subject area(s): Experiences with grants
Title of Talk: Who is Grant S. Stem?
Abstract: The Mathematical Sciences department at Morningside College was awarded an S-STEM (NSF Scholarships in Science, Technology, Engineering, and Mathematics) grant for the 2009-10 through 2012-13 academic years. I will share our experiences, and maybe some advice, with writing the proposal and maintaining this grant.
Year: 2012
Name: Eric Canning
Institution: Morningside College
Subject area(s): Experiences with grants
Title of Talk: Who is Grant S. Stem?
Abstract: The Mathematical Sciences department at Morningside College was awarded an S-STEM (NSF Scholarships in Science, Technology, Engineering, and Mathematics) grant for the 2009-10 through 2012-13 academic years. I will share our experiences, and maybe some advice, with writing the proposal and maintaining this grant.
ID:
428
Year: 2015
Name: Christine Caples
Institution: University of Iowa
Subject area(s): Knot Theory
Title of Talk: Tangle Classification
Abstract: A knot can be thought of as a knotted piece of string with the ends glued together. A tangle is formed by intersecting a knot with a 3-dimensional ball. The portion of the knot in the interior of the ball along with the fixed intersection points on the surface of the ball form the tangle. Tangles can be used to model protein-DNA binding, so another way to think of a tangle is in terms of segments of DNA (the strings) bounded by the protein complex (the 3-dimensional ball). Like knots, the same tangle can be represented by multiple diagrams which are equivalent under deformations (no cutting or gluing allowed). A tangle invariant is a value that is the same for equivalent tangles. Tangles can be classified into families which allows one to study properties of tangles that may be useful for solving tangle equations. This talk will be an introduction to knot theory and will investigate how tangle invariants can be used to classify tangles.
Year: 2015
Name: Christine Caples
Institution: University of Iowa
Subject area(s): Knot Theory
Title of Talk: Tangle Classification
Abstract: A knot can be thought of as a knotted piece of string with the ends glued together. A tangle is formed by intersecting a knot with a 3-dimensional ball. The portion of the knot in the interior of the ball along with the fixed intersection points on the surface of the ball form the tangle. Tangles can be used to model protein-DNA binding, so another way to think of a tangle is in terms of segments of DNA (the strings) bounded by the protein complex (the 3-dimensional ball). Like knots, the same tangle can be represented by multiple diagrams which are equivalent under deformations (no cutting or gluing allowed). A tangle invariant is a value that is the same for equivalent tangles. Tangles can be classified into families which allows one to study properties of tangles that may be useful for solving tangle equations. This talk will be an introduction to knot theory and will investigate how tangle invariants can be used to classify tangles.
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:
395
Year: 2014
Name: Adam Case
Institution: Iowa State University
Subject area(s): Algorithmic Information Theory
Title of Talk: Mutual Dimension
Abstract: The mutual (shared) information between two random variables is a well-understood concept in Shannon information theory, but how do we think about mutual information between other kinds of objects such as strings or real numbers? In this talk, we discuss various notions of mutual information from the perspective of algorithmic information theory. First we explore the algorithmic information content of a binary string. We then discuss the notion of the dimension (density of algorithmic information) of a real number. Finally, we explain our recent solution to an open problem: the correct formulation of the mutual information between two real numbers. This is joint work with Jack Lutz. The talk will be accessible to math undergraduates.
Year: 2014
Name: Adam Case
Institution: Iowa State University
Subject area(s): Algorithmic Information Theory
Title of Talk: Mutual Dimension
Abstract: The mutual (shared) information between two random variables is a well-understood concept in Shannon information theory, but how do we think about mutual information between other kinds of objects such as strings or real numbers? In this talk, we discuss various notions of mutual information from the perspective of algorithmic information theory. First we explore the algorithmic information content of a binary string. We then discuss the notion of the dimension (density of algorithmic information) of a real number. Finally, we explain our recent solution to an open problem: the correct formulation of the mutual information between two real numbers. This is joint work with Jack Lutz. The talk will be accessible to math undergraduates.
ID:
516
Year: 2018
Name: Carlos Castillo-Chavez
Institution: Arizona State University
Subject area(s):
Title of Talk: Epidemiology: Role of dynamic individual decisions during ongoing epidemic outbreaks
Abstract: The lecture begins with a historical review of epidemic models and the concept of tipping point. We then revisit phenomenologically inspired modeling frameworks that account for the impact that single disease outbreaks have on the decisions that individuals make in response to real or perceived risk of infection. Finally, a behavioral framework where individual decisions are modeled as a function of tradeoffs made in response to self-assessed costs tied to present or future risks of infection, including those resulting from potential loss of benefits due to risk aversion decisions is introduced and implemented on a simplified population-level epidemic model. The impact of these decisions is illustrated in the context of a single influenza outbreak.
Year: 2018
Name: Carlos Castillo-Chavez
Institution: Arizona State University
Subject area(s):
Title of Talk: Epidemiology: Role of dynamic individual decisions during ongoing epidemic outbreaks
Abstract: The lecture begins with a historical review of epidemic models and the concept of tipping point. We then revisit phenomenologically inspired modeling frameworks that account for the impact that single disease outbreaks have on the decisions that individuals make in response to real or perceived risk of infection. Finally, a behavioral framework where individual decisions are modeled as a function of tradeoffs made in response to self-assessed costs tied to present or future risks of infection, including those resulting from potential loss of benefits due to risk aversion decisions is introduced and implemented on a simplified population-level epidemic model. The impact of these decisions is illustrated in the context of a single influenza outbreak.
ID:
58
Year: 2004
Name: Marc Chamberland
Institution: Grinnell College
Subject area(s):
Title of Talk: Unbounded Orbits and Binary Digits
Abstract: We consider iterating the map f(x)=x - 1/x, starting at x=2. Ron Graham asked whether the orbit is bounded. This problem intersects number theory (rationals, the normality of numbers) and dynamics (dynamcis on an interval, chaos). You will find out why this is such a hard problem! The talk will be accessible to a general audience.
Year: 2004
Name: Marc Chamberland
Institution: Grinnell College
Subject area(s):
Title of Talk: Unbounded Orbits and Binary Digits
Abstract: We consider iterating the map f(x)=x - 1/x, starting at x=2. Ron Graham asked whether the orbit is bounded. This problem intersects number theory (rationals, the normality of numbers) and dynamics (dynamcis on an interval, chaos). You will find out why this is such a hard problem! The talk will be accessible to a general audience.
ID:
339
Year: 2012
Name: Marc Chamberland
Institution: Grinnell College
Subject area(s): analysis
Title of Talk: A Beautiful Cantor-like Function
Abstract: Analysis students encounter various functions with exotic properties. This could include functions with infinitely many discontinuities (Dirichlet function, Thomae function, windmill functions) or continuous functions which grow in a bizarre way (Cantor function, Minkowski's question mark function). After quickly reviewing these, we introduce a new function f(x) which combines enticing properties from both of these classes: a dense set of discontinuities, fractal structure, a base-3 digital representation, satisfies f(f(x))=x, and has surprising integral properties. This function makes an excellent study to conclude a first course in analysis.
Year: 2012
Name: Marc Chamberland
Institution: Grinnell College
Subject area(s): analysis
Title of Talk: A Beautiful Cantor-like Function
Abstract: Analysis students encounter various functions with exotic properties. This could include functions with infinitely many discontinuities (Dirichlet function, Thomae function, windmill functions) or continuous functions which grow in a bizarre way (Cantor function, Minkowski's question mark function). After quickly reviewing these, we introduce a new function f(x) which combines enticing properties from both of these classes: a dense set of discontinuities, fractal structure, a base-3 digital representation, satisfies f(f(x))=x, and has surprising integral properties. This function makes an excellent study to conclude a first course in analysis.
ID:
421
Year: 2015
Name: Marc Chamberland
Institution: Grinnell College
Subject area(s): general, educational
Title of Talk: Popularizing Mathematics with YouTube
Abstract: How is mathematics being popularized with YouTube? We show various math channels, including the speaker's channel Tipping Point Math, and explain what goes into making such videos.
Year: 2015
Name: Marc Chamberland
Institution: Grinnell College
Subject area(s): general, educational
Title of Talk: Popularizing Mathematics with YouTube
Abstract: How is mathematics being popularized with YouTube? We show various math channels, including the speaker's channel Tipping Point Math, and explain what goes into making such videos.
ID:
167
Year: 2006
Name: Marc Chamberland
Institution: Grinnell College
Subject area(s): undergrad level analysis
Title of Talk: Mathematics by Experiment
Abstract: The use of computer packages has brought us to a point where the computer can be used for many tasks: discover new mathematical patterns and relationships, create impressive graphics to expose mathematical structure, falsify conjectures, confirm analytically derived results, and perhaps most impressively for the purist, suggest approaches for formal proofs. This is the thrust of experimental mathematics. This talk will give some examples to discover or prove results concerning goemetry, integrals, binomial sums, and infinite series.
Year: 2006
Name: Marc Chamberland
Institution: Grinnell College
Subject area(s): undergrad level analysis
Title of Talk: Mathematics by Experiment
Abstract: The use of computer packages has brought us to a point where the computer can be used for many tasks: discover new mathematical patterns and relationships, create impressive graphics to expose mathematical structure, falsify conjectures, confirm analytically derived results, and perhaps most impressively for the purist, suggest approaches for formal proofs. This is the thrust of experimental mathematics. This talk will give some examples to discover or prove results concerning goemetry, integrals, binomial sums, and infinite series.
ID:
190
Year: 2007
Name: Marc Chamberland
Institution: Grinnell College
Subject area(s): sequences, number theory, dynamics, fractals
Title of Talk: The Mean-Median Map
Abstract: Starting with a non-empty finite set S_n={x_1,\ldots,x_n} contained in R, generate the unique number x_{n+1} which satisfies the mean-median equation (x_1 + \cdots + x_n + x_{n+1}/(n+1) = median(S_n) . As usual, we define the median of the set S_n = {x_1,\ldots,x_n}, where x_1<= ... <= x_n, as median (S_n) = \left\{ x_{(n+1)/2}, n odd , \frac{x_{n/2} + x_{n/2+1}}{2}, n even . By applying the mean-median equation repeatedly to a set one generates an infinite sequence {x_k}_{k=1}^\infty. The dynamics of this map are surprising! Most maps tend to have either relatively simple dynamics or chaotic dynamics. While the mean-median map seems to be asymptotically constant, it seems very hard to predict. This talk will showcase the work done to date. This is joint work with Mario Martelli (Claremont McKenna College).
Year: 2007
Name: Marc Chamberland
Institution: Grinnell College
Subject area(s): sequences, number theory, dynamics, fractals
Title of Talk: The Mean-Median Map
Abstract: Starting with a non-empty finite set S_n={x_1,\ldots,x_n} contained in R, generate the unique number x_{n+1} which satisfies the mean-median equation (x_1 + \cdots + x_n + x_{n+1}/(n+1) = median(S_n) . As usual, we define the median of the set S_n = {x_1,\ldots,x_n}, where x_1<= ... <= x_n, as median (S_n) = \left\{ x_{(n+1)/2}, n odd , \frac{x_{n/2} + x_{n/2+1}}{2}, n even . By applying the mean-median equation repeatedly to a set one generates an infinite sequence {x_k}_{k=1}^\infty. The dynamics of this map are surprising! Most maps tend to have either relatively simple dynamics or chaotic dynamics. While the mean-median map seems to be asymptotically constant, it seems very hard to predict. This talk will showcase the work done to date. This is joint work with Mario Martelli (Claremont McKenna College).