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 181-200 of 471 results.
Sort by:
ID:
188
Year: 2007
Name: Neil Martinsen-Burrell
Institution: Wartburg College
Subject area(s): applied math, dynamical systems
Title of Talk: Assimilating Drifter Trajectories using Gradient Descent
Abstract: In geophysics, we frequently try to couple dynamical models of physical systems such as the atmosphere or ocean with direct observations of those systems. In the atmosphere, with fixed observing stations, there are advanced techniques for Numerical Weather Prediction. In the ocean, observations are often made by objects that drift with the flow. This presents difficulties for conventional data assimilation methods. I will discuss one possible way to assimilate drifter trajectories into a very simple dynamical model.
Year: 2007
Name: Neil Martinsen-Burrell
Institution: Wartburg College
Subject area(s): applied math, dynamical systems
Title of Talk: Assimilating Drifter Trajectories using Gradient Descent
Abstract: In geophysics, we frequently try to couple dynamical models of physical systems such as the atmosphere or ocean with direct observations of those systems. In the atmosphere, with fixed observing stations, there are advanced techniques for Numerical Weather Prediction. In the ocean, observations are often made by objects that drift with the flow. This presents difficulties for conventional data assimilation methods. I will discuss one possible way to assimilate drifter trajectories into a very simple dynamical model.
ID:
234
Year: 2008
Name: Neil Martinsen-Burrell
Institution: Wartburg College
Subject area(s): Applied Math, Geometry
Title of Talk: The Ping and the Pong: Echolocating for fun and profit
Abstract: Table tennis is the world's most popular sport. Little is known about the physical parameters of the game. In an effort to understand the basic flow of the game, we constructed an echolocation system that could find the location and time of the "ping" and the "pong" based on recordings from 4 microphones placed around the room. Such information can be used to approximately calculate the speeds at which the ball travels in a game of table tennis.
Year: 2008
Name: Neil Martinsen-Burrell
Institution: Wartburg College
Subject area(s): Applied Math, Geometry
Title of Talk: The Ping and the Pong: Echolocating for fun and profit
Abstract: Table tennis is the world's most popular sport. Little is known about the physical parameters of the game. In an effort to understand the basic flow of the game, we constructed an echolocation system that could find the location and time of the "ping" and the "pong" based on recordings from 4 microphones placed around the room. Such information can be used to approximately calculate the speeds at which the ball travels in a game of table tennis.
ID:
26
Year: 2004
Name: Ryan Martin
Institution: Iowa State University
Subject area(s): Combinatorics, Graph Theory
Title of Talk: Six degrees of graph theory: Kevin Bacon, Paul Erdos, William McKinley and me
Abstract: Popularized by the Kevin Bacon game, the Small World problem is a question of measuring distance between members of a given set, upon which is a binary symmetric relationship. In the game, the set is the set of actors and two actors are linked if they appeared in the same movie. The distance between two actors is the fewest number of links to get from one to the other. In this talk, we discuss the game and a random graph model that gives an answer to a Small World-type question.
Year: 2004
Name: Ryan Martin
Institution: Iowa State University
Subject area(s): Combinatorics, Graph Theory
Title of Talk: Six degrees of graph theory: Kevin Bacon, Paul Erdos, William McKinley and me
Abstract: Popularized by the Kevin Bacon game, the Small World problem is a question of measuring distance between members of a given set, upon which is a binary symmetric relationship. In the game, the set is the set of actors and two actors are linked if they appeared in the same movie. The distance between two actors is the fewest number of links to get from one to the other. In this talk, we discuss the game and a random graph model that gives an answer to a Small World-type question.
ID:
174
Year: 2006
Name: Ryan Martin
Institution: Iowa State University
Subject area(s): Graph Theory
Title of Talk: Vertex identifying codes in graphs: definitions, theorems and open problems
Abstract: In 1998, Karpovsky, Chakrabarty and Levitin introduced a new graph invariant called the vertex identification code. If C is a subset of the vertices, then C is a vertex-identifying code if each set N[v]\cap C is distinct and nonempty, where N[v] denotes the closed neighborhood of vertex v. We will discuss a number of results on the size of the smallest code in a graph, particularly on the Erdos-Renyi random graph and we will present open problems.
Year: 2006
Name: Ryan Martin
Institution: Iowa State University
Subject area(s): Graph Theory
Title of Talk: Vertex identifying codes in graphs: definitions, theorems and open problems
Abstract: In 1998, Karpovsky, Chakrabarty and Levitin introduced a new graph invariant called the vertex identification code. If C is a subset of the vertices, then C is a vertex-identifying code if each set N[v]\cap C is distinct and nonempty, where N[v] denotes the closed neighborhood of vertex v. We will discuss a number of results on the size of the smallest code in a graph, particularly on the Erdos-Renyi random graph and we will present open problems.
ID:
161
Year: 2006
Name: Jacob Manske
Institution: Iowa State University
Subject area(s): Philosophy of Mathematics
Title of Talk: Hey, Kids! Improve Your Theorems! Add Superfluous Hypotheses!
Abstract: In spite of the fact that we tell students not to assume what they are trying to prove, we all must do precisely that. The interesting theorems, then, turn out to be the ones whose tautologous nature is elusive. This will be a philosophical discussion; bellicose debate is encouraged.
Year: 2006
Name: Jacob Manske
Institution: Iowa State University
Subject area(s): Philosophy of Mathematics
Title of Talk: Hey, Kids! Improve Your Theorems! Add Superfluous Hypotheses!
Abstract: In spite of the fact that we tell students not to assume what they are trying to prove, we all must do precisely that. The interesting theorems, then, turn out to be the ones whose tautologous nature is elusive. This will be a philosophical discussion; bellicose debate is encouraged.
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:
542
Year: 2019
Name: Michael Loper
Institution: University of Minnesota
Subject area(s):
Title of Talk: Combating Math Anxiety Through Mastery Based Testing
Abstract: Math anxiety is a major deterrent to learning in College Algebra. One way to reduce test anxiety is through mastery based testing. Another way is by aiming for a higher average exam score by eliminating the most difficult questions on an exam. In this talk I will discuss how the University of Minnesota implemented both of these techniques while instructing College Algebra. I will also explain how the use of optional “A-work” helped to distinguish top scoring students’ grades.
Year: 2019
Name: Michael Loper
Institution: University of Minnesota
Subject area(s):
Title of Talk: Combating Math Anxiety Through Mastery Based Testing
Abstract: Math anxiety is a major deterrent to learning in College Algebra. One way to reduce test anxiety is through mastery based testing. Another way is by aiming for a higher average exam score by eliminating the most difficult questions on an exam. In this talk I will discuss how the University of Minnesota implemented both of these techniques while instructing College Algebra. I will also explain how the use of optional “A-work” helped to distinguish top scoring students’ grades.
ID:
574
Year: 2021
Name: Sergio Loch
Institution: Grand View University
Subject area(s):
Title of Talk: Initial Report on work about Math Transition
Abstract: Approaching existing issues for the high school to college transition requires the collaboration of the players involved in this transition: students, parents, teachers, instructors, counselors, and all their institutions and professional organizations. IHEMTAC is attempting to develop and propose ideas in the crucial area of mathematics to facilitate this interaction.
Year: 2021
Name: Sergio Loch
Institution: Grand View University
Subject area(s):
Title of Talk: Initial Report on work about Math Transition
Abstract: Approaching existing issues for the high school to college transition requires the collaboration of the players involved in this transition: students, parents, teachers, instructors, counselors, and all their institutions and professional organizations. IHEMTAC is attempting to develop and propose ideas in the crucial area of mathematics to facilitate this interaction.
ID:
162
Year: 2006
Name: Giovanna Llosent
Institution: University of Iowa
Subject area(s): Modular Representation Theory
Title of Talk: The stable endomorphism group of non-simple string modules over a very particular finite dimensional algebra.
Abstract: Let A be a finite dimensional algebra over an algebraic closed field k of characteristic 2 with a quiver representation and relations. Consider all non-simple string modules for this algebra which do not lie in the Auslander-Reiten component of the simple modules. Is there a non-simple string module M for which the group of stable endomorphisms is isomorphic to k? Under the hypothesis above we were able to prove that the underlying string S of the string module M has a substring S' and there is an endomorphism that does not factor through a projective A-module and lies in S'. The maximun lenght of the underlying string of a string module needed for completing the study of all stable endomorphism groups of non-simple string modules was 17. In particular, the cases needed for complete generalization are 54.
Year: 2006
Name: Giovanna Llosent
Institution: University of Iowa
Subject area(s): Modular Representation Theory
Title of Talk: The stable endomorphism group of non-simple string modules over a very particular finite dimensional algebra.
Abstract: Let A be a finite dimensional algebra over an algebraic closed field k of characteristic 2 with a quiver representation and relations. Consider all non-simple string modules for this algebra which do not lie in the Auslander-Reiten component of the simple modules. Is there a non-simple string module M for which the group of stable endomorphisms is isomorphic to k? Under the hypothesis above we were able to prove that the underlying string S of the string module M has a substring S' and there is an endomorphism that does not factor through a projective A-module and lies in S'. The maximun lenght of the underlying string of a string module needed for completing the study of all stable endomorphism groups of non-simple string modules was 17. In particular, the cases needed for complete generalization are 54.
ID:
152
Year: 2006
Name: Kunlun Liu
Institution: Iowa State University
Subject area(s): PDE
Title of Talk: Existence of strong solution for a class of nonlinear parabolic systems
Abstract: This paper deals with the local and global existence of the strong solution for a class of nonlinear parabolic PDEs in the domain [0,T]
Year: 2006
Name: Kunlun Liu
Institution: Iowa State University
Subject area(s): PDE
Title of Talk: Existence of strong solution for a class of nonlinear parabolic systems
Abstract: This paper deals with the local and global existence of the strong solution for a class of nonlinear parabolic PDEs in the domain [0,T]
ID:
538
Year: 2019
Name: William Lindsey
Institution: Dordt University
Subject area(s):
Title of Talk: Epidemic! Role-Playing in Introductory Statistics
Abstract: How can we use our statistical knowledge to help save (or at least, inform) the world? I will describe a day from my Introductory Statistics class where students were "hired" by the CDC to help answer questions about a fictional epidemic that was plaguing the Atlanta area.
Year: 2019
Name: William Lindsey
Institution: Dordt University
Subject area(s):
Title of Talk: Epidemic! Role-Playing in Introductory Statistics
Abstract: How can we use our statistical knowledge to help save (or at least, inform) the world? I will describe a day from my Introductory Statistics class where students were "hired" by the CDC to help answer questions about a fictional epidemic that was plaguing the Atlanta area.
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:
225
Year: 2008
Name: Yi Li
Institution: University of Iowa
Subject area(s):
Title of Talk: REU 2007 at University of Iowa--A Personal Experience
Abstract: This talk is about the summer '07 REU work I supervised. I want to tell you about work of three wonderful visiting undergraduate students and the paper they recently submitted: "Chaotic Dynamics, Fractals and Billiards." I also want to tell you about my experience as a first time REU mentor.
Year: 2008
Name: Yi Li
Institution: University of Iowa
Subject area(s):
Title of Talk: REU 2007 at University of Iowa--A Personal Experience
Abstract: This talk is about the summer '07 REU work I supervised. I want to tell you about work of three wonderful visiting undergraduate students and the paper they recently submitted: "Chaotic Dynamics, Fractals and Billiards." I also want to tell you about my experience as a first time REU mentor.
ID:
426
Year: 2015
Name: Kristopher Lee
Institution: Iowa State University
Subject area(s):
Title of Talk: MATH 106X: A New Course at Iowa State
Abstract: Last year, the College of Liberal Arts and Sciences at Iowa State approved the creation of an inquiry-based mathematics course for the liberal arts. The course has begun this semester, and I will discuss my experience as the faithful guide to the intrepid explorers who so bravely signed up for this journey to discover mathematics.
Year: 2015
Name: Kristopher Lee
Institution: Iowa State University
Subject area(s):
Title of Talk: MATH 106X: A New Course at Iowa State
Abstract: Last year, the College of Liberal Arts and Sciences at Iowa State approved the creation of an inquiry-based mathematics course for the liberal arts. The course has begun this semester, and I will discuss my experience as the faithful guide to the intrepid explorers who so bravely signed up for this journey to discover mathematics.
ID:
502
Year: 2018
Name: Kristopher Lee
Institution: Iowa State University
Subject area(s):
Title of Talk: Characterizing Isometries: A Long Running Undergraduate Research Project
Abstract: In 2010, my adviser Aaron Luttman began an undergraduate research project with an honors student at Clarkson University. The goal was to investigate a decomposition for isometries between normed vector spaces; specifically, to prove that the domain of the isometry had to be the direct sum of ``nice'' subspaces. The project ended in 2011 when my adviser (and the student) left academia. I revived the project in 2015 with an honors student here at Iowa State University, and while significant progress was made, we did not fully resolve it. This semester, I am approaching the problem again with a new student. We'll talk about the ins, outs, and what-have-yous of the project, where we currently stand, and the plan going forward.
Year: 2018
Name: Kristopher Lee
Institution: Iowa State University
Subject area(s):
Title of Talk: Characterizing Isometries: A Long Running Undergraduate Research Project
Abstract: In 2010, my adviser Aaron Luttman began an undergraduate research project with an honors student at Clarkson University. The goal was to investigate a decomposition for isometries between normed vector spaces; specifically, to prove that the domain of the isometry had to be the direct sum of ``nice'' subspaces. The project ended in 2011 when my adviser (and the student) left academia. I revived the project in 2015 with an honors student here at Iowa State University, and while significant progress was made, we did not fully resolve it. This semester, I am approaching the problem again with a new student. We'll talk about the ins, outs, and what-have-yous of the project, where we currently stand, and the plan going forward.
ID:
171
Year: 2006
Name: Reginald Laursen
Institution: Luther College
Subject area(s): Real Analysis
Title of Talk: Classroom Capsule: Teaching Challenge-Response Arguments
Abstract: The forward-backward method is a fundamental proof technique for helping students understand how to construct proofs. I will describe my latest variation in the application of this technique for addressing challenge-response arguments in a Real Analysis class. Using this variation my lower ability students have had greater success.
Year: 2006
Name: Reginald Laursen
Institution: Luther College
Subject area(s): Real Analysis
Title of Talk: Classroom Capsule: Teaching Challenge-Response Arguments
Abstract: The forward-backward method is a fundamental proof technique for helping students understand how to construct proofs. I will describe my latest variation in the application of this technique for addressing challenge-response arguments in a Real Analysis class. Using this variation my lower ability students have had greater success.
ID:
145
Year: 2006
Name: Michael Larsen
Institution: Iowa State University
Subject area(s): Statistics, Teaching Statistics
Title of Talk: Teaching Mathematical Probability and Statistics with Internet Applications and R
Abstract: Courses in mathematical statistics can use Internet applications and simulation using the R statistical package to enhance the learning experience. Internet material has been developed for introductory probability and statistics courses and for teaching mathematics at the level of calculus. In order to adapt this material to an intermediate undergraduate probability course, it is necessary to select material to use and incorporate it into lecture, homework assignments, and study problems. The R statistical package is a free software package that can be used for simulation, includes functions related to many probability distributions, and can be used to produce nice graphical displays. Using R in a calculus-based probability course requires writing problems for homework assignments, in-class use, and review that make substantial use of simulation and R
Year: 2006
Name: Michael Larsen
Institution: Iowa State University
Subject area(s): Statistics, Teaching Statistics
Title of Talk: Teaching Mathematical Probability and Statistics with Internet Applications and R
Abstract: Courses in mathematical statistics can use Internet applications and simulation using the R statistical package to enhance the learning experience. Internet material has been developed for introductory probability and statistics courses and for teaching mathematics at the level of calculus. In order to adapt this material to an intermediate undergraduate probability course, it is necessary to select material to use and incorporate it into lecture, homework assignments, and study problems. The R statistical package is a free software package that can be used for simulation, includes functions related to many probability distributions, and can be used to produce nice graphical displays. Using R in a calculus-based probability course requires writing problems for homework assignments, in-class use, and review that make substantial use of simulation and R
ID:
192
Year: 2007
Name: Chris Kurth
Institution: Iowa State University
Subject area(s): Number Theory
Title of Talk: Farey Symbols and subgroups of $SL_2(Z)$
Abstract: The structure of subgroups of SL_2(Z) (2x2 integer coefficient matrices with determinant 1) is important in the study of modular forms. Associated to these subgroups is an object called a Farey Symbol which contains the structure of the group in a very compact form. For instance, from the Farey Symbol one can easily calculate an independent set of generators for the group, a coset decomposition, and determine if the group is congruence. In this talk, I will discuss finite index subgroups of SL_2(Z)$ and the computation and use of Farey Symbols for these subgroups.
Year: 2007
Name: Chris Kurth
Institution: Iowa State University
Subject area(s): Number Theory
Title of Talk: Farey Symbols and subgroups of $SL_2(Z)$
Abstract: The structure of subgroups of SL_2(Z) (2x2 integer coefficient matrices with determinant 1) is important in the study of modular forms. Associated to these subgroups is an object called a Farey Symbol which contains the structure of the group in a very compact form. For instance, from the Farey Symbol one can easily calculate an independent set of generators for the group, a coset decomposition, and determine if the group is congruence. In this talk, I will discuss finite index subgroups of SL_2(Z)$ and the computation and use of Farey Symbols for these subgroups.
ID:
518
Year: 2018
Name: Angela Kohlhaas
Institution: Loras College
Subject area(s):
Title of Talk: Data Reasoning: Changing our General Math Requirement
Abstract: At Loras College, we have had a mathematical modeling requirement in our general education for some time. Traditional courses like college algebra, precalculus, and calculus satisfy the requirement, as do a variety of “math for liberal arts” type courses. Though all of them use data, none of them deeply engage students in reasoning with data. This means we are not really preparing our students to engage with our data-driven world. We have also had an increased demand for statistics, which barely satisfies our math modeling outcomes. So, whether we are sages or fools, we have decided to essentially change our general education math requirement to a statistics requirement. In this talk, we will share our hopes, our steps in this direction, and our concerns so far.
Year: 2018
Name: Angela Kohlhaas
Institution: Loras College
Subject area(s):
Title of Talk: Data Reasoning: Changing our General Math Requirement
Abstract: At Loras College, we have had a mathematical modeling requirement in our general education for some time. Traditional courses like college algebra, precalculus, and calculus satisfy the requirement, as do a variety of “math for liberal arts” type courses. Though all of them use data, none of them deeply engage students in reasoning with data. This means we are not really preparing our students to engage with our data-driven world. We have also had an increased demand for statistics, which barely satisfies our math modeling outcomes. So, whether we are sages or fools, we have decided to essentially change our general education math requirement to a statistics requirement. In this talk, we will share our hopes, our steps in this direction, and our concerns so far.
ID:
551
Year: 2019
Name: Angela Kohlhaas
Institution: Loras College
Subject area(s):
Title of Talk: Iowa Mathematics Pathway Forum
Abstract: This fall, members of the Iowa Department of Education started a statewide conversation with the goal of improving student success in transitioning from high school to college math, with a focus on low income students and underrepresented minorities. This conversation is taking place through a series of monthly online discussions connecting representatives from various professional Iowa math organizations across high schools, community colleges, Regents institutions, and private four-year colleges and universities. As our representative from the Iowa MAA, I will share the background for this initiative as well as our current progress defining challenges and brainstorming solutions. I will also invite discussion and continued brainstorming from the audience.
Year: 2019
Name: Angela Kohlhaas
Institution: Loras College
Subject area(s):
Title of Talk: Iowa Mathematics Pathway Forum
Abstract: This fall, members of the Iowa Department of Education started a statewide conversation with the goal of improving student success in transitioning from high school to college math, with a focus on low income students and underrepresented minorities. This conversation is taking place through a series of monthly online discussions connecting representatives from various professional Iowa math organizations across high schools, community colleges, Regents institutions, and private four-year colleges and universities. As our representative from the Iowa MAA, I will share the background for this initiative as well as our current progress defining challenges and brainstorming solutions. I will also invite discussion and continued brainstorming from the audience.