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 201-220 of 471 results.
Sort by:
ID:
287
Year: 2010
Name: Debra Czarneski
Institution: Simpson College
Subject area(s):
Title of Talk: Introduction to Mathematical Research through Graph Theory
Abstract: In the fall semester of 2009, I taught an Introduction to Mathematical Research through Graph Theory course for incoming first-year students. Students learned how to ask questions, how to form conjectures, and how to present their findings orally and in writing. This talk will discuss the course format, topics covered, and course outcomes.
Year: 2010
Name: Debra Czarneski
Institution: Simpson College
Subject area(s):
Title of Talk: Introduction to Mathematical Research through Graph Theory
Abstract: In the fall semester of 2009, I taught an Introduction to Mathematical Research through Graph Theory course for incoming first-year students. Students learned how to ask questions, how to form conjectures, and how to present their findings orally and in writing. This talk will discuss the course format, topics covered, and course outcomes.
ID:
288
Year: 2010
Name: Travis Peters
Institution: Iowa State University
Subject area(s):
Title of Talk: Minimum rank, maximum nullity and zero forcing number for selected graph families
Abstract: The minimum rank of a simple graph G is defined to be the smallest possible rank over all symmetric real matrices whose ijth entry is nonzero whenever {i, j} is an edge in G and is zero otherwise. Maximum nullity is taken over the same set of matrices. The zero forcing number is the minimum size of a zero forcing set of vertices and bounds the maximum nullity from above. This talk discusses the graph families ciclos and estrellas. In particular, these families provide the examples showing that the maximum nullity of a graph and its dual may differ, and similarly for zero forcing number.
Year: 2010
Name: Travis Peters
Institution: Iowa State University
Subject area(s):
Title of Talk: Minimum rank, maximum nullity and zero forcing number for selected graph families
Abstract: The minimum rank of a simple graph G is defined to be the smallest possible rank over all symmetric real matrices whose ijth entry is nonzero whenever {i, j} is an edge in G and is zero otherwise. Maximum nullity is taken over the same set of matrices. The zero forcing number is the minimum size of a zero forcing set of vertices and bounds the maximum nullity from above. This talk discusses the graph families ciclos and estrellas. In particular, these families provide the examples showing that the maximum nullity of a graph and its dual may differ, and similarly for zero forcing number.
ID:
289
Year: 2010
Name: Ruth Berger
Institution: Luther College
Subject area(s): Algebra, Group Theory
Title of Talk: Exploring Group Theory with FGB
Abstract: Finite Group Behavior (FGB) is a free windows-based program that gives beginning group theory students a chance to explore abstract group theory concepts in a very concrete setting. The heart of the software is an extensive collection of Cayley tables of groups: Cyclic groups, Dihedral groups, and groups whose structure is not immediately recognizable. Students can explore relations among the elements of a group, determine the order of each element, and even make subgroups generated by selected elements of the group. This easy to use program also includes features that allow for the investigation of isomorphisms of groups, and it gives a nice visualization of how Cosets are formed. I will share some of the worksheets that I wrote for my Abstract Algebra students to gain some hands-on experience with these otherwise abstract concepts.
Year: 2010
Name: Ruth Berger
Institution: Luther College
Subject area(s): Algebra, Group Theory
Title of Talk: Exploring Group Theory with FGB
Abstract: Finite Group Behavior (FGB) is a free windows-based program that gives beginning group theory students a chance to explore abstract group theory concepts in a very concrete setting. The heart of the software is an extensive collection of Cayley tables of groups: Cyclic groups, Dihedral groups, and groups whose structure is not immediately recognizable. Students can explore relations among the elements of a group, determine the order of each element, and even make subgroups generated by selected elements of the group. This easy to use program also includes features that allow for the investigation of isomorphisms of groups, and it gives a nice visualization of how Cosets are formed. I will share some of the worksheets that I wrote for my Abstract Algebra students to gain some hands-on experience with these otherwise abstract concepts.
ID:
290
Year: 2010
Name: Charles Ashbacher
Institution: #none
Subject area(s): Recreational mathematics
Title of Talk: Retrolife Generation of the Twelve Pentominoes
Abstract: The "Game of Life" invented by J. H. Conway has fascinated people for decades and was the impetus for the field of artificial life. Retrolife is determining if a specific pattern can be created from another with one iteration of the rules of life. This presentation will answer the question whether each of the twelve pentominoes can be generated via an iteration of the rules and poses new questions.
Year: 2010
Name: Charles Ashbacher
Institution: #none
Subject area(s): Recreational mathematics
Title of Talk: Retrolife Generation of the Twelve Pentominoes
Abstract: The "Game of Life" invented by J. H. Conway has fascinated people for decades and was the impetus for the field of artificial life. Retrolife is determining if a specific pattern can be created from another with one iteration of the rules of life. This presentation will answer the question whether each of the twelve pentominoes can be generated via an iteration of the rules and poses new questions.
ID:
291
Year: 2010
Name: Robert Keller
Institution: Loras College
Subject area(s): Collaborative learning, discrete math
Title of Talk: Discrete Observations or Continuous Ramblings: Some Thoughts on Historical Projects in Discrete Mathematics
Abstract: I will share some of my recent experiences on the use of historical projects in a discrete mathematics course. I used the projects to reinforce broad key topics from discrete in a provocative way. These topics included recursive vs. exact formulas, counting and patterns, and proof techniques such as induction. I will share some details on how I integrated the projects into the class and some (limited) responses from students.
Year: 2010
Name: Robert Keller
Institution: Loras College
Subject area(s): Collaborative learning, discrete math
Title of Talk: Discrete Observations or Continuous Ramblings: Some Thoughts on Historical Projects in Discrete Mathematics
Abstract: I will share some of my recent experiences on the use of historical projects in a discrete mathematics course. I used the projects to reinforce broad key topics from discrete in a provocative way. These topics included recursive vs. exact formulas, counting and patterns, and proof techniques such as induction. I will share some details on how I integrated the projects into the class and some (limited) responses from students.
ID:
292
Year: 2010
Name: Jason Grout
Institution: Drake University
Subject area(s):
Title of Talk: SageTeX: Computing inside LaTeX documents
Abstract: I will talk about SageTeX, a system for embedding computer mathematical calculations or graphs inside TeX documents. The user simply puts a few simple commands in the TeX document and a computation is performed automatically and the output or graph appears in the PDF file. The system uses the powerful free open-source Sage computer algebra system (http://www.sagemath.org), but can also embed results and graphs from Mathematica, Maple, and a variety of other software. The author has used this in writing quizzes, tests, solution guides, papers, etc. Others have used SageTeX to generate interactive books and online worksheets.
Year: 2010
Name: Jason Grout
Institution: Drake University
Subject area(s):
Title of Talk: SageTeX: Computing inside LaTeX documents
Abstract: I will talk about SageTeX, a system for embedding computer mathematical calculations or graphs inside TeX documents. The user simply puts a few simple commands in the TeX document and a computation is performed automatically and the output or graph appears in the PDF file. The system uses the powerful free open-source Sage computer algebra system (http://www.sagemath.org), but can also embed results and graphs from Mathematica, Maple, and a variety of other software. The author has used this in writing quizzes, tests, solution guides, papers, etc. Others have used SageTeX to generate interactive books and online worksheets.
ID:
293
Year: 2010
Name: Kenneth Driessel
Institution: Iowa State University
Subject area(s):
Title of Talk: Continuous Problems Are Easier Than Discrete Ones
Abstract: I claim: Continuous problems are (usually) easier than analogous discrete problems. Consequently, when teaching, we should emphasize the relation between continuous and discrete problems whenever possible. I shall use a historical example to support my claim. In particular, I shall review J.W.S. Rayleigh's treatment of beaded and continuous strings, which appears in his book "Theory of Sound" (Macmillan, 1894).
Year: 2010
Name: Kenneth Driessel
Institution: Iowa State University
Subject area(s):
Title of Talk: Continuous Problems Are Easier Than Discrete Ones
Abstract: I claim: Continuous problems are (usually) easier than analogous discrete problems. Consequently, when teaching, we should emphasize the relation between continuous and discrete problems whenever possible. I shall use a historical example to support my claim. In particular, I shall review J.W.S. Rayleigh's treatment of beaded and continuous strings, which appears in his book "Theory of Sound" (Macmillan, 1894).
ID:
295
Year: 2010
Name: Ranojoy Basu
Institution: Iowa State University
Subject area(s): Mathematical Finance
Title of Talk: Expected Utility Maximization in an Optimal stopping Environment
Abstract: In this paper we study an investment problem where an investor has the option to invest in a risk free asset (such as a bank account ) and a risky asset. His wealth can be transferred between the two assets and there are no transaction costs. The proportion of wealth in the risky asset is a priori chosen deterministic function of wealth. The objective is to …nd an optimal quitting time which maximizes the expected discounted utility from terminal wealth. First, we consider a situation when the wealth process is not subject to bankruptcy and obtain an optimal quitting time. Second, we consider the more realistic scenario when an investor’s wealth is subject to default. We develop necessary mathematical techniques to obtain an optimal selling time in both the circumstances. In both cases, it turned out that the optimal selling time is of threshold type. Numerical methods can easily be implemented to compute the optimal threshold.
Year: 2010
Name: Ranojoy Basu
Institution: Iowa State University
Subject area(s): Mathematical Finance
Title of Talk: Expected Utility Maximization in an Optimal stopping Environment
Abstract: In this paper we study an investment problem where an investor has the option to invest in a risk free asset (such as a bank account ) and a risky asset. His wealth can be transferred between the two assets and there are no transaction costs. The proportion of wealth in the risky asset is a priori chosen deterministic function of wealth. The objective is to …nd an optimal quitting time which maximizes the expected discounted utility from terminal wealth. First, we consider a situation when the wealth process is not subject to bankruptcy and obtain an optimal quitting time. Second, we consider the more realistic scenario when an investor’s wealth is subject to default. We develop necessary mathematical techniques to obtain an optimal selling time in both the circumstances. In both cases, it turned out that the optimal selling time is of threshold type. Numerical methods can easily be implemented to compute the optimal threshold.
ID:
296
Year: 2010
Name: Subhra Bhattacharya
Institution: Iowa State University
Subject area(s): Mathematical Finance
Title of Talk: Stock Loan Subject to Bankruptcy
Abstract: In this paper, risk of bankruptcy has been introduced in the valuation of a financial derivative called stock loan. Bankruptcy has been modelled in both structural and reduced form approach. In structural form model, stock loan with finite maturity is considered following the Black-Cox specification of bankruptcy. It has been shown that the valuation of such an asset can be obtained explicitly in terms of the distribution of the first hitting time of Brownian motion and the pricing of the barrier options. In reduced form model, the default intensity has been introduced as in hazard rate models. A closed form solution of the initial value function is obtained, which implicitly defines the optimal exercise boundary. Moreover, this value function reflects an interrelationship between the optimal loan amount and the relevant variables (e.g. loan interest rate, stock price volatility etc). This interrelationship can be used to explain interesting issues such as: how does stock price volatility (or the reputation of the stock) or the loan interest rate affects the optimal loan amount?
Year: 2010
Name: Subhra Bhattacharya
Institution: Iowa State University
Subject area(s): Mathematical Finance
Title of Talk: Stock Loan Subject to Bankruptcy
Abstract: In this paper, risk of bankruptcy has been introduced in the valuation of a financial derivative called stock loan. Bankruptcy has been modelled in both structural and reduced form approach. In structural form model, stock loan with finite maturity is considered following the Black-Cox specification of bankruptcy. It has been shown that the valuation of such an asset can be obtained explicitly in terms of the distribution of the first hitting time of Brownian motion and the pricing of the barrier options. In reduced form model, the default intensity has been introduced as in hazard rate models. A closed form solution of the initial value function is obtained, which implicitly defines the optimal exercise boundary. Moreover, this value function reflects an interrelationship between the optimal loan amount and the relevant variables (e.g. loan interest rate, stock price volatility etc). This interrelationship can be used to explain interesting issues such as: how does stock price volatility (or the reputation of the stock) or the loan interest rate affects the optimal loan amount?
ID:
297
Year: 2010
Name: Daniel Willis
Institution: Loras College
Subject area(s): K-12 Teaching; Geometry
Title of Talk: An Introduction to Logo
Abstract: An introduction to Logo (Turtle Geometry) using MSWLogo, a freeware version of Logo for 32-bit Windows. The talk will introduce basic commands, loops, procedures, and the use of variables, with applications to regular polygons, stars, tessellations, rotations, translations, reflections, and symmetry. The speaker has used Logo with teachers (and pre-service teachers) of elementary school, middle school, and high school mathematics.
Year: 2010
Name: Daniel Willis
Institution: Loras College
Subject area(s): K-12 Teaching; Geometry
Title of Talk: An Introduction to Logo
Abstract: An introduction to Logo (Turtle Geometry) using MSWLogo, a freeware version of Logo for 32-bit Windows. The talk will introduce basic commands, loops, procedures, and the use of variables, with applications to regular polygons, stars, tessellations, rotations, translations, reflections, and symmetry. The speaker has used Logo with teachers (and pre-service teachers) of elementary school, middle school, and high school mathematics.
ID:
298
Year: 2010
Name: Luke Serafin
Institution: Coe College
Subject area(s):
Title of Talk: Explicit Constructions of Functions whose Graphs are Dense in The Plane
Abstract: A set D is dense in the plane if and only if every open ball in the plane contains an element of D. We prove that there exists a function f from the real line R to itself whose graph is dense in the plane by explicitly constructing it using a partition of the rationals into countably many subsets dense in R. We then use this method of construction to prove that there are 2^(2^\aleph_0) functions whose graphs are dense in the plane, and that there exists a function f: R ->R such that f(U) = R for every non-empty open set U in R.
Year: 2010
Name: Luke Serafin
Institution: Coe College
Subject area(s):
Title of Talk: Explicit Constructions of Functions whose Graphs are Dense in The Plane
Abstract: A set D is dense in the plane if and only if every open ball in the plane contains an element of D. We prove that there exists a function f from the real line R to itself whose graph is dense in the plane by explicitly constructing it using a partition of the rationals into countably many subsets dense in R. We then use this method of construction to prove that there are 2^(2^\aleph_0) functions whose graphs are dense in the plane, and that there exists a function f: R ->R such that f(U) = R for every non-empty open set U in R.
ID:
299
Year: 2010
Name: John Berkowitz
Institution: Coe College
Subject area(s):
Title of Talk: An Algorithm for the Detection of Transient Neural Oscillations
Abstract: The analysis of neural activity through measures of electrical potential affords researchers great opportunity to understand in detail the dynamic nature of certain brain processes. Electroencephalography (EEG) and Local Field Potential recording (LFP) are two of the most common methods for measuring this activity. Both are essentially recordings of the electrical potential over time in a highly localized segment of the brain, and produce data sets that can show surprising amounts of structure. Oscillations with very well defined frequencies are the most common examples of structure within these recordings, and a large portion of modern neuroscience research focuses on how different frequency bands of these oscillations relate to different modes of activity for the organism being studied. Such signals can easily be detected and quantified automatically with traditional signal processing tools such as the Fourier transform. However, there also exist very transient oscillations within such recordings that are of interest to researchers. These require more sophisticated techniques to detect, because of their dual localization in both the time and frequency domains. A combination of several classic signal processing tools, namely digital band-pass filters, the Hilbert transform, z-scoring, and numerical derivatives has yielded an efficient and accurate algorithm for the detection of such transient oscillations. This algorithm has been applied to LFP data for sleeping rats and used to detect the well-known phenomena of sleep spindles, which are a hallmark of late stage sleep in mammals.
Year: 2010
Name: John Berkowitz
Institution: Coe College
Subject area(s):
Title of Talk: An Algorithm for the Detection of Transient Neural Oscillations
Abstract: The analysis of neural activity through measures of electrical potential affords researchers great opportunity to understand in detail the dynamic nature of certain brain processes. Electroencephalography (EEG) and Local Field Potential recording (LFP) are two of the most common methods for measuring this activity. Both are essentially recordings of the electrical potential over time in a highly localized segment of the brain, and produce data sets that can show surprising amounts of structure. Oscillations with very well defined frequencies are the most common examples of structure within these recordings, and a large portion of modern neuroscience research focuses on how different frequency bands of these oscillations relate to different modes of activity for the organism being studied. Such signals can easily be detected and quantified automatically with traditional signal processing tools such as the Fourier transform. However, there also exist very transient oscillations within such recordings that are of interest to researchers. These require more sophisticated techniques to detect, because of their dual localization in both the time and frequency domains. A combination of several classic signal processing tools, namely digital band-pass filters, the Hilbert transform, z-scoring, and numerical derivatives has yielded an efficient and accurate algorithm for the detection of such transient oscillations. This algorithm has been applied to LFP data for sleeping rats and used to detect the well-known phenomena of sleep spindles, which are a hallmark of late stage sleep in mammals.
ID:
300
Year: 2010
Name: Rick Gillman
Institution: Valparaiso University
Subject area(s):
Title of Talk: Everyday Questions, Not-So-Everyday Mathematics
Abstract: The world is full of un-explored mathematical problems. This talk presents the stories of three problems that the presenter found in his everyday world and investigated with undergraduate research partners. One is solved completely, one quickly reaches deep and un-explored mathematical territory, and the third, while not solved, opens many paths for further exploration.
Year: 2010
Name: Rick Gillman
Institution: Valparaiso University
Subject area(s):
Title of Talk: Everyday Questions, Not-So-Everyday Mathematics
Abstract: The world is full of un-explored mathematical problems. This talk presents the stories of three problems that the presenter found in his everyday world and investigated with undergraduate research partners. One is solved completely, one quickly reaches deep and un-explored mathematical territory, and the third, while not solved, opens many paths for further exploration.
ID:
301
Year: 2010
Name: Darin Mohr
Institution: University of Iowa
Subject area(s):
Title of Talk: The Iowa Mathematical Modeling Challenge: Modeling in an Experimental Learning Setting
Abstract: We discuss the recent success of the third annual Iowa Mathematical Modeling Challenge (IMMC). The IMMC is a twenty-four hour contest similar to COMAP's Mathematical Contest in Modeling, but with an added emphasis on student assessment and mathematical communication. We also discuss the future of the IMMC at the University of Iowa.
Year: 2010
Name: Darin Mohr
Institution: University of Iowa
Subject area(s):
Title of Talk: The Iowa Mathematical Modeling Challenge: Modeling in an Experimental Learning Setting
Abstract: We discuss the recent success of the third annual Iowa Mathematical Modeling Challenge (IMMC). The IMMC is a twenty-four hour contest similar to COMAP's Mathematical Contest in Modeling, but with an added emphasis on student assessment and mathematical communication. We also discuss the future of the IMMC at the University of Iowa.
ID:
302
Year: 2010
Name: Matthew Rissler
Institution: Loras College
Subject area(s):
Title of Talk: Starting a Math Colloquium: Experiences from Loras College
Abstract: Also presenting: Angela Kohlhass (Loras College). In this talk, the speakers will describe their experiences initiating and maintaining the Loras College half of the Bi-State Mathematics Colloquium. The BSMC is a partnership between the math departments of UW-Platteville and Loras College and is in its second year. The Loras talks provide a venue for Loras math students and faculty to hear from mathematicians in the region surrounding Loras College on a biweekly basis. Topics that will be addressed in this talk include finding speakers, getting students to attend, establishing regional buy-in, and the issues that we have yet to resolve.
Year: 2010
Name: Matthew Rissler
Institution: Loras College
Subject area(s):
Title of Talk: Starting a Math Colloquium: Experiences from Loras College
Abstract: Also presenting: Angela Kohlhass (Loras College). In this talk, the speakers will describe their experiences initiating and maintaining the Loras College half of the Bi-State Mathematics Colloquium. The BSMC is a partnership between the math departments of UW-Platteville and Loras College and is in its second year. The Loras talks provide a venue for Loras math students and faculty to hear from mathematicians in the region surrounding Loras College on a biweekly basis. Topics that will be addressed in this talk include finding speakers, getting students to attend, establishing regional buy-in, and the issues that we have yet to resolve.
ID:
303
Year: 2011
Name: Christopher French
Institution: Grinnell College
Subject area(s): Number theory and Combinatorics
Title of Talk: Catalan Numbers and Hankel Transformations
Abstract: We explore recurrence relations obtained from taking the Hankel transform of various linear combinations of Catalan numbers.
Year: 2011
Name: Christopher French
Institution: Grinnell College
Subject area(s): Number theory and Combinatorics
Title of Talk: Catalan Numbers and Hankel Transformations
Abstract: We explore recurrence relations obtained from taking the Hankel transform of various linear combinations of Catalan numbers.
ID:
304
Year: 2011
Name: Joel Haack
Institution: University of Northern Iowa
Subject area(s): History of Mathematics
Title of Talk: Beginning a history of the Iowa Section of the MAA
Abstract: An interactive session focused on sources for the history of the Iowa Section of the MAA as part of its Centennial celebration in 2015.
Year: 2011
Name: Joel Haack
Institution: University of Northern Iowa
Subject area(s): History of Mathematics
Title of Talk: Beginning a history of the Iowa Section of the MAA
Abstract: An interactive session focused on sources for the history of the Iowa Section of the MAA as part of its Centennial celebration in 2015.
ID:
305
Year: 2011
Name: Travis Peters
Institution: Iowa State University
Subject area(s):
Title of Talk: Zero forcing number, maximum nullity, and path cover number of complete edge subdivision graphs
Abstract: The minimum rank of a simple graph G is defined to be the smallest possible rank over all symmetric real matrices whose ijth entry is nonzero whenever {i, j} is an edge in G and is zero otherwise. Maximum nullity is taken over the same set of matrices. The zero forcing number is the minimum size of a zero forcing set of vertices and bounds the maximum nullity from above. The path cover number is the fewest number of vertex disjoint induced paths that cover all the vertices of the graph. We study the effect of edge subdivisions of a graph on the zero forcing number, maximum nullity, and path cover number.
Year: 2011
Name: Travis Peters
Institution: Iowa State University
Subject area(s):
Title of Talk: Zero forcing number, maximum nullity, and path cover number of complete edge subdivision graphs
Abstract: The minimum rank of a simple graph G is defined to be the smallest possible rank over all symmetric real matrices whose ijth entry is nonzero whenever {i, j} is an edge in G and is zero otherwise. Maximum nullity is taken over the same set of matrices. The zero forcing number is the minimum size of a zero forcing set of vertices and bounds the maximum nullity from above. The path cover number is the fewest number of vertex disjoint induced paths that cover all the vertices of the graph. We study the effect of edge subdivisions of a graph on the zero forcing number, maximum nullity, and path cover number.
ID:
306
Year: 2011
Name: Martha Ellen Waggoner
Institution: Simpson College
Subject area(s):
Title of Talk: Discovery learning in linear algebra using dynamical geometry software.
Abstract: I have developed several Geometers Sketchpad sketches that students can use to help them understand transformations, eigenvalues, eigenvectors and a geometrical interpretation of the determinant. These dynamic sketches are used in discovery learning exercises in a computer classroom. In this talk I will demonstrate a couple of sketches and explain how they are used in the classroom.
Year: 2011
Name: Martha Ellen Waggoner
Institution: Simpson College
Subject area(s):
Title of Talk: Discovery learning in linear algebra using dynamical geometry software.
Abstract: I have developed several Geometers Sketchpad sketches that students can use to help them understand transformations, eigenvalues, eigenvectors and a geometrical interpretation of the determinant. These dynamic sketches are used in discovery learning exercises in a computer classroom. In this talk I will demonstrate a couple of sketches and explain how they are used in the classroom.
ID:
307
Year: 2011
Name: Brian Birgen
Institution: Wartburg College
Subject area(s): Calculus
Title of Talk: A First Calculus Course Using Numerical Tools and Modeling
Abstract: Our Calculus redesign consists of students learning the concepts of differentiation and integration by focusing on mathematical modeling and numerical solutions to differential equations. Topics covered include Euler's method, the Newtonian model for air resistance, the buoyancy of hot air ballooning, predator-prey models, Malaria and more.
Year: 2011
Name: Brian Birgen
Institution: Wartburg College
Subject area(s): Calculus
Title of Talk: A First Calculus Course Using Numerical Tools and Modeling
Abstract: Our Calculus redesign consists of students learning the concepts of differentiation and integration by focusing on mathematical modeling and numerical solutions to differential equations. Topics covered include Euler's method, the Newtonian model for air resistance, the buoyancy of hot air ballooning, predator-prey models, Malaria and more.