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 101-120 of 471 results.
Sort by:
ID:
125
Year: 2005
Name: Michael Rieck
Institution: Drake University
Subject area(s): special functions
Title of Talk: A Multiple Integral of a Piecewise Algebraic Function.
Abstract: Fix r>0. Let (x_0, y_0) and (x_n, y_n) be fixed and a distance r apart. Consider the set of all points ( x_1, y_1, x_2, y_2,..., x_{n-1}, y_{n-1} ) in Euclidean (2n-2)-space for which the distance in the plane between (x_{j-1}, y_{j-1}) and (x_j, y_j) never exceeds one (j=1,...,n). The hyper-volume of this set of points in (2n-2)-space can clearly be expressed as a multiple integral, integrating over 2n-2 dimensions, a function that is 1 on the set, but 0 off of the set. Surprisingly, it can also be expressed as a multiple integral over n-1 dimensions, of a piece-wise algebraic function.
Year: 2005
Name: Michael Rieck
Institution: Drake University
Subject area(s): special functions
Title of Talk: A Multiple Integral of a Piecewise Algebraic Function.
Abstract: Fix r>0. Let (x_0, y_0) and (x_n, y_n) be fixed and a distance r apart. Consider the set of all points ( x_1, y_1, x_2, y_2,..., x_{n-1}, y_{n-1} ) in Euclidean (2n-2)-space for which the distance in the plane between (x_{j-1}, y_{j-1}) and (x_j, y_j) never exceeds one (j=1,...,n). The hyper-volume of this set of points in (2n-2)-space can clearly be expressed as a multiple integral, integrating over 2n-2 dimensions, a function that is 1 on the set, but 0 off of the set. Surprisingly, it can also be expressed as a multiple integral over n-1 dimensions, of a piece-wise algebraic function.
ID:
126
Year: 2005
Name: Dan Alexander
Institution: Drake University
Subject area(s): History of Mathematics
Title of Talk: The History of Complex Dynamics, Part II
Abstract: Part I was given to the Iowa section in 1994 and focused on the 1918 papers of Pierre Fatou and Gaston Julia on which the contemporary study of complex dynamics is based. In part II I will talk about both prior and subsequent developments in an attempt to put these 1918 papers in a more complete historical context. In particular, I will discuss some "new" influences on their works that I have recently been made aware of as well as discuss contemporaneous (that is, immediately following World War I) studies of complex dynamics around the world. I will also gladly review the works of Fatou and Julia for those who were not present for (or can't quite recall) Part I. This talk is based on collaborative research by Felice Iavernaro, Alessandro Rosa, and me.
Year: 2005
Name: Dan Alexander
Institution: Drake University
Subject area(s): History of Mathematics
Title of Talk: The History of Complex Dynamics, Part II
Abstract: Part I was given to the Iowa section in 1994 and focused on the 1918 papers of Pierre Fatou and Gaston Julia on which the contemporary study of complex dynamics is based. In part II I will talk about both prior and subsequent developments in an attempt to put these 1918 papers in a more complete historical context. In particular, I will discuss some "new" influences on their works that I have recently been made aware of as well as discuss contemporaneous (that is, immediately following World War I) studies of complex dynamics around the world. I will also gladly review the works of Fatou and Julia for those who were not present for (or can't quite recall) Part I. This talk is based on collaborative research by Felice Iavernaro, Alessandro Rosa, and me.
ID:
130
Year: 2005
Name: Bernadette Baker
Institution: Drake University
Subject area(s): College Algebra
Title of Talk: A Unified Representation of Function
Abstract: The researchers have built a theoretical model of student development of function using the APOS paradigm. Students have difficulty with this concept because of the inability to recognize the common feature of the traditional function representations (analytic, graphical and tabular). By providing techniques for standard operations that focus attention on the defining feature of function (the association of input with output), the researchers hope to rectify this problem in student learning. This representation will be explained; one researcher has piloted this approach successfully and initial results will be reported.
Year: 2005
Name: Bernadette Baker
Institution: Drake University
Subject area(s): College Algebra
Title of Talk: A Unified Representation of Function
Abstract: The researchers have built a theoretical model of student development of function using the APOS paradigm. Students have difficulty with this concept because of the inability to recognize the common feature of the traditional function representations (analytic, graphical and tabular). By providing techniques for standard operations that focus attention on the defining feature of function (the association of input with output), the researchers hope to rectify this problem in student learning. This representation will be explained; one researcher has piloted this approach successfully and initial results will be reported.
ID:
165
Year: 2006
Name: Luz De Alba
Institution: Drake University
Subject area(s): Linear Algebra, Matrix Theory, Graph Theory
Title of Talk: Comparison of P-matrix completions with Q-matrix completions.
Abstract: A P-matrix is a real square matrix, in which the determinant of every principal submatrix is positive. A Q-matrix is one in which the sum of the determinants of principal submatrices of the same size is positive. Clearly every P-matrix is a Q-matrix. A partial P-matrix is a matrix in which some entries are specified while others are not known, and every fully specified principal submatrix has positive determinant. The P-matrix completion problem asks the question: "Which partial P-matrices can be completed to a P-matrix?" In this talk we give the definition of partial Q-matrix, and compare the Q-matrix completion problem to the P-matrix completion problem. We also discuss some partial answers to the Q-completion problem.
Year: 2006
Name: Luz De Alba
Institution: Drake University
Subject area(s): Linear Algebra, Matrix Theory, Graph Theory
Title of Talk: Comparison of P-matrix completions with Q-matrix completions.
Abstract: A P-matrix is a real square matrix, in which the determinant of every principal submatrix is positive. A Q-matrix is one in which the sum of the determinants of principal submatrices of the same size is positive. Clearly every P-matrix is a Q-matrix. A partial P-matrix is a matrix in which some entries are specified while others are not known, and every fully specified principal submatrix has positive determinant. The P-matrix completion problem asks the question: "Which partial P-matrices can be completed to a P-matrix?" In this talk we give the definition of partial Q-matrix, and compare the Q-matrix completion problem to the P-matrix completion problem. We also discuss some partial answers to the Q-completion problem.
ID:
170
Year: 2006
Name: Alexander Kleiner
Institution: Drake University
Subject area(s): analysis, history of mathematics
Title of Talk: The Toeplitz-Silverman Theorem Part II
Abstract: In the first two decades of the twentieth century summability developed from collection of special results used in other parts of analysis into a full-blown field. One of the main points of this transition was a collection of general results that gave conditions for a method to sum every convergent sequence. Part I of this presentation, which was given last spring, laid out the work that led to the general theory. Papers by Toeplitz, Silverman, Kojima, Schur and others established the theory. This note will look at the development of these conditions and, as time permits, the reoccurrence of these results in the early day of the "Polish" school of functional analysis
Year: 2006
Name: Alexander Kleiner
Institution: Drake University
Subject area(s): analysis, history of mathematics
Title of Talk: The Toeplitz-Silverman Theorem Part II
Abstract: In the first two decades of the twentieth century summability developed from collection of special results used in other parts of analysis into a full-blown field. One of the main points of this transition was a collection of general results that gave conditions for a method to sum every convergent sequence. Part I of this presentation, which was given last spring, laid out the work that led to the general theory. Papers by Toeplitz, Silverman, Kojima, Schur and others established the theory. This note will look at the development of these conditions and, as time permits, the reoccurrence of these results in the early day of the "Polish" school of functional analysis
ID:
433
Year: 2015
Name: Dan Alexander
Institution: Drake University
Subject area(s):
Title of Talk: Innovation through Blunder (or the Unexpected Virtues of Non-Intentionality)
Abstract: "We all make mistakes." "There is no such thing as a dumb question." "You should embrace your mistakes and learn from them." These are all things that many of us tell our students. But do we believe it? More importantly, do we follow this advice in our own teaching? What I hope to do in this talk is explore the role of mistakes in teaching with the audience. In hopes of getting the conversation rolling, I will offer a few examples of mistakes, including several I have made. some of which have led to some drastic changes in my teaching.
Year: 2015
Name: Dan Alexander
Institution: Drake University
Subject area(s):
Title of Talk: Innovation through Blunder (or the Unexpected Virtues of Non-Intentionality)
Abstract: "We all make mistakes." "There is no such thing as a dumb question." "You should embrace your mistakes and learn from them." These are all things that many of us tell our students. But do we believe it? More importantly, do we follow this advice in our own teaching? What I hope to do in this talk is explore the role of mistakes in teaching with the audience. In hopes of getting the conversation rolling, I will offer a few examples of mistakes, including several I have made. some of which have led to some drastic changes in my teaching.
ID:
435
Year: 2016
Name: Deborah Kent
Institution: Drake University
Subject area(s): Game Theory, Graph Theory
Title of Talk: Can you be happy with your piece of cake?
Abstract: This talk will consider questions of equitable and envy-free division. We will prove Sperner's Lemma -- an elegant graph-theoretic result due to Emmanuel Sperner -- and apply it to conclude the existence of an envy-free division of cake.
Year: 2016
Name: Deborah Kent
Institution: Drake University
Subject area(s): Game Theory, Graph Theory
Title of Talk: Can you be happy with your piece of cake?
Abstract: This talk will consider questions of equitable and envy-free division. We will prove Sperner's Lemma -- an elegant graph-theoretic result due to Emmanuel Sperner -- and apply it to conclude the existence of an envy-free division of cake.
ID:
438
Year: 2016
Name: Meghan Stevens
Institution: Drake University
Subject area(s): Ordinary Differential Equations, Mathematical Biology, Global Dynamics
Title of Talk: Global Dynamics of a Breast Cancer Competition System
Abstract: In this talk I present a system of five ordinary differential equations to model the competition for space and resources between breast cancer cells and healthy cells. Included is the cancer stem cell hypothesis, which states that there exist proliferating cancer stem cells that repopulate non-proliferating tumor cells and can lead to tumor recurrence. These cancer stem cells exist in a smaller population, making them harder to detect. Additionally, the system contains an equation for the immune system in order to show how the body naturally defends itself from invading tumors. Finally, because the majority of breast cancer cells are estrogen-receptor positive, the role of excess estrogen in the body introduced through birth control in included. Estrogen increases the amount of cancer cells while hindering the effectiveness of the immune system. Its presence also increases the likelihood that healthy cells will mutate.Through stability analysis of sub-models in addition to the full model, states in which cancer is eradicated are found, as well as states in which cancer persists, given certain parameter values.
Year: 2016
Name: Meghan Stevens
Institution: Drake University
Subject area(s): Ordinary Differential Equations, Mathematical Biology, Global Dynamics
Title of Talk: Global Dynamics of a Breast Cancer Competition System
Abstract: In this talk I present a system of five ordinary differential equations to model the competition for space and resources between breast cancer cells and healthy cells. Included is the cancer stem cell hypothesis, which states that there exist proliferating cancer stem cells that repopulate non-proliferating tumor cells and can lead to tumor recurrence. These cancer stem cells exist in a smaller population, making them harder to detect. Additionally, the system contains an equation for the immune system in order to show how the body naturally defends itself from invading tumors. Finally, because the majority of breast cancer cells are estrogen-receptor positive, the role of excess estrogen in the body introduced through birth control in included. Estrogen increases the amount of cancer cells while hindering the effectiveness of the immune system. Its presence also increases the likelihood that healthy cells will mutate.Through stability analysis of sub-models in addition to the full model, states in which cancer is eradicated are found, as well as states in which cancer persists, given certain parameter values.
ID:
200
Year: 2007
Name: Jonathan Botts
Institution: Drake University
Subject area(s):
Title of Talk: On the Weakly Sign Symmetric Matrix Completion Problems
Abstract: An n x n matrix is called a P-matrix if all its principal minors are positive. An n x n matrix, A = [a_{ij}], is sign symmetric, if for each i,j \in \{1, 2, \dots, n }, either a_{ij} = 0 = a_{ji}$ or a_{ij}a_{ji}>0; the matrix is weakly sign symmetric if a_{ij}a_{ji}\ge 0. In this talk we show that an n x n partial (weakly) sign symmetric P-matrix specifying an asymmetric acyclic digraph can be completed to a (weakly) sign symmetric P-matrix. We also show that a partial n x n (weakly) sign symmetric P-matrix specifying an asymmetric digraph with no 3-cycles, can be completed to a (weakly) sign symmetric P-matrix for n >= 5.
Year: 2007
Name: Jonathan Botts
Institution: Drake University
Subject area(s):
Title of Talk: On the Weakly Sign Symmetric Matrix Completion Problems
Abstract: An n x n matrix is called a P-matrix if all its principal minors are positive. An n x n matrix, A = [a_{ij}], is sign symmetric, if for each i,j \in \{1, 2, \dots, n }, either a_{ij} = 0 = a_{ji}$ or a_{ij}a_{ji}>0; the matrix is weakly sign symmetric if a_{ij}a_{ji}\ge 0. In this talk we show that an n x n partial (weakly) sign symmetric P-matrix specifying an asymmetric acyclic digraph can be completed to a (weakly) sign symmetric P-matrix. We also show that a partial n x n (weakly) sign symmetric P-matrix specifying an asymmetric digraph with no 3-cycles, can be completed to a (weakly) sign symmetric P-matrix for n >= 5.
ID:
202
Year: 2007
Name: Luz De Alba Guerra
Institution: Drake University
Subject area(s):
Title of Talk: Minimum Rank of Powers of Some Special Graphs
Abstract: For an n x n symmetric matrix A the graph of A, G(A) =(V, E) is a simple undirected graph with vertex set {1, 2, ..., n }, where {i, j } is in E, if and only if a_{ij} is not 0. For a graph G, with vertex set V = {1, 2, ..., n }, and edge set E, the r-th power of G is the graph G^r = (V, F), where {u, v } is in F if and only if there is a walk of length r from u to v. The minimum rank of a graph G is mr(G) = min{ rank(A) : A = A^T, and G(A) = G }. In this talk we determine the minimum rank of certain powers of two special families of graphs: paths and trees in general. We will also present a onjecture on the minimum rank of powers of cycles.
Year: 2007
Name: Luz De Alba Guerra
Institution: Drake University
Subject area(s):
Title of Talk: Minimum Rank of Powers of Some Special Graphs
Abstract: For an n x n symmetric matrix A the graph of A, G(A) =(V, E) is a simple undirected graph with vertex set {1, 2, ..., n }, where {i, j } is in E, if and only if a_{ij} is not 0. For a graph G, with vertex set V = {1, 2, ..., n }, and edge set E, the r-th power of G is the graph G^r = (V, F), where {u, v } is in F if and only if there is a walk of length r from u to v. The minimum rank of a graph G is mr(G) = min{ rank(A) : A = A^T, and G(A) = G }. In this talk we determine the minimum rank of certain powers of two special families of graphs: paths and trees in general. We will also present a onjecture on the minimum rank of powers of cycles.
ID:
245
Year: 2008
Name: Patsy Fagan
Institution: Drake University
Subject area(s):
Title of Talk: Activities to Nspire College Algebra and Calculus
Abstract: This hands-on workshop will present activities for a College Algebra and Calculus class. This is for the novice user of the TI-Nspire CAS handheld.
Year: 2008
Name: Patsy Fagan
Institution: Drake University
Subject area(s):
Title of Talk: Activities to Nspire College Algebra and Calculus
Abstract: This hands-on workshop will present activities for a College Algebra and Calculus class. This is for the novice user of the TI-Nspire CAS handheld.
ID:
246
Year: 2008
Name: Patsy Fagan
Institution: Drake University
Subject area(s):
Title of Talk: Activities to Nspire College Algebra and Calculus
Abstract: This hands-on workshop will present activities for a College Algebra and Calculus class. This is for the novice user of the TI-Nspire CAS handheld. This is a repeat of the earlier session.
Year: 2008
Name: Patsy Fagan
Institution: Drake University
Subject area(s):
Title of Talk: Activities to Nspire College Algebra and Calculus
Abstract: This hands-on workshop will present activities for a College Algebra and Calculus class. This is for the novice user of the TI-Nspire CAS handheld. This is a repeat of the earlier session.
ID:
47
Year: 2004
Name: Ronald Smith
Institution: Graceland College
Subject area(s): Algorithms
Title of Talk: The distribution of digits in consecutive integers
Abstract: The distribution of digits problem asks for the frequency of each digit (0
Year: 2004
Name: Ronald Smith
Institution: Graceland College
Subject area(s): Algorithms
Title of Talk: The distribution of digits in consecutive integers
Abstract: The distribution of digits problem asks for the frequency of each digit (0
ID:
313
Year: 2011
Name: Ronald Smith
Institution: Graceland University
Subject area(s): Introductory Complex Analysis
Title of Talk: Just Plane Numbers
Abstract: The vocabulary of a typical introduction to complex numbers challenges the beginner with a bewildering array of words with strong connotations of "imaginary," "complex," and "non-real." By combining a geometric approach to complex arithmetic found in Roger Penrose's book "The Road to Reality" with the interactive geometry package, Geogebra, we show that it is possible and even insightful to characterize these as just plane numbers.
Year: 2011
Name: Ronald Smith
Institution: Graceland University
Subject area(s): Introductory Complex Analysis
Title of Talk: Just Plane Numbers
Abstract: The vocabulary of a typical introduction to complex numbers challenges the beginner with a bewildering array of words with strong connotations of "imaginary," "complex," and "non-real." By combining a geometric approach to complex arithmetic found in Roger Penrose's book "The Road to Reality" with the interactive geometry package, Geogebra, we show that it is possible and even insightful to characterize these as just plane numbers.
ID:
355
Year: 2013
Name: Ronald Smith
Institution: Graceland University
Subject area(s): algorithms
Title of Talk: Beautiful Strings
Abstract: Let S and T be strings. S is more beautiful than T if (i) S is longer than T, or (ii) if S and T have the same length, then S > T lexicographically. S derives T, if T is a subsequence (not necessarily a substring) of S. T is unique if each character in T appears exactly once. The "Beautiful Strings Problem" is to find the most beautiful unique string that can be derived from a given string S. This problem appeared on the web and in at least one programming contest last year, with no correct solution known to this author. We give an efficient solution, showing the usefulness of a mathematical approach.
Year: 2013
Name: Ronald Smith
Institution: Graceland University
Subject area(s): algorithms
Title of Talk: Beautiful Strings
Abstract: Let S and T be strings. S is more beautiful than T if (i) S is longer than T, or (ii) if S and T have the same length, then S > T lexicographically. S derives T, if T is a subsequence (not necessarily a substring) of S. T is unique if each character in T appears exactly once. The "Beautiful Strings Problem" is to find the most beautiful unique string that can be derived from a given string S. This problem appeared on the web and in at least one programming contest last year, with no correct solution known to this author. We give an efficient solution, showing the usefulness of a mathematical approach.
ID:
128
Year: 2005
Name: Ronald Smith
Institution: Graceland University
Subject area(s): Voting
Title of Talk: The Mathematics of Common Consent
Abstract: Many religious traditions, including my own, value
Year: 2005
Name: Ronald Smith
Institution: Graceland University
Subject area(s): Voting
Title of Talk: The Mathematics of Common Consent
Abstract: Many religious traditions, including my own, value
ID:
389
Year: 2014
Name: Jason Smith
Institution: Graceland University
Subject area(s):
Title of Talk: Inquiry Based Learning
Abstract: A discussion about the Inquiry Based Learning(IBL) Workshop I attended this summer as well as my experience using the IBL methods in Probability and Stochastic Processes. I will discuss some early successes and early failures in class. I will mention some of the research in support of IBL.
Year: 2014
Name: Jason Smith
Institution: Graceland University
Subject area(s):
Title of Talk: Inquiry Based Learning
Abstract: A discussion about the Inquiry Based Learning(IBL) Workshop I attended this summer as well as my experience using the IBL methods in Probability and Stochastic Processes. I will discuss some early successes and early failures in class. I will mention some of the research in support of IBL.
ID:
449
Year: 2016
Name: Ronald Smith
Institution: Graceland University
Subject area(s):
Title of Talk: Covering Cylinders
Abstract: We wil show how to design a cover to fit intersecting cylinders of different diameters. This is a real problem involving my neighbor's underground house.
Year: 2016
Name: Ronald Smith
Institution: Graceland University
Subject area(s):
Title of Talk: Covering Cylinders
Abstract: We wil show how to design a cover to fit intersecting cylinders of different diameters. This is a real problem involving my neighbor's underground house.
ID:
194
Year: 2007
Name: Ronald Smith
Institution: Graceland University
Subject area(s):
Title of Talk: Optimal arrangement of digits
Abstract: Problem: Arrange a sequence of mn positive digits into m n-digit numbers whose product is minimized or maximized. We show how to recognize optimal arrangements of digits, and give an efficient algorithm for finding solutions.
Year: 2007
Name: Ronald Smith
Institution: Graceland University
Subject area(s):
Title of Talk: Optimal arrangement of digits
Abstract: Problem: Arrange a sequence of mn positive digits into m n-digit numbers whose product is minimized or maximized. We show how to recognize optimal arrangements of digits, and give an efficient algorithm for finding solutions.
ID:
457
Year: 2016
Name: Jason Smith
Institution: Graceland University
Subject area(s):
Title of Talk: Magical Grants
Abstract: A discussion of writing and receiving an in-house grant to visit local middle schools and do mathematical tricks with them. Some tricks may also be revealed.
Year: 2016
Name: Jason Smith
Institution: Graceland University
Subject area(s):
Title of Talk: Magical Grants
Abstract: A discussion of writing and receiving an in-house grant to visit local middle schools and do mathematical tricks with them. Some tricks may also be revealed.