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 281-300 of 471 results.
Sort by:
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:
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:
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:
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:
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:
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:
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:
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:
322
Year: 2012
Name: Neil Martinsen-Burrell
Institution: Wartburg College
Subject area(s): teaching introductory statistics
Title of Talk: Teaching Introductory Statistics: An Impostor's Perspective
Abstract: I am not a statistician, but I do play one at my institution. This talk will reflect on an applied mathematician's experience teaching many, many sections of introductory statistics over the past six years. I will discuss challenges that a mathematician may face when teaching statistics, lessons I have learned, and helpful (and unhelpful) resources.
Year: 2012
Name: Neil Martinsen-Burrell
Institution: Wartburg College
Subject area(s): teaching introductory statistics
Title of Talk: Teaching Introductory Statistics: An Impostor's Perspective
Abstract: I am not a statistician, but I do play one at my institution. This talk will reflect on an applied mathematician's experience teaching many, many sections of introductory statistics over the past six years. I will discuss challenges that a mathematician may face when teaching statistics, lessons I have learned, and helpful (and unhelpful) resources.
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:
521
Year: 2018
Name: Amanda Matson
Institution: Clarke University
Subject area(s):
Title of Talk: MAAthfest Roundup
Abstract: Bringing MAAthfest to Iowa, Dr. Matson will recap some of the happenings at MAAthfest and invite others to build on that information.
Year: 2018
Name: Amanda Matson
Institution: Clarke University
Subject area(s):
Title of Talk: MAAthfest Roundup
Abstract: Bringing MAAthfest to Iowa, Dr. Matson will recap some of the happenings at MAAthfest and invite others to build on that information.
ID:
528
Year: 2019
Name: Amanda Matson
Institution: Clarke University
Subject area(s):
Title of Talk: MAAthfest Roundup
Abstract: Dr. Matson will be sharing tips and tricks picked up at MAA's Mathfest. Come listen to what was gained and share your own ideas.
Year: 2019
Name: Amanda Matson
Institution: Clarke University
Subject area(s):
Title of Talk: MAAthfest Roundup
Abstract: Dr. Matson will be sharing tips and tricks picked up at MAA's Mathfest. Come listen to what was gained and share your own ideas.
ID:
573
Year: 2021
Name: Amanda Matson
Institution: Clarke University
Subject area(s):
Title of Talk: Smiling While Grading: A Pursuit of a Paradox
Abstract: Dr. Matson will share the outcomes-based approach developed jointly with Dr. Kingston that ended with smiling while grading.
Year: 2021
Name: Amanda Matson
Institution: Clarke University
Subject area(s):
Title of Talk: Smiling While Grading: A Pursuit of a Paradox
Abstract: Dr. Matson will share the outcomes-based approach developed jointly with Dr. Kingston that ended with smiling while grading.
ID:
361
Year: 2013
Name: Amanda Matson
Institution: Clarke University
Subject area(s): active learning, IBL, calculus
Title of Talk: IBL, Calculus, and Pens
Abstract: After attending the IBL Workshop this summer, I got inspired to incorporate parts of an IBL atmosphere in my general education differential calculus course. Here I will convey the things that worked and some of the things that didn't work as well as they could have.
Year: 2013
Name: Amanda Matson
Institution: Clarke University
Subject area(s): active learning, IBL, calculus
Title of Talk: IBL, Calculus, and Pens
Abstract: After attending the IBL Workshop this summer, I got inspired to incorporate parts of an IBL atmosphere in my general education differential calculus course. Here I will convey the things that worked and some of the things that didn't work as well as they could have.
ID:
453
Year: 2016
Name: Amanda Matson
Institution: Clarke University
Subject area(s):
Title of Talk: Let's Do Some Math
Abstract: I will bring some fun math problems that we can dig into for no better reason than to do some math.
Year: 2016
Name: Amanda Matson
Institution: Clarke University
Subject area(s):
Title of Talk: Let's Do Some Math
Abstract: I will bring some fun math problems that we can dig into for no better reason than to do some math.
ID:
471
Year: 2017
Name: Amanda Matson
Institution: Clarke University
Subject area(s):
Title of Talk: Mathfest and Beyond!
Abstract: In this talk, Dr. Matson will be sharing insights she picked up at Mathfest and welcome participants to also share teaching tidbits/professional advice they gleaned from attending Mathfest.
Year: 2017
Name: Amanda Matson
Institution: Clarke University
Subject area(s):
Title of Talk: Mathfest and Beyond!
Abstract: In this talk, Dr. Matson will be sharing insights she picked up at Mathfest and welcome participants to also share teaching tidbits/professional advice they gleaned from attending Mathfest.
ID:
271
Year: 2009
Name: Aba Mbirika
Institution: University of Iowa
Subject area(s):
Title of Talk: Cool combinatorics arising on a cohomology hunt!
Abstract: Can cool combinatorics arise in a hunt for the cohomology ring of a variety? Yes indeed! In 1992, De Mari, Proces, and Shayman introduce Hessenberg varieties. These are a natural generalization of the famed Springer variety. Much is known about the cohomology ring of the Springer variety, but little is known in the case of a general Hessenberg. We provide a step in this direction by inspecting a certain subfamily of Hessenbergs called the Peterson variety. We conjecture that the cohomology ring of a Peterson variety has the presentation of a graded quotient of a polynomial ring modulo a special ideal with very nice combinatorial properties. Along the way, cute combinatorics pops up in the form of Dyck paths, Catalan numbers, etc. We also discuss tantalizing recent work that might help confirm our conjecture.
Year: 2009
Name: Aba Mbirika
Institution: University of Iowa
Subject area(s):
Title of Talk: Cool combinatorics arising on a cohomology hunt!
Abstract: Can cool combinatorics arise in a hunt for the cohomology ring of a variety? Yes indeed! In 1992, De Mari, Proces, and Shayman introduce Hessenberg varieties. These are a natural generalization of the famed Springer variety. Much is known about the cohomology ring of the Springer variety, but little is known in the case of a general Hessenberg. We provide a step in this direction by inspecting a certain subfamily of Hessenbergs called the Peterson variety. We conjecture that the cohomology ring of a Peterson variety has the presentation of a graded quotient of a polynomial ring modulo a special ideal with very nice combinatorial properties. Along the way, cute combinatorics pops up in the form of Dyck paths, Catalan numbers, etc. We also discuss tantalizing recent work that might help confirm our conjecture.
ID:
110
Year: 2005
Name: Jenelle McAtee
Institution: University of Iowa
Subject area(s): knot theory, differential geometry
Title of Talk: Knots of Constant Curvature
Abstract: In this paper, we use the method of Richard Koch and Christoph Engelhardt to construct many knots of constant curvature.
Year: 2005
Name: Jenelle McAtee
Institution: University of Iowa
Subject area(s): knot theory, differential geometry
Title of Talk: Knots of Constant Curvature
Abstract: In this paper, we use the method of Richard Koch and Christoph Engelhardt to construct many knots of constant curvature.