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 141-160 of 471 results.
Sort by:
ID:
470
Year: 2017
Name: Mu-Ling Chang
Institution: University of Wisconsin-Platteville
Subject area(s):
Title of Talk: The Area of Rational Right Triangles
Abstract: A right triangle is called rational when all of its three sides are all rational numbers. Any rational right triangle has a rational area, but not all positive rational numbers can be the area of a rational right triangle. For example, the area of a right triangle with sides 3-4-5 is 6. Is it possible that there exists a rational right triangle with area 5? More information related to this problem will be given in this talk.
Year: 2017
Name: Mu-Ling Chang
Institution: University of Wisconsin-Platteville
Subject area(s):
Title of Talk: The Area of Rational Right Triangles
Abstract: A right triangle is called rational when all of its three sides are all rational numbers. Any rational right triangle has a rational area, but not all positive rational numbers can be the area of a rational right triangle. For example, the area of a right triangle with sides 3-4-5 is 6. Is it possible that there exists a rational right triangle with area 5? More information related to this problem will be given in this talk.
ID:
215
Year: 2007
Name: Wolfgang Kliemann
Institution: Iowa State University
Subject area(s):
Title of Talk: Linear Differential Equations
Abstract: Spectral properties of matrices can be characterized in various ways: The algebraic approach via the characteristic polynomial yields the eigenvalues and corresponding (generalized) eigenspaces resulting in the Jordan normal form. The linear-algebraic approach using similarity of matrices again re- sults in a characterization via the Jordan form. Furthermore, the dynamical approach via di
Year: 2007
Name: Wolfgang Kliemann
Institution: Iowa State University
Subject area(s):
Title of Talk: Linear Differential Equations
Abstract: Spectral properties of matrices can be characterized in various ways: The algebraic approach via the characteristic polynomial yields the eigenvalues and corresponding (generalized) eigenspaces resulting in the Jordan normal form. The linear-algebraic approach using similarity of matrices again re- sults in a characterization via the Jordan form. Furthermore, the dynamical approach via di
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:
216
Year: 2007
Name: Scott Searcy
Institution: Waldorf College
Subject area(s):
Title of Talk: The Possible Use of Wavelets in Digital Audio Upsampling
Abstract: The challenge of high fidelity digital to analog conversion of digital audio information is quite challenging. This paper will the possible use of wvaelets to increase the fidelity of the recovered analog signal.
Year: 2007
Name: Scott Searcy
Institution: Waldorf College
Subject area(s):
Title of Talk: The Possible Use of Wavelets in Digital Audio Upsampling
Abstract: The challenge of high fidelity digital to analog conversion of digital audio information is quite challenging. This paper will the possible use of wvaelets to increase the fidelity of the recovered analog signal.
ID:
472
Year: 2017
Name: Corissa Goertzen
Institution: University of Dubuque
Subject area(s):
Title of Talk: STEMulating Activities
Abstract: With the emphasis on STEM in the K-12 grades, colleges are stepping up to hold STEM related events. We will discuss the activities we have used at STEM festivals and how we encouraged college students to get involved. Time will allow for sharing of ideas.
Year: 2017
Name: Corissa Goertzen
Institution: University of Dubuque
Subject area(s):
Title of Talk: STEMulating Activities
Abstract: With the emphasis on STEM in the K-12 grades, colleges are stepping up to hold STEM related events. We will discuss the activities we have used at STEM festivals and how we encouraged college students to get involved. Time will allow for sharing of ideas.
ID:
217
Year: 2007
Name: Dennis Roseman
Institution: University of Iowa
Subject area(s):
Title of Talk: How likely is a lattice link?
Abstract: Lattice points in space are points with integer coordinates. A unit lattice edge is a line segment of unit length between lattice points. A lattice link is a finite collection union of lattice edges whose union is topologically equivalent to a union of disjoint circles. We define a notion of probability for lattice knots and links and use this to frame the question: which is more ``likely'', the square knot or the granny knot. A square knot is obtained by tying a right hand trefoil and a left had trefoil together; the granny knot is obtained by using two identical trefoils. We also discuss our progress towards calculation of these probabilities.
Year: 2007
Name: Dennis Roseman
Institution: University of Iowa
Subject area(s):
Title of Talk: How likely is a lattice link?
Abstract: Lattice points in space are points with integer coordinates. A unit lattice edge is a line segment of unit length between lattice points. A lattice link is a finite collection union of lattice edges whose union is topologically equivalent to a union of disjoint circles. We define a notion of probability for lattice knots and links and use this to frame the question: which is more ``likely'', the square knot or the granny knot. A square knot is obtained by tying a right hand trefoil and a left had trefoil together; the granny knot is obtained by using two identical trefoils. We also discuss our progress towards calculation of these probabilities.
ID:
475
Year: 2017
Name: Brian Birgen
Institution: Wartburg College
Subject area(s):
Title of Talk: What is Financial Math?
Abstract: One of the early Actuary Exams is titled Financial Math. What does that mean? What does that include? This talk will discuss the content covered on this exam.
Year: 2017
Name: Brian Birgen
Institution: Wartburg College
Subject area(s):
Title of Talk: What is Financial Math?
Abstract: One of the early Actuary Exams is titled Financial Math. What does that mean? What does that include? This talk will discuss the content covered on this exam.
ID:
220
Year: 2008
Name: Zhongming WANG
Institution: Iowa State University
Subject area(s):
Title of Talk: Bloch Band Based Level Set Method for the Schrodinger Equation
Abstract: We develop a Bloch band based level set method for capturing the semiclassical limit of one-dimensional Schrodinger equations in periodic medium. A hybrid of the WKB approximation and homogenization leads to the Bloch eigenvalue problem and an associated Hamilton-Jacobi system for the phase, with Hamiltonian being the Bloch eigenvalues. Following the level set methodology , we develop a Bloch band based level set method, which are hybrid numerical schemes -- splitting the solution process into several parts: i) band decomposition of the initial data and construction of the initial level set function; ii) solve the Bloch eigenvalue problem; iii) evolve the band level set equation to compute multi-valued velocity and density on each Bloch band; iv)the total position density over a sample set of bands is evaluated using Bloch waves and band densities obtained in step ii) and iii), respectively. Numerical results with different number of bands are provided to demonstrate the good quality of the method.
Year: 2008
Name: Zhongming WANG
Institution: Iowa State University
Subject area(s):
Title of Talk: Bloch Band Based Level Set Method for the Schrodinger Equation
Abstract: We develop a Bloch band based level set method for capturing the semiclassical limit of one-dimensional Schrodinger equations in periodic medium. A hybrid of the WKB approximation and homogenization leads to the Bloch eigenvalue problem and an associated Hamilton-Jacobi system for the phase, with Hamiltonian being the Bloch eigenvalues. Following the level set methodology , we develop a Bloch band based level set method, which are hybrid numerical schemes -- splitting the solution process into several parts: i) band decomposition of the initial data and construction of the initial level set function; ii) solve the Bloch eigenvalue problem; iii) evolve the band level set equation to compute multi-valued velocity and density on each Bloch band; iv)the total position density over a sample set of bands is evaluated using Bloch waves and band densities obtained in step ii) and iii), respectively. Numerical results with different number of bands are provided to demonstrate the good quality of the method.
ID:
479
Year: 2017
Name: Jake Weber
Institution: University of Northern Iowa
Subject area(s):
Title of Talk: Exploration of Counter Examples of Balance Sets
Abstract: With large data sets, one might ask if substructure exists, and if so, how large should the data subset be in order to guarantee this substructure. We investigated data subsets of Zp × Zp which are on the boundary, just short of enough data to guarantee substructure, specifically categorizing the data subsets that don’t have substruc- ture. First by brute force checking, we determined the counter examples (graphs with no substructure) for Z5 × Z5. These exam- ples guided our search into Zp × Zp where p ≥ 7. From there, we proved there are four categories of counter examples that do not have a balanced subset in Zp × Zp.
Year: 2017
Name: Jake Weber
Institution: University of Northern Iowa
Subject area(s):
Title of Talk: Exploration of Counter Examples of Balance Sets
Abstract: With large data sets, one might ask if substructure exists, and if so, how large should the data subset be in order to guarantee this substructure. We investigated data subsets of Zp × Zp which are on the boundary, just short of enough data to guarantee substructure, specifically categorizing the data subsets that don’t have substruc- ture. First by brute force checking, we determined the counter examples (graphs with no substructure) for Z5 × Z5. These exam- ples guided our search into Zp × Zp where p ≥ 7. From there, we proved there are four categories of counter examples that do not have a balanced subset in Zp × Zp.
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:
482
Year: 2017
Name: Alex Nowak
Institution: Iowa State University
Subject area(s):
Title of Talk: Semisymmetric quasigroups
Abstract: Specified by Latin squares, quasigroups, often referred to as the ``nonassociative groups," seem, on the surface at least, to be objects of strictly combinatorial interest. However, quasigroups may also be specified as type (2, 2, 2) algebras satisfying equational identities, thus forming a variety in the universal algebraic sense. After introducing quasigroups through basic definitions and examples, we'll move into a discussion of the class of semisymmetric quasigroups. This class provides some nice illustrations of the interplay between algebra, combinatorics (in particular, design theory), and geometry that is provoked by quasigroup theory.
Year: 2017
Name: Alex Nowak
Institution: Iowa State University
Subject area(s):
Title of Talk: Semisymmetric quasigroups
Abstract: Specified by Latin squares, quasigroups, often referred to as the ``nonassociative groups," seem, on the surface at least, to be objects of strictly combinatorial interest. However, quasigroups may also be specified as type (2, 2, 2) algebras satisfying equational identities, thus forming a variety in the universal algebraic sense. After introducing quasigroups through basic definitions and examples, we'll move into a discussion of the class of semisymmetric quasigroups. This class provides some nice illustrations of the interplay between algebra, combinatorics (in particular, design theory), and geometry that is provoked by quasigroup theory.
ID:
227
Year: 2008
Name: Debra Czarneski
Institution: Simpson College
Subject area(s):
Title of Talk: Teaching an introduction to LaTeX course during May Term
Abstract: During May Term of 2007, I taught a course that introduced students to typesetting in LaTeX. This talk will discuss the course goals, the material covered in the course, the course requirements, and student feedback.
Year: 2008
Name: Debra Czarneski
Institution: Simpson College
Subject area(s):
Title of Talk: Teaching an introduction to LaTeX course during May Term
Abstract: During May Term of 2007, I taught a course that introduced students to typesetting in LaTeX. This talk will discuss the course goals, the material covered in the course, the course requirements, and student feedback.
ID:
484
Year: 2017
Name: Angela Kohlhaas
Institution: Loras College
Subject area(s):
Title of Talk: Math in Art and Music Revised and Revisited
Abstract: Last January term, I taught Math in Art and Music for a second time. In this talk, I will share some of the revisions I made and some of my favorite projects from the course. Highlights include using GeoGebra for spatial reasoning, creating axiomatic art, and constructing musical fractal compositions.
Year: 2017
Name: Angela Kohlhaas
Institution: Loras College
Subject area(s):
Title of Talk: Math in Art and Music Revised and Revisited
Abstract: Last January term, I taught Math in Art and Music for a second time. In this talk, I will share some of the revisions I made and some of my favorite projects from the course. Highlights include using GeoGebra for spatial reasoning, creating axiomatic art, and constructing musical fractal compositions.
ID:
229
Year: 2008
Name: Benjamin Galluzzo
Institution: University of Iowa
Subject area(s):
Title of Talk: The Mathematical Contest in Modeling: An Advisor's Perspective
Abstract: This past February, The University of Iowa participated in The Mathematical Contest in Modeling (MCM) for the first time. This talk will focus on the organizational challenges we encountered while preparing for MCM as well as ideas that we hope to implement for future contests.
Year: 2008
Name: Benjamin Galluzzo
Institution: University of Iowa
Subject area(s):
Title of Talk: The Mathematical Contest in Modeling: An Advisor's Perspective
Abstract: This past February, The University of Iowa participated in The Mathematical Contest in Modeling (MCM) for the first time. This talk will focus on the organizational challenges we encountered while preparing for MCM as well as ideas that we hope to implement for future contests.
ID:
485
Year: 2017
Name: Jong Hoon Bae
Institution: Grinnell College
Subject area(s):
Title of Talk: Cauldron: An IDE for Modular Development of Chemical Reaction Networks
Abstract: Chemical reaction networks (CRNs) are widely used in the physical sciences to model reactions between molecules, and they are closely related to Petri nets and population protocols. Although the CRN model is equivalent in power to modern programming languages, it does not naturally support important software engineering principles such as abstraction and reuse. As a result, CRNs are challenging to debug, verify, extend, reuse, and maintain. In this talk we introduce Cauldron, an integrated development environment (IDE) for modular CRN development. Cauldron supports three new CRN design methods introduced by Klinge, Lathrop, and Lutz in 2016: (1) Input/output CRNs, (2) closed-sub CRNS, and (3) extension operators. I/O CRNs extend the CRN model to allow receiving external input signals. A closed sub-CRN encapsulates a behavior within an existing CRN in a way that is self-contained. Extension operators are used to automatically add functionality to a CRN without affecting its original behavior. By making these methods practical to developers, Cauldron naturally supports modular CRN design. For example, users can divide a CRN into independent sub-CRNs, test them separately, and reuse them in other CRNs. Furthermore, users can mark species as inputs and specify them with common elementary functions, by drawing a function, or by connecting them to another CRN. Many commonly used CRNs and extension operators are also included as libraries in Cauldron.
Year: 2017
Name: Jong Hoon Bae
Institution: Grinnell College
Subject area(s):
Title of Talk: Cauldron: An IDE for Modular Development of Chemical Reaction Networks
Abstract: Chemical reaction networks (CRNs) are widely used in the physical sciences to model reactions between molecules, and they are closely related to Petri nets and population protocols. Although the CRN model is equivalent in power to modern programming languages, it does not naturally support important software engineering principles such as abstraction and reuse. As a result, CRNs are challenging to debug, verify, extend, reuse, and maintain. In this talk we introduce Cauldron, an integrated development environment (IDE) for modular CRN development. Cauldron supports three new CRN design methods introduced by Klinge, Lathrop, and Lutz in 2016: (1) Input/output CRNs, (2) closed-sub CRNS, and (3) extension operators. I/O CRNs extend the CRN model to allow receiving external input signals. A closed sub-CRN encapsulates a behavior within an existing CRN in a way that is self-contained. Extension operators are used to automatically add functionality to a CRN without affecting its original behavior. By making these methods practical to developers, Cauldron naturally supports modular CRN design. For example, users can divide a CRN into independent sub-CRNs, test them separately, and reuse them in other CRNs. Furthermore, users can mark species as inputs and specify them with common elementary functions, by drawing a function, or by connecting them to another CRN. Many commonly used CRNs and extension operators are also included as libraries in Cauldron.
ID:
486
Year: 2017
Name: Jong Hoon Bae
Institution: Grinnell College
Subject area(s):
Title of Talk: Cauldron: An IDE for Modular Development of Chemical Reaction Networks
Abstract: Chemical reaction networks (CRNs) are widely used in the physical sciences to model reactions between molecules, and they are closely related to Petri nets and population protocols. Although the CRN model is equivalent in power to modern programming languages, it does not naturally support important software engineering principles such as abstraction and reuse. As a result, CRNs are challenging to debug, verify, extend, reuse, and maintain. In this talk we introduce Cauldron, an integrated development environment (IDE) for modular CRN development. Cauldron supports three new CRN design methods introduced by Klinge, Lathrop, and Lutz in 2016: (1) Input/output CRNs, (2) closed-sub CRNS, and (3) extension operators. I/O CRNs extend the CRN model to allow receiving external input signals. A closed sub-CRN encapsulates a behavior within an existing CRN in a way that is self-contained. Extension operators are used to automatically add functionality to a CRN without affecting its original behavior. By making these methods practical to developers, Cauldron naturally supports modular CRN design. For example, users can divide a CRN into independent sub-CRNs, test them separately, and reuse them in other CRNs. Furthermore, users can mark species as inputs and specify them with common elementary functions, by drawing a function, or by connecting them to another CRN. Many commonly used CRNs and extension operators are also included as libraries in Cauldron.
Year: 2017
Name: Jong Hoon Bae
Institution: Grinnell College
Subject area(s):
Title of Talk: Cauldron: An IDE for Modular Development of Chemical Reaction Networks
Abstract: Chemical reaction networks (CRNs) are widely used in the physical sciences to model reactions between molecules, and they are closely related to Petri nets and population protocols. Although the CRN model is equivalent in power to modern programming languages, it does not naturally support important software engineering principles such as abstraction and reuse. As a result, CRNs are challenging to debug, verify, extend, reuse, and maintain. In this talk we introduce Cauldron, an integrated development environment (IDE) for modular CRN development. Cauldron supports three new CRN design methods introduced by Klinge, Lathrop, and Lutz in 2016: (1) Input/output CRNs, (2) closed-sub CRNS, and (3) extension operators. I/O CRNs extend the CRN model to allow receiving external input signals. A closed sub-CRN encapsulates a behavior within an existing CRN in a way that is self-contained. Extension operators are used to automatically add functionality to a CRN without affecting its original behavior. By making these methods practical to developers, Cauldron naturally supports modular CRN design. For example, users can divide a CRN into independent sub-CRNs, test them separately, and reuse them in other CRNs. Furthermore, users can mark species as inputs and specify them with common elementary functions, by drawing a function, or by connecting them to another CRN. Many commonly used CRNs and extension operators are also included as libraries in Cauldron.
ID:
233
Year: 2008
Name: Russell Goodman
Institution: Central College
Subject area(s):
Title of Talk: Leading a Book Discussion in a Liberal Arts Mathematics Class
Abstract: One of the purposes of Central College
Year: 2008
Name: Russell Goodman
Institution: Central College
Subject area(s):
Title of Talk: Leading a Book Discussion in a Liberal Arts Mathematics Class
Abstract: One of the purposes of Central College
ID:
489
Year: 2017
Name: Deanna Haunsperger
Institution: Carleton College
Subject area(s):
Title of Talk: A Glimpse at the Horizon
Abstract: What do a square-wheeled bicycle, a 17th-century French painting, and the Indiana legislature all have in common? They appear among the many bright stars on the mathematical horizon, or, um, in Math Horizons. Math Horizons, the undergraduate magazine started by the MAA in 1994, publishes articles to introduce students to the world of mathematics outside the classroom. Some of mathematics’ best expositors have written for MH over the years; here is an idiosyncratic tour of the first ten years of Horizons.
Year: 2017
Name: Deanna Haunsperger
Institution: Carleton College
Subject area(s):
Title of Talk: A Glimpse at the Horizon
Abstract: What do a square-wheeled bicycle, a 17th-century French painting, and the Indiana legislature all have in common? They appear among the many bright stars on the mathematical horizon, or, um, in Math Horizons. Math Horizons, the undergraduate magazine started by the MAA in 1994, publishes articles to introduce students to the world of mathematics outside the classroom. Some of mathematics’ best expositors have written for MH over the years; here is an idiosyncratic tour of the first ten years of Horizons.
ID:
490
Year: 2017
Name: Deanna Haunsperger
Institution: Carleton College
Subject area(s):
Title of Talk: Does Your Vote Count?
Abstract: Are you frustrated that your candidate never wins? Does it seem like your vote doesn’t count? Maybe it doesn’t. Or at least not as much as the voting method with which you choose to tally the votes. Together we’ll take a glimpse into the important, interesting, paradoxical world of the mathematics behind tallying elections.
Year: 2017
Name: Deanna Haunsperger
Institution: Carleton College
Subject area(s):
Title of Talk: Does Your Vote Count?
Abstract: Are you frustrated that your candidate never wins? Does it seem like your vote doesn’t count? Maybe it doesn’t. Or at least not as much as the voting method with which you choose to tally the votes. Together we’ll take a glimpse into the important, interesting, paradoxical world of the mathematics behind tallying elections.
ID:
235
Year: 2008
Name: Martha Waggoner
Institution: Simpson College
Subject area(s):
Title of Talk: Geometer's Sketchpad and Undergraduate Research
Abstract: We were able to purchase 12 student copies of Geometer's Sketchpad to be used by our pre-service teachers for their undergraduate research projects through a faculty development grant from the Simpson academic dean's office. In this talk, we will look at the variety of topics in geometry and computer aided design that our students worked on and how Geometer's Sketchpad helped the students in visualization, conjecture and proof.
Year: 2008
Name: Martha Waggoner
Institution: Simpson College
Subject area(s):
Title of Talk: Geometer's Sketchpad and Undergraduate Research
Abstract: We were able to purchase 12 student copies of Geometer's Sketchpad to be used by our pre-service teachers for their undergraduate research projects through a faculty development grant from the Simpson academic dean's office. In this talk, we will look at the variety of topics in geometry and computer aided design that our students worked on and how Geometer's Sketchpad helped the students in visualization, conjecture and proof.