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 321-340 of 471 results.
Sort by:
ID:
231
Year: 2008
Name: Ian Besse
Institution: University of Iowa
Subject area(s): Mathematical Biology/Physiology; ODEs
Title of Talk: A model of cardiac action potential incorporating caveolae-associated ion currents
Abstract: The contraction of a cardiac cell is initiated by a transient depolarization of the cell membrane called an action potential. Action potentials result from the rapid movement of ions across the membrane through pores called ion channels. Recent electrophysiological data regarding caveolae, small invaginations of the cell membrane, reveal that caveolae are reservoirs of
Year: 2008
Name: Ian Besse
Institution: University of Iowa
Subject area(s): Mathematical Biology/Physiology; ODEs
Title of Talk: A model of cardiac action potential incorporating caveolae-associated ion currents
Abstract: The contraction of a cardiac cell is initiated by a transient depolarization of the cell membrane called an action potential. Action potentials result from the rapid movement of ions across the membrane through pores called ion channels. Recent electrophysiological data regarding caveolae, small invaginations of the cell membrane, reveal that caveolae are reservoirs of
ID:
230
Year: 2008
Name: Greg Ongie
Institution: Coe College
Subject area(s): Analysis, Measure Theory, Orthogonal Polynomials
Title of Talk: Orthogonal Polynomials on the Cantor Set
Abstract: The middle-thirds Cantor set is an uncountable set of Lebesgue measure zero. The Cantor measure is defined such that it assigns the Cantor set measure one, and has the Cantor set as its support. An orthogonal polynomial sequence (OPS) is traditionally defined by means of Riemann integration, but more generally an OPS can be defined by means of integration with respect to a measure. First we construct the Cantor measure and show it satisfies the properties of a measure. Then, we verify the existence of an associated OPS by examining the positivity of its moment matrix. Finally, using the Gram-Schmidt method we construct the OPS, and derive various properties of the polynomials based on results for classical orthogonal polynomials.
Year: 2008
Name: Greg Ongie
Institution: Coe College
Subject area(s): Analysis, Measure Theory, Orthogonal Polynomials
Title of Talk: Orthogonal Polynomials on the Cantor Set
Abstract: The middle-thirds Cantor set is an uncountable set of Lebesgue measure zero. The Cantor measure is defined such that it assigns the Cantor set measure one, and has the Cantor set as its support. An orthogonal polynomial sequence (OPS) is traditionally defined by means of Riemann integration, but more generally an OPS can be defined by means of integration with respect to a measure. First we construct the Cantor measure and show it satisfies the properties of a measure. Then, we verify the existence of an associated OPS by examining the positivity of its moment matrix. Finally, using the Gram-Schmidt method we construct the OPS, and derive various properties of the polynomials based on results for classical orthogonal polynomials.
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:
228
Year: 2008
Name: Joel Haack
Institution: University of Northern Iowa
Subject area(s): history of mathematics
Title of Talk: Euler and Music: a look at the Tentamen of 1739
Abstract: Musicians regard Euler as the leading contributor to theoretical acoustics. Why? This presentation will explore Euler's long interest in music theory.
Year: 2008
Name: Joel Haack
Institution: University of Northern Iowa
Subject area(s): history of mathematics
Title of Talk: Euler and Music: a look at the Tentamen of 1739
Abstract: Musicians regard Euler as the leading contributor to theoretical acoustics. Why? This presentation will explore Euler's long interest in music 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:
226
Year: 2008
Name: Bokhee Im
Institution: Chonnam National University, Rep. of Korea
Subject area(s): algebra ( combitorics )
Title of Talk: Certain quasigroup homogeneous spaces
Abstract: A quasigroup is defined as a set Q equipped with a multiplication, not necessarily associative, such that in the equation x y=z, knowledge of any two of the elements x, y, z of Q specifies the third uniquely. In particular, the solution for x in terms of y and z is written as z/y. The body of the multiplication table of a finite quasigroup is a Latin quare. Nonempty associative quasigroups are groups. In this talk, we consider the usual direct product G of the symmetric group of degree 3 and the cyclic group of order 2. By changing some intercalates of the body of the multiplication table of the group G, we get various quasigroup structures on the set G. We study homogeneous spaces derived from such a quasigroup and show how each action matrix acts on an orbit contained in the homogeneous space. Action matrices show the approximate symmetry.
Year: 2008
Name: Bokhee Im
Institution: Chonnam National University, Rep. of Korea
Subject area(s): algebra ( combitorics )
Title of Talk: Certain quasigroup homogeneous spaces
Abstract: A quasigroup is defined as a set Q equipped with a multiplication, not necessarily associative, such that in the equation x y=z, knowledge of any two of the elements x, y, z of Q specifies the third uniquely. In particular, the solution for x in terms of y and z is written as z/y. The body of the multiplication table of a finite quasigroup is a Latin quare. Nonempty associative quasigroups are groups. In this talk, we consider the usual direct product G of the symmetric group of degree 3 and the cyclic group of order 2. By changing some intercalates of the body of the multiplication table of the group G, we get various quasigroup structures on the set G. We study homogeneous spaces derived from such a quasigroup and show how each action matrix acts on an orbit contained in the homogeneous space. Action matrices show the approximate symmetry.
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:
224
Year: 2008
Name: Christian Roettger
Institution: Iowa State University
Subject area(s): geometry, teacher education, proof
Title of Talk: Proofs in elementary geometry - what IS the sum of angles in a triangle?
Abstract: One textbook for future teachers gives no less than four 'arguments' for this theorem. It is not claimed that they are proofs, and indeed they are not (all involve some circular reasoning). But the difference between such arguments and proofs is never made clear. We'll discover the flaws in the logic here, which are not obvious at all. Then we'll look at a number of examples from standard elementary geometry - some rock-solid one-line proofs, some examples where we all skip the proof and eyeball it, and finally an example which shows how 'eyeballing it' can lead to a 'proof' of 64=65.
Year: 2008
Name: Christian Roettger
Institution: Iowa State University
Subject area(s): geometry, teacher education, proof
Title of Talk: Proofs in elementary geometry - what IS the sum of angles in a triangle?
Abstract: One textbook for future teachers gives no less than four 'arguments' for this theorem. It is not claimed that they are proofs, and indeed they are not (all involve some circular reasoning). But the difference between such arguments and proofs is never made clear. We'll discover the flaws in the logic here, which are not obvious at all. Then we'll look at a number of examples from standard elementary geometry - some rock-solid one-line proofs, some examples where we all skip the proof and eyeball it, and finally an example which shows how 'eyeballing it' can lead to a 'proof' of 64=65.
ID:
223
Year: 2008
Name: Charles Ashbacher
Institution: #none
Subject area(s): Recreational mathematics
Title of Talk: Computer Investigations of Problems in Pickover
Abstract: Clifford Pickover, who has been described as the
Year: 2008
Name: Charles Ashbacher
Institution: #none
Subject area(s): Recreational mathematics
Title of Talk: Computer Investigations of Problems in Pickover
Abstract: Clifford Pickover, who has been described as the
ID:
222
Year: 2008
Name: K Stroyan
Institution: University of Iowa
Subject area(s): Trig, Calculus, and Vision
Title of Talk: A new formula for depth perception
Abstract: When you are moving, such as walking, and fix your gaze at an object ahead, but off to the side, say a tree, stationary objects behind the tree seem to move in the same direction as you, while objects in front seem to move in the opposite direction. This is a monocular cue to depth, as opposed to binocular disparity - the difference in the images in your two (separated) eyes. Working with a vision researcher, we have found a simple new formula for depth in terms of motion. Work is in progress in his laboratory to see how much of the geometric information contained in the formula is actually used by humans. The proof of the formula is a very simple application of trigonometry and infinitesimal calculus. We were led to discover it through experimental intuition and some interactive programs that we will demonstrate.
Year: 2008
Name: K Stroyan
Institution: University of Iowa
Subject area(s): Trig, Calculus, and Vision
Title of Talk: A new formula for depth perception
Abstract: When you are moving, such as walking, and fix your gaze at an object ahead, but off to the side, say a tree, stationary objects behind the tree seem to move in the same direction as you, while objects in front seem to move in the opposite direction. This is a monocular cue to depth, as opposed to binocular disparity - the difference in the images in your two (separated) eyes. Working with a vision researcher, we have found a simple new formula for depth in terms of motion. Work is in progress in his laboratory to see how much of the geometric information contained in the formula is actually used by humans. The proof of the formula is a very simple application of trigonometry and infinitesimal calculus. We were led to discover it through experimental intuition and some interactive programs that we will demonstrate.
ID:
221
Year: 2008
Name: Michael Smith
Institution: Morningside College
Subject area(s): Statistics, Education
Title of Talk: Class Research Projects in Elementary Statistics
Abstract: This talk presents the results of a class data collection project completed in an elementary statistics class, as well as a philosophical discussion of what students can gain from collecting data in a statistics class.
Year: 2008
Name: Michael Smith
Institution: Morningside College
Subject area(s): Statistics, Education
Title of Talk: Class Research Projects in Elementary Statistics
Abstract: This talk presents the results of a class data collection project completed in an elementary statistics class, as well as a philosophical discussion of what students can gain from collecting data in a statistics class.
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:
219
Year: 2008
Name: Haseena Ahmed
Institution: Iowa State University
Subject area(s): Applied Mathematics, Numerical Analysis
Title of Talk: Alternating evolution (AE) schemes for hyperbolic conservation laws
Abstract: An alternating evolution (AE) system is proposed which is an accurate approximation to systems of hyperbolic conservation laws. We develop a class of local Alternating Evolution (AE) schemes, where we take advantage of high accuracy of the proposed AE approximation. Our approach is based on a sliding average of the AE system over an interval of [x − \Delta x, x + \Delta x]. The numerical scheme is then constructed by sampling the averaged system over alternating grids. Higher order accuracy is achieved by a combination of high-order polynomial reconstruction from the obtained averages and a stable Runge-Kutta discretization in time. The AE schemes have the advantage of easier formulation and implementation, and efficient computation of the solution. For the first and second order local AE schemes applied to scalar laws, we prove the numerical stability in the sense of satisfying the maximum principle and total variation diminishing (TVD) property. Numerical tests for both scalar conservation laws and compressible Euler equations are presented to demonstrate the high order accuracy and capacity of these AE schemes.
Year: 2008
Name: Haseena Ahmed
Institution: Iowa State University
Subject area(s): Applied Mathematics, Numerical Analysis
Title of Talk: Alternating evolution (AE) schemes for hyperbolic conservation laws
Abstract: An alternating evolution (AE) system is proposed which is an accurate approximation to systems of hyperbolic conservation laws. We develop a class of local Alternating Evolution (AE) schemes, where we take advantage of high accuracy of the proposed AE approximation. Our approach is based on a sliding average of the AE system over an interval of [x − \Delta x, x + \Delta x]. The numerical scheme is then constructed by sampling the averaged system over alternating grids. Higher order accuracy is achieved by a combination of high-order polynomial reconstruction from the obtained averages and a stable Runge-Kutta discretization in time. The AE schemes have the advantage of easier formulation and implementation, and efficient computation of the solution. For the first and second order local AE schemes applied to scalar laws, we prove the numerical stability in the sense of satisfying the maximum principle and total variation diminishing (TVD) property. Numerical tests for both scalar conservation laws and compressible Euler equations are presented to demonstrate the high order accuracy and capacity of these AE schemes.
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:
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:
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:
214
Year: 2007
Name: Kliemann Wolfgang
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: Kliemann Wolfgang
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:
213
Year: 2007
Name: Krishna B. Athreya
Institution: Iowa State University
Subject area(s):
Title of Talk: Preferential Attachment Random Graphs with General Weight Function
Abstract: Start with a graph G_0 = {V_1 , V_2} with one edge connecting the two vertices V_1, V_2. Now create a new vertex V_3 and attach it (i.e. add an edge) to V_1 or V_2 with equal probability. Set G_3={V_1 , V_2, V_3}. Let G_n={V_1,
Year: 2007
Name: Krishna B. Athreya
Institution: Iowa State University
Subject area(s):
Title of Talk: Preferential Attachment Random Graphs with General Weight Function
Abstract: Start with a graph G_0 = {V_1 , V_2} with one edge connecting the two vertices V_1, V_2. Now create a new vertex V_3 and attach it (i.e. add an edge) to V_1 or V_2 with equal probability. Set G_3={V_1 , V_2, V_3}. Let G_n={V_1,
ID:
212
Year: 2007
Name: Siu-Hung (Richard) Ng
Institution: Iowa State University
Subject area(s):
Title of Talk: Counting the number of solutions in a finite group
Abstract: The notion of Frobenius-Schur (FS)-indicators of a finite group representation has been developed for more than a century. These indicators can be obtained by counting the number of solutions x of the equation x^n=g in a finite group. Moreover, the second indicators can be used to construct topological invariants of surfaces. It was not known until recently that they are invariants of the tensor categories of finite group representations. In the talk, we will give a brief history of these indicators and their new developments.
Year: 2007
Name: Siu-Hung (Richard) Ng
Institution: Iowa State University
Subject area(s):
Title of Talk: Counting the number of solutions in a finite group
Abstract: The notion of Frobenius-Schur (FS)-indicators of a finite group representation has been developed for more than a century. These indicators can be obtained by counting the number of solutions x of the equation x^n=g in a finite group. Moreover, the second indicators can be used to construct topological invariants of surfaces. It was not known until recently that they are invariants of the tensor categories of finite group representations. In the talk, we will give a brief history of these indicators and their new developments.
ID:
211
Year: 2007
Name: Rana Mikkelson
Institution: Iowa State University
Subject area(s):
Title of Talk: An Introduction to Minimum Rank of a Graph
Abstract: Given a graph, we can associate a set of matrices therewith: the set of all symmetric matrices A over R where aij = 0 ? G has an edge between vertex i and j . We define the minimum rank of a graph is then the minimum among the ranks of all the matrices in this set. There is no one easy formula for computing this value given any graph, but for certain types graphs we can find the minimum rank exactly, and for others we can at least determine a few bounds. This talk introduces the topic and begins to explore the known results.
Year: 2007
Name: Rana Mikkelson
Institution: Iowa State University
Subject area(s):
Title of Talk: An Introduction to Minimum Rank of a Graph
Abstract: Given a graph, we can associate a set of matrices therewith: the set of all symmetric matrices A over R where aij = 0 ? G has an edge between vertex i and j . We define the minimum rank of a graph is then the minimum among the ranks of all the matrices in this set. There is no one easy formula for computing this value given any graph, but for certain types graphs we can find the minimum rank exactly, and for others we can at least determine a few bounds. This talk introduces the topic and begins to explore the known results.