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 81-100 of 471 results.
Sort by:
ID:
531
Year: 2019
Name: Alvaro Carbonero
Institution: University of Nevada, Las Vegas
Subject area(s): Discrete Geometry
Title of Talk: Exploring Preference Orderings Through Discrete Geometry
Abstract: Consider $n + 1$ points in the plane: a set $S$ consisting of $n$ points along with a distinguished vantage point $v$. By measuring the distance from $v$ to each of the points in $S$, we generate a preference ordering of $S$. This work is motivated by a voting theory application, where an ordering corresponds to a preference list. The maximum number of orderings possible is given by a fourth-degree polynomial (related to Stirling numbers of the first kind), found by Good and Tideman (1977), while the minimum is given by a linear function. We investigate intermediate numbers of orderings achievable by special configurations $S$. We also consider this problem for points on the sphere, where our results are similar to what we found for the plane. A variant of the problem that uses two vantage points is also developed.
Year: 2019
Name: Alvaro Carbonero
Institution: University of Nevada, Las Vegas
Subject area(s): Discrete Geometry
Title of Talk: Exploring Preference Orderings Through Discrete Geometry
Abstract: Consider $n + 1$ points in the plane: a set $S$ consisting of $n$ points along with a distinguished vantage point $v$. By measuring the distance from $v$ to each of the points in $S$, we generate a preference ordering of $S$. This work is motivated by a voting theory application, where an ordering corresponds to a preference list. The maximum number of orderings possible is given by a fourth-degree polynomial (related to Stirling numbers of the first kind), found by Good and Tideman (1977), while the minimum is given by a linear function. We investigate intermediate numbers of orderings achievable by special configurations $S$. We also consider this problem for points on the sphere, where our results are similar to what we found for the plane. A variant of the problem that uses two vantage points is also developed.
ID:
261
Year: 2009
Name: Steven Dunbar
Institution: University of Nebraska-Lincoln
Subject area(s):
Title of Talk: MAA's American Mathematics Competitions: Easy Problems, Hard Problems, History and Outcomes
Abstract: How do you get bright students hooked on mathematics? How do you keep teachers intellectually engaged and pedagogically innovative? A proven way is to involve them both in mathematics competitions with great problems that span the curriculum. The Mathematical Association of America has continuously sponsored nationwide high-school level math contests since 1952. The sequence of contests now has 5 different contests at increasing levels of mathematical sophistication. Students who succeed at the top level on these contests become the team representing the U.S. at the annual International Mathematical Olympiad. I'll showcase some interesting, easy and hard contest problems, and a little bit of history. Along the way, I'll comment about the intersection of these contests with the school mathematics curriculum.
Year: 2009
Name: Steven Dunbar
Institution: University of Nebraska-Lincoln
Subject area(s):
Title of Talk: MAA's American Mathematics Competitions: Easy Problems, Hard Problems, History and Outcomes
Abstract: How do you get bright students hooked on mathematics? How do you keep teachers intellectually engaged and pedagogically innovative? A proven way is to involve them both in mathematics competitions with great problems that span the curriculum. The Mathematical Association of America has continuously sponsored nationwide high-school level math contests since 1952. The sequence of contests now has 5 different contests at increasing levels of mathematical sophistication. Students who succeed at the top level on these contests become the team representing the U.S. at the annual International Mathematical Olympiad. I'll showcase some interesting, easy and hard contest problems, and a little bit of history. Along the way, I'll comment about the intersection of these contests with the school mathematics curriculum.
ID:
509
Year: 2018
Name: Patrick Rault
Institution: University of Nebraska Omaha
Subject area(s):
Title of Talk: Regional Communities of Practice around Inquiry-Based Learning
Abstract: What began as a small group of professors gathering to discuss implementation of Inquiry-Based Learning (IBL) in our classes has developed into a strong regional community of practice. The Upstate New York IBL consortium was created in 2014 with a mission to create, grow, and maintain a community of instructors across the region. We will discuss how the consortium formed organically, the way that it operates, and several efforts to replicate it in other regions. Suggestions will be provided for creating your own regional community of practice for supporting the adoption and enhancement of active learning techniques.
Year: 2018
Name: Patrick Rault
Institution: University of Nebraska Omaha
Subject area(s):
Title of Talk: Regional Communities of Practice around Inquiry-Based Learning
Abstract: What began as a small group of professors gathering to discuss implementation of Inquiry-Based Learning (IBL) in our classes has developed into a strong regional community of practice. The Upstate New York IBL consortium was created in 2014 with a mission to create, grow, and maintain a community of instructors across the region. We will discuss how the consortium formed organically, the way that it operates, and several efforts to replicate it in other regions. Suggestions will be provided for creating your own regional community of practice for supporting the adoption and enhancement of active learning techniques.
ID:
547
Year: 2019
Name: Patrick Rault
Institution: University of Nebraska at Omaha
Subject area(s):
Title of Talk: A Dozen National and Regional Mini-grant opportunities for Undergraduate Faculty
Abstract: A wide range of mini-grants are available to support both teaching and research. The Inquiry-Based Learning Iowa-Nebraska Community (IBLINC) is now offering mini-grants for a wide range of peer-collaboration activities ranging from attending events to collaborating on course materials. This builds on a national momentum to offer mini-grants from the MAA for a wide variety of teaching activities, from CURM for an academic-year REU-style project with our students, and from AIM for a weeklong research retreat for your faculty team. While most of these programs are grant funded, the MAA’s Project NExT program has raised substantial continuing funds to provide professional development and a supportive community for new faculty. Join us to hear about a dozen such funding sources, learn what the aforementioned acronyms stand for, or share your own experiences.
Year: 2019
Name: Patrick Rault
Institution: University of Nebraska at Omaha
Subject area(s):
Title of Talk: A Dozen National and Regional Mini-grant opportunities for Undergraduate Faculty
Abstract: A wide range of mini-grants are available to support both teaching and research. The Inquiry-Based Learning Iowa-Nebraska Community (IBLINC) is now offering mini-grants for a wide range of peer-collaboration activities ranging from attending events to collaborating on course materials. This builds on a national momentum to offer mini-grants from the MAA for a wide variety of teaching activities, from CURM for an academic-year REU-style project with our students, and from AIM for a weeklong research retreat for your faculty team. While most of these programs are grant funded, the MAA’s Project NExT program has raised substantial continuing funds to provide professional development and a supportive community for new faculty. Join us to hear about a dozen such funding sources, learn what the aforementioned acronyms stand for, or share your own experiences.
ID:
381
Year: 2014
Name: Robert Todd
Institution: University of Nebraska at Omaha
Subject area(s): knot theory, undergraduate research
Title of Talk: Khovanov Homology: An undergraduate research project
Abstract: Khovanov homology is a sophisticated construction in knot theory, a branch of mathematics which is foreign and mysterious to many undergraduates. However, with only some linear algebra, some computer skills, and a little maturity as prerequisites, Khovanov homology can be used as a context to introduce many important mathematical ideas. I will discuss an on-going undergraduate research project whose goal is to compute the Khovanov homology of some families of knots. Such computations have only been performed for a handful of examples, thus our results will be of interest to researchers in the field. There will be many pictures and examples.
Year: 2014
Name: Robert Todd
Institution: University of Nebraska at Omaha
Subject area(s): knot theory, undergraduate research
Title of Talk: Khovanov Homology: An undergraduate research project
Abstract: Khovanov homology is a sophisticated construction in knot theory, a branch of mathematics which is foreign and mysterious to many undergraduates. However, with only some linear algebra, some computer skills, and a little maturity as prerequisites, Khovanov homology can be used as a context to introduce many important mathematical ideas. I will discuss an on-going undergraduate research project whose goal is to compute the Khovanov homology of some families of knots. Such computations have only been performed for a handful of examples, thus our results will be of interest to researchers in the field. There will be many pictures and examples.
ID:
204
Year: 2007
Name: Joseph A. Gallian
Institution: University of Minnesota, Duluth
Subject area(s):
Title of Talk: Using groups and graphs to create symmetry patterns, Parts 1
Abstract: Part 1 concerns the problem of traversing an m by n directed grid embedded on a torus so that each vertex is visited exactly once before returning to the starting position. We also consider generalizations and variations on this theme.
Year: 2007
Name: Joseph A. Gallian
Institution: University of Minnesota, Duluth
Subject area(s):
Title of Talk: Using groups and graphs to create symmetry patterns, Parts 1
Abstract: Part 1 concerns the problem of traversing an m by n directed grid embedded on a torus so that each vertex is visited exactly once before returning to the starting position. We also consider generalizations and variations on this theme.
ID:
205
Year: 2007
Name: Joseph A. Gallian
Institution: University of Minnesota, Duluth
Subject area(s):
Title of Talk: Using groups and graphs to create symmetry patterns, Part 2
Abstract: Part 2 is a discussion of how Hamiltonian paths, spanning trees, cosets in groups, and factor groups can be used to create computer generated symmetry patterns in hyperbolic and Euclidean planes. These methods were used to create the image for the 2003 Mathematics Awareness Month poster.
Year: 2007
Name: Joseph A. Gallian
Institution: University of Minnesota, Duluth
Subject area(s):
Title of Talk: Using groups and graphs to create symmetry patterns, Part 2
Abstract: Part 2 is a discussion of how Hamiltonian paths, spanning trees, cosets in groups, and factor groups can be used to create computer generated symmetry patterns in hyperbolic and Euclidean planes. These methods were used to create the image for the 2003 Mathematics Awareness Month poster.
ID:
570
Year: 2021
Name: James Sellers
Institution: University of Minnesota - Duluth
Subject area(s):
Title of Talk: Revisiting What Euler and the Bernoullis Knew About Convergent Infinite Series
Abstract: All too often in first-year calculus classes, conversations about infinite series stop with discussions about convergence or divergence. Such interactions are, unfortunately, not often illuminating or intriguing. Interestingly enough, Jacob and Johann Bernoulli and Leonhard Euler (and their contemporaries in the early 18th century) knew quite a bit about how to find the *exact* values of numerous families of convergent infinite series. In this talk, I will show two sets of *exact* results in this vein. The talk will be accessible to anyone interested in mathematics.
Year: 2021
Name: James Sellers
Institution: University of Minnesota - Duluth
Subject area(s):
Title of Talk: Revisiting What Euler and the Bernoullis Knew About Convergent Infinite Series
Abstract: All too often in first-year calculus classes, conversations about infinite series stop with discussions about convergence or divergence. Such interactions are, unfortunately, not often illuminating or intriguing. Interestingly enough, Jacob and Johann Bernoulli and Leonhard Euler (and their contemporaries in the early 18th century) knew quite a bit about how to find the *exact* values of numerous families of convergent infinite series. In this talk, I will show two sets of *exact* results in this vein. The talk will be accessible to anyone interested in mathematics.
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:
541
Year: 2019
Name: Christina Pospisil
Institution: University of Massachusetts Boston
Subject area(s):
Title of Talk: Generalization Theory for Linear Algebra I: An Embedding Algorithm and an appropriate Inverse for non-injective mappings in one dimension
Abstract: An algorithm for multiplying and adding matrices regardless of dimensions via an embedding is presented. An equivalent embedding for a general determinant theory is also investigated (Part I: Appropriate Inverses for non-injective mappings in one dimension are presented). In future work there will be applications to physics and other natural sciences be explored.
Year: 2019
Name: Christina Pospisil
Institution: University of Massachusetts Boston
Subject area(s):
Title of Talk: Generalization Theory for Linear Algebra I: An Embedding Algorithm and an appropriate Inverse for non-injective mappings in one dimension
Abstract: An algorithm for multiplying and adding matrices regardless of dimensions via an embedding is presented. An equivalent embedding for a general determinant theory is also investigated (Part I: Appropriate Inverses for non-injective mappings in one dimension are presented). In future work there will be applications to physics and other natural sciences be explored.
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:
278
Year: 2010
Name: K Stroyan
Institution: University of Iowa
Subject area(s):
Title of Talk: Projects in Calculus Class
Abstract: My favorite calculus question is: Why did we eradicate polio by vaccination, but not measles? I use this as a training project for student projects in calculus. I'll talk about my experience with "modeling" projects in calculus.
Year: 2010
Name: K Stroyan
Institution: University of Iowa
Subject area(s):
Title of Talk: Projects in Calculus Class
Abstract: My favorite calculus question is: Why did we eradicate polio by vaccination, but not measles? I use this as a training project for student projects in calculus. I'll talk about my experience with "modeling" projects in calculus.
ID:
283
Year: 2010
Name: Samuel Ferguson
Institution: University of Iowa
Subject area(s): Analysis, Teaching, Foundations
Title of Talk: Reals Revisited: NO SUP FOR YOU!
Abstract: Traditionally, first courses in analysis have started with certain axioms and then, in the course of deducing the consequences of these axioms, they prove the major theorems of calculus. The chief among these axioms is the "sup/least upper bound axiom," which seems obscure to most beginners. Where did such a thing come from, and how do we know that such a number system, satisfying such axioms, actually exists? Are the "reals" real? If teachers and students leave such questions unasked, they risk getting the impression that mathematics is just what happens when a somebody writes down a set of axioms and uses them to go on, in the words of Steven G. Krantz, "a magical mystery tour." Fortunately, in 1872 Dedekind and Cantor, independently and with different approaches, which have come to be known as the "Dedekind cut" approach to the "sup" and the "Cauchy sequence" approach to "completeness," constructed such real number systems, but their approaches are considered too complicated to present in their entirety at the beginning of most courses in analysis. In this talk, assisted by the intuition of Cauchy, Weierstrass, Courant, and others, we will give another (new?) construction of the reals, which has the advantages of both of the other constructions discussed and the complications of neither. Time permitting, the number "e" will be defined with this approach, or the Intermediate Value Theorem will be proved.
Year: 2010
Name: Samuel Ferguson
Institution: University of Iowa
Subject area(s): Analysis, Teaching, Foundations
Title of Talk: Reals Revisited: NO SUP FOR YOU!
Abstract: Traditionally, first courses in analysis have started with certain axioms and then, in the course of deducing the consequences of these axioms, they prove the major theorems of calculus. The chief among these axioms is the "sup/least upper bound axiom," which seems obscure to most beginners. Where did such a thing come from, and how do we know that such a number system, satisfying such axioms, actually exists? Are the "reals" real? If teachers and students leave such questions unasked, they risk getting the impression that mathematics is just what happens when a somebody writes down a set of axioms and uses them to go on, in the words of Steven G. Krantz, "a magical mystery tour." Fortunately, in 1872 Dedekind and Cantor, independently and with different approaches, which have come to be known as the "Dedekind cut" approach to the "sup" and the "Cauchy sequence" approach to "completeness," constructed such real number systems, but their approaches are considered too complicated to present in their entirety at the beginning of most courses in analysis. In this talk, assisted by the intuition of Cauchy, Weierstrass, Courant, and others, we will give another (new?) construction of the reals, which has the advantages of both of the other constructions discussed and the complications of neither. Time permitting, the number "e" will be defined with this approach, or the Intermediate Value Theorem will be proved.
ID:
284
Year: 2010
Name: Peter Blanchard
Institution: University of Iowa
Subject area(s): combinatorics, algebra
Title of Talk: Unit-connected pseudo-arithmetic super sets in the Gaussian Integers
Abstract: A set is pseudo-arithmetic if it has a difference which divides all other differences. A set is a pseudo-arithmetic super set if every subset is a pseudo-arithmetic set. Every pseudo-arithmetic super set can be contracted to have a unit difference, so the classification of pseudo-arithmetics super sets in Z[i] starts with the units. We give a complete classification of the unit-connected pseudo-arithmetic super sets in Z[i], and discuss which are maximal, which are bounded, and which may be extended.
Year: 2010
Name: Peter Blanchard
Institution: University of Iowa
Subject area(s): combinatorics, algebra
Title of Talk: Unit-connected pseudo-arithmetic super sets in the Gaussian Integers
Abstract: A set is pseudo-arithmetic if it has a difference which divides all other differences. A set is a pseudo-arithmetic super set if every subset is a pseudo-arithmetic set. Every pseudo-arithmetic super set can be contracted to have a unit difference, so the classification of pseudo-arithmetics super sets in Z[i] starts with the units. We give a complete classification of the unit-connected pseudo-arithmetic super sets in Z[i], and discuss which are maximal, which are bounded, and which may be extended.
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:
343
Year: 2012
Name: Mary Therese Padberg
Institution: University of Iowa
Subject area(s): Mathematical Biology
Title of Talk: The Twisted Tale of Protein-bound DNA
Abstract: DNA is important for our cells to function and grow, but it cannot accomplish this alone. DNA is just the blueprint and its information must be read and expressed by proteins. Understanding the shape of DNA when protein has bound to it (protein-bound DNA) is important for biological and medical research. Laboratory techniques exist which allow scientists to find the geometric structure for some protein-bound DNA complexes. When these techniques fail, we can often experimentally determine a topology for the complex, but topology alone is not enough. In order to understand the structure of protein-bound DNA at a scientifically useful level we need to know the geometry of the structure. In this talk we will create a mathematical model based on the DNA topology from laboratory experiments to describe the geometry of the DNA. We will discuss the flexibility of this model to accept user modifications in order to model the protein-bound DNA sample under variable conditions. Thus, by combining geometric and topological solutions we will be able to more accurately describe the shape of large protein-bound DNA complexes.
Year: 2012
Name: Mary Therese Padberg
Institution: University of Iowa
Subject area(s): Mathematical Biology
Title of Talk: The Twisted Tale of Protein-bound DNA
Abstract: DNA is important for our cells to function and grow, but it cannot accomplish this alone. DNA is just the blueprint and its information must be read and expressed by proteins. Understanding the shape of DNA when protein has bound to it (protein-bound DNA) is important for biological and medical research. Laboratory techniques exist which allow scientists to find the geometric structure for some protein-bound DNA complexes. When these techniques fail, we can often experimentally determine a topology for the complex, but topology alone is not enough. In order to understand the structure of protein-bound DNA at a scientifically useful level we need to know the geometry of the structure. In this talk we will create a mathematical model based on the DNA topology from laboratory experiments to describe the geometry of the DNA. We will discuss the flexibility of this model to accept user modifications in order to model the protein-bound DNA sample under variable conditions. Thus, by combining geometric and topological solutions we will be able to more accurately describe the shape of large protein-bound DNA complexes.
ID:
358
Year: 2013
Name: Paul Muhly
Institution: University of Iowa
Subject area(s): pedagogy
Title of Talk: TeX in the Classroom
Abstract: In this talk I will advocate for and share my experiences when requiring students to write their homework in LaTeX. The experiences I have had when requiring students to TeX their homework have been surprisingly positive. I will explain what I have done and offer suggestions, especially suggestions about how to get students started using TeX.
Year: 2013
Name: Paul Muhly
Institution: University of Iowa
Subject area(s): pedagogy
Title of Talk: TeX in the Classroom
Abstract: In this talk I will advocate for and share my experiences when requiring students to write their homework in LaTeX. The experiences I have had when requiring students to TeX their homework have been surprisingly positive. I will explain what I have done and offer suggestions, especially suggestions about how to get students started using TeX.
ID:
103
Year: 2005
Name: Matthew Johnson
Institution: University of Iowa
Subject area(s): Functional Analysis, C*-Algebras
Title of Talk: The Graph Traces of Finite Graphs and Applications to Tracial States of C*-Algebras
Abstract: We determine the extreme points of the set of graph traces of norm one for any finite graph E satisfying Condition (K). We also describe and application to the space of tracial states on the graph C*-algebra.
Year: 2005
Name: Matthew Johnson
Institution: University of Iowa
Subject area(s): Functional Analysis, C*-Algebras
Title of Talk: The Graph Traces of Finite Graphs and Applications to Tracial States of C*-Algebras
Abstract: We determine the extreme points of the set of graph traces of norm one for any finite graph E satisfying Condition (K). We also describe and application to the space of tracial states on the graph C*-algebra.
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.
ID:
131
Year: 2005
Name: K Stroyan
Institution: University of Iowa
Subject area(s): Trig and basic calculus
Title of Talk: Retinal disparity via computer
Abstract: The horizontal separation of our eyes causes the image each eye receives to fall on a slightly different portion of the retina. This difference is called "retinal disparity" and has been studied extensively for its relation to depth perception. (This kind of depth perception is called stereopsis. Helmholtz' book in 1910 is an old "standard" reference to this) Recently a psychologist friend mentioned that he was studying how retinal disparity changes as a driver views two objects off to the side of the road. He also mentioned that most of his colleagues are "math-o-phobic" and used rather coarse approximations to retinal disparity. I wrote a Mathematica animation to show the motion of the eyes of a driver and compute the time derivative of retinal disparity. We corresponded sending graphs via email until I had a start at what interests the scientists. The math is simple vector geometry with some arc tangents, but it is a little messy, so I didn't immediately look at the formulas. When I did, I had a surprise. And I believe the surprise means we could train better users of mathematics if we worked towards better integration of modern computing in basic math. We hope to build a web-Mathematica site for psychologists to use for their computations.
Year: 2005
Name: K Stroyan
Institution: University of Iowa
Subject area(s): Trig and basic calculus
Title of Talk: Retinal disparity via computer
Abstract: The horizontal separation of our eyes causes the image each eye receives to fall on a slightly different portion of the retina. This difference is called "retinal disparity" and has been studied extensively for its relation to depth perception. (This kind of depth perception is called stereopsis. Helmholtz' book in 1910 is an old "standard" reference to this) Recently a psychologist friend mentioned that he was studying how retinal disparity changes as a driver views two objects off to the side of the road. He also mentioned that most of his colleagues are "math-o-phobic" and used rather coarse approximations to retinal disparity. I wrote a Mathematica animation to show the motion of the eyes of a driver and compute the time derivative of retinal disparity. We corresponded sending graphs via email until I had a start at what interests the scientists. The math is simple vector geometry with some arc tangents, but it is a little messy, so I didn't immediately look at the formulas. When I did, I had a surprise. And I believe the surprise means we could train better users of mathematics if we worked towards better integration of modern computing in basic math. We hope to build a web-Mathematica site for psychologists to use for their computations.