Open Access. Powered by Scholars. Published by Universities.®

Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

All HMC Faculty Publications and Research

Discipline
Keyword
Publication Year

Articles 61 - 90 of 352

Full-Text Articles in Mathematics

"Toward Integration: From Quantitative Biology To Mathbio-Biomath?", Pat Marsteller, Lisette G. De Pillis, Ann Findley, Karl Joplin, John Pelesko, Karen Nelson, Katerina Thompson, David Usher, Joseph Watkins Oct 2010

"Toward Integration: From Quantitative Biology To Mathbio-Biomath?", Pat Marsteller, Lisette G. De Pillis, Ann Findley, Karl Joplin, John Pelesko, Karen Nelson, Katerina Thompson, David Usher, Joseph Watkins

All HMC Faculty Publications and Research

In response to the call of BIO2010 for integrating quantitative skills into undergraduate biology education, 30 Howard Hughes Medical Institute (HHMI) Program Directors at the 2006 HHMI Program Directors Meeting established a consortium to investigate, implement, develop, and disseminate best practices resulting from the integration of math and biology. With the assistance of an HHMI-funded mini-grant, led by Karl Joplin of East Tennessee State University, and support in institutional HHMI grants at Emory and University of Delaware, these institutions held a series of summer institutes and workshops to document progress toward and address the challenges of implementing a more quantitative …


Existence Of Solutions For A Semilinear Wave Equation With Non-Monotone Nonlinearity, Alfonso Castro, Benjamin Preskill '09 Oct 2010

Existence Of Solutions For A Semilinear Wave Equation With Non-Monotone Nonlinearity, Alfonso Castro, Benjamin Preskill '09

All HMC Faculty Publications and Research

For double-periodic and Dirichlet-periodic boundary conditions, we prove the existence of solutions to a forced semilinear wave equation with asymptotically linear nonlinearity, no resonance, and non-monotone nonlinearity when the forcing term is not flat on characteristics. The solutions are in L when the forcing term is in L and continous when the forcing term is continuous. This is in contrast with the results in [4], where the non-enxistence of continuous solutions is established even when forcing term is of class C but is flat on a characteristic.


Combinatorial Trigonometry With Chebyshev Polynomials, Arthur T. Benjamin, Larry Ericksen, Pallavi Jayawant, Mark Shattuck Aug 2010

Combinatorial Trigonometry With Chebyshev Polynomials, Arthur T. Benjamin, Larry Ericksen, Pallavi Jayawant, Mark Shattuck

All HMC Faculty Publications and Research

We provide a combinatorial proof of the trigonometric identity cos(nθ) = Tncos(θ),
where Tn is the Chebyshev polynomial of the first kind. We also provide combinatorial proofs of other trigonometric identities, including those involving Chebyshev polynomials of the second kind.


Combinatorially Composing Chebyshev Polynomials, Arthur T. Benjamin, Daniel Walton '07 Aug 2010

Combinatorially Composing Chebyshev Polynomials, Arthur T. Benjamin, Daniel Walton '07

All HMC Faculty Publications and Research

We present a combinatorial proof of two fundamental composition identities associated with Chebyshev polynomials. Namely, for all m, n ≥ 0, Tm(Tn(x)) = Tmn(x) and Um-1 (Tn(x))Un-1(x) = Umn-1(x).


Recognizing Graph Theoretic Properties With Polynomial Ideals, Jesus A. De Loera, Christopher J. Hillar, Peter N. Malkin, Mohamed Omar Jan 2010

Recognizing Graph Theoretic Properties With Polynomial Ideals, Jesus A. De Loera, Christopher J. Hillar, Peter N. Malkin, Mohamed Omar

All HMC Faculty Publications and Research

Many hard combinatorial problems can be modeled by a system of polynomial equations. N. Alon coined the term polynomial method to describe the use of nonlinear polynomials when solving combinatorial problems. We continue the exploration of the polynomial method and show how the algorithmic theory of polynomial ideals can be used to detect k-colorability, unique Hamiltonicity, and automorphism rigidity of graphs. Our techniques are diverse and involve Nullstellensatz certificates, linear algebra over finite fields, Gröbner bases, toric algebra, convex programming, and real algebraic geometry.


Mathematical Biology At An Undergraduate Liberal Arts College, Stephen C. Adolph, Lisette G. De Pillis Jan 2010

Mathematical Biology At An Undergraduate Liberal Arts College, Stephen C. Adolph, Lisette G. De Pillis

All HMC Faculty Publications and Research

Since 2002 we have offered an undergraduate major in Mathematical Biology at Harvey Mudd College. The major was developed and is administered jointly by the mathematics and biology faculty. In this paper we describe the major, courses, and faculty and student research and discuss some of the challenges and opportunities we have experienced.


Stability And Dynamics Of Self-Similarity In Evolution Equations, Andrew J. Bernoff, Thomas P. Witelski Jan 2010

Stability And Dynamics Of Self-Similarity In Evolution Equations, Andrew J. Bernoff, Thomas P. Witelski

All HMC Faculty Publications and Research

A methodology for studying the linear stability of self-similar solutions is discussed. These fundamental ideas are illustrated on three prototype problems: a simple ODE with finite-time blow-up, a second-order semi-linear heat equation with infinite-time spreading solutions, and the fourth-order Sivashinsky equation with finite-time self-similar blow-up. These examples are used to show that self-similar dynamics can be studied using many of the ideas arising in the study of dynamical systems. In particular, the use of dimensional analysis to derive scaling invariant similarity variables is discussed, as well as the role of symmetries in the context of stability of self-similar dynamics. The …


Two-Player Envy-Free Multi-Cake Division, John Cloutier '03, Kathryn L. Nyman, Francis E. Su Jan 2010

Two-Player Envy-Free Multi-Cake Division, John Cloutier '03, Kathryn L. Nyman, Francis E. Su

All HMC Faculty Publications and Research

We introduce a generalized cake-cutting problem in which we seek to divide multiple cakes so that two players may get their most-preferred piece selections: a choice of one piece from each cake, allowing for the possibility of linked preferences over the cakes. For two players, we show that disjoint envy-free piece selections may not exist for two cakes cut into two pieces each, and they may not exist for three cakes cut into three pieces each. However, there do exist such divisions for two cakes cut into three pieces each, and for three cakes cut into four pieces each. The …


Local Versus Global Search In Channel Graphs, A.H. Hunter, Nicholas Pippenger Jan 2010

Local Versus Global Search In Channel Graphs, A.H. Hunter, Nicholas Pippenger

All HMC Faculty Publications and Research

Previous studies of search in channel graphs has assumed that the search is global; that is, that the status of any link can be probed by the search algorithm at any time. We consider for the first time local search, for which only links to which an idle path from the source has already been established may be probed. We show that some well known channel graphs may require exponentially more probes, on the average, when search must be local than when it may be global.


Voting In Agreeable Societies, Deborah E. Berg '06, Serguei Norine, Francis E. Su, Robin Thomas, Paul Wollan Jan 2010

Voting In Agreeable Societies, Deborah E. Berg '06, Serguei Norine, Francis E. Su, Robin Thomas, Paul Wollan

All HMC Faculty Publications and Research

No abstract provided in this article.


Voting, The Symmetric Group, And Representation Theory, Zajj Daugherty '05, Alexander K. Eustis '06, Gregory Minton '08, Michael E. Orrison Dec 2009

Voting, The Symmetric Group, And Representation Theory, Zajj Daugherty '05, Alexander K. Eustis '06, Gregory Minton '08, Michael E. Orrison

All HMC Faculty Publications and Research

We show how voting may be viewed naturally from an algebraic perspective by viewing voting profiles as elements of certain well-studied QSn-modules. By using only a handful of simple combinatorial objects (e.g., tabloids) and some basic ideas from representation theory (e.g., Schur's Lemma), this allows us to recast and extend some well-known results in the field of voting theory.


A Preliminary Mathematical Model Of Skin Dendritic Cell Trafficking And Induction Of T Cell Immunity, Amy H. Lin Erickson, Alison Wise, Stephen Fleming, Margaret Baird, Zabeen Lateef, Annette Molinaro, Miranda Teboh-Ewungkem, Lisette G. De Pillis Sep 2009

A Preliminary Mathematical Model Of Skin Dendritic Cell Trafficking And Induction Of T Cell Immunity, Amy H. Lin Erickson, Alison Wise, Stephen Fleming, Margaret Baird, Zabeen Lateef, Annette Molinaro, Miranda Teboh-Ewungkem, Lisette G. De Pillis

All HMC Faculty Publications and Research

Chronic inflammation is a process where dendritic cells (DCs) are constantly sampling antigen in the skin and migrating to lymph nodes where they induce the activation and proliferation of T cells. The T cells then travel back to the skin where they release cytokines that induce/maintain the inflammatory condition. This process is cyclic and ongoing. We created a differential equations model to reflect the initial stages of the inflammatory process. In particular, we modeled antigen stimulation of DCs in the skin, movement of DCs from the skin to a lymph node, and the subsequent activation of T cells in the …


Compression Theorems For Periodic Tilings And Consequences, Arthur T. Benjamin, Alex K. Eustis '06, Mark A. Shattuck Aug 2009

Compression Theorems For Periodic Tilings And Consequences, Arthur T. Benjamin, Alex K. Eustis '06, Mark A. Shattuck

All HMC Faculty Publications and Research

We consider a weighted square-and-domino tiling model obtained by assigning real number weights to the cells and boundaries of an n-board. An important special case apparently arises when these weights form periodic sequences. When the weights of an nm-tiling form sequences having period m, it is shown that such a tiling may be regarded as a meta-tiling of length n whose weights have period 1 except for the first cell (i.e., are constant). We term such a contraction of the period in going from the longer to the shorter tiling as "period compression". It turns out that …


Asymptotic Dynamics Of Attractive-Repulsive Swarms, Andrew J. Leverentz '08, Chad M. Topaz, Andrew J. Bernoff Jul 2009

Asymptotic Dynamics Of Attractive-Repulsive Swarms, Andrew J. Leverentz '08, Chad M. Topaz, Andrew J. Bernoff

All HMC Faculty Publications and Research

We classify and predict the asymptotic dynamics of a class of swarming models. The model consists of a conservation equation in one dimension describing the movement of a population density field. The velocity is found by convolving the density with a kernel describing attractive-repulsive social interactions. The kernel’s first moment and its limiting behavior at the origin determine whether the population asymptotically spreads, contracts, or reaches steady state. For the spreading case, the dynamics approach those of the porous medium equation. The widening, compactly supported population has edges that behave like traveling waves whose speed, density, and slope we calculate. …


A Semilinear Wave Equation With Smooth Data And No Resonance Having No Continuous Solution, Jose F. Caicedo, Alfonso Castro Jul 2009

A Semilinear Wave Equation With Smooth Data And No Resonance Having No Continuous Solution, Jose F. Caicedo, Alfonso Castro

All HMC Faculty Publications and Research

We prove that a boundary value problem for a semilinear wave equation with smooth nonlinearity, smooth forcing, and no resonance cannot have continuous solutions. Our proof shows that this is due to the non-monotonicity of the nonlinearity.


Counting On Chebyshev Polynomials, Arthur T. Benjamin, Daniel Walton '07 Apr 2009

Counting On Chebyshev Polynomials, Arthur T. Benjamin, Daniel Walton '07

All HMC Faculty Publications and Research

Chebyshev polynomials have several elegant combinatorial interpretations. Specificially, the Chebyshev polynomials of the first kind are defined by T0(x) = 1, T1(x) = x, and Tn(x) = 2x Tn-1(x) - Tn-2(x). Chebyshev polynomials of the second kind Un(x) are defined the same way, except U1(x) = 2x. Tn and Un are shown to count tilings of length n strips with squares and dominoes, where the tiles are given weights and sometimes color. Using these interpretations, many identities satisfied by Chebyshev polynomials can be given …


Mathematical Model Creation For Cancer Chemo-Immunotherapy, Lisette G. De Pillis, K Renee Fister, Weiqing Gu, Craig Collins, Michael Daub, David Gross '08, James Moore '07, Benjamin Preskill '09 Jan 2009

Mathematical Model Creation For Cancer Chemo-Immunotherapy, Lisette G. De Pillis, K Renee Fister, Weiqing Gu, Craig Collins, Michael Daub, David Gross '08, James Moore '07, Benjamin Preskill '09

All HMC Faculty Publications and Research

One of the most challenging tasks in constructing a mathematical model of cancer treatment is the calculation of biological parameters from empirical data. This task becomes increasingly difficult if a model involves several cell populations and treatment modalities. A sophisticated model constructed by de Pillis et al., Mixed immunotherapy and chemotherapy of tumours: Modelling, applications and biological interpretations, J. Theor. Biol. 238 (2006), pp. 841–862; involves tumour cells, specific and non-specific immune cells (natural killer (NK) cells, CD8 T cells and other lymphocytes) and employs chemotherapy and two types of immunotherapy (IL-2 supplementation and CD8 T-cell infusion) as treatment modalities. …


Mathematics In The Mountains: The Park City Mathematics Institute, Andrew J. Bernoff Nov 2008

Mathematics In The Mountains: The Park City Mathematics Institute, Andrew J. Bernoff

All HMC Faculty Publications and Research

It's noon. A Fields medalist, master high school teachers from the US and abroad, aspiring undergraduate and graduate students, gifted expositors of mathematics, and mathematical artists gather at tables under a tent. Lunch and so much more is served at these meetings of the minds.


Tiling Proofs Of Recent Sum Identities Involving Pell Numbers, Arthur T. Benjamin, Sean S. Plott '08, James A. Sellers Oct 2008

Tiling Proofs Of Recent Sum Identities Involving Pell Numbers, Arthur T. Benjamin, Sean S. Plott '08, James A. Sellers

All HMC Faculty Publications and Research

In a recent note, Santana and Diaz-Barrero proved a number of sum identities involving the well-known Pell numbers. Their proofs relied heavily on the Binet formula for the Pell numbers. Our goal in this note is to reconsider these identities from a purely combinatorial viewpoint. We provide bijective proofs for each of the results by interpreting the Pell numbers as enumerators of certain types of tilings. In turn, our proofs provide helpful insight for straightforward generalizations of a number of the identities.


Borda Meets Pascal, Marie K. Jameson, Gregory Minton '08, Michael E. Orrison Sep 2008

Borda Meets Pascal, Marie K. Jameson, Gregory Minton '08, Michael E. Orrison

All HMC Faculty Publications and Research

Every so often (especially in mathematics), unforeseen connections between different ideas arise and beg explanation. This happened to us when, in an effort to generalize the voting procedure known as the Borda count, we began to see vectors of the form (-1, 1), (1, -2, 1), (-1, 3, -3, 1), (1, -4, 6, -4, 1), and so on. As you might imagine, we were instantly intrigued by this unanticipated relationship with Pascal's triangle, and we quickly set out to find an explanation. This article describes some of our initial findings.


Imagine Math Day: Encouraging Secondary School Students And Teachers To Engage In Authentic Mathematical Discovery, Darryl H. Yong, Michael E. Orrison Jr. Aug 2008

Imagine Math Day: Encouraging Secondary School Students And Teachers To Engage In Authentic Mathematical Discovery, Darryl H. Yong, Michael E. Orrison Jr.

All HMC Faculty Publications and Research

Research mathematicians and school children experience mathematics in profoundly different ways. Ask a group of mathematicians what it means to “do mathematics” and you are likely to get a myriad of responses: mathematics involves analyzing and organizing patterns and relationships, reasoning and drawing conclusions about the world, or creating languages and tools to describe and solve important problems. Students of mathematics often report “doing mathematics” as performing calculations or following rules. It’s natural that they see mathematics as monolithic rather than an evolving, growing, socially constructed body of knowledge, because most mathematical training in primary and secondary schools consists of …


An Alternate Approach To Alternating Sums: A Method To Die For, Arthur T. Benjamin, Jennifer J. Quinn May 2008

An Alternate Approach To Alternating Sums: A Method To Die For, Arthur T. Benjamin, Jennifer J. Quinn

All HMC Faculty Publications and Research

No abstract provided in this article.


Traveling Waves And Shocks In A Viscoelastic Generalization Of Burgers' Equation, Victor Camacho '07, Robert D. Guy, Jon T. Jacobsen Apr 2008

Traveling Waves And Shocks In A Viscoelastic Generalization Of Burgers' Equation, Victor Camacho '07, Robert D. Guy, Jon T. Jacobsen

All HMC Faculty Publications and Research

We consider traveling wave phenomena for a viscoelastic generalization of Burgers' equation. For asymptotically constant velocity profiles we find three classes of solutions corresponding to smooth traveling waves, piecewise smooth waves, and piecewise constant (shock) solutions. Each solution type is possible for a given pair of asymptotic limits, and we characterize the dynamics in terms of the relaxation time and viscosity.


The Shapley Value Of Phylogenetic Trees, Claus-Jochen Haake, Akemi Kashiwada '05, Francis E. Su Apr 2008

The Shapley Value Of Phylogenetic Trees, Claus-Jochen Haake, Akemi Kashiwada '05, Francis E. Su

All HMC Faculty Publications and Research

Every weighted tree corresponds naturally to a cooperative game that we call a tree game; it assigns to each subset of leaves the sum of the weights of the minimal subtree spanned by those leaves. In the context of phylogenetic trees, the leaves are species and this assignment captures the diversity present in the coalition of species considered. We consider the Shapley value of tree games and suggest a biological interpretation. We determine the linear transformation M that shows the dependence of the Shapley value on the edge weights of the tree, and we also compute a null space …


The 99th Fibonacci Identity, Arthur T. Benjamin, Alex K. Eustis '06, Sean S. Plott '08 Feb 2008

The 99th Fibonacci Identity, Arthur T. Benjamin, Alex K. Eustis '06, Sean S. Plott '08

All HMC Faculty Publications and Research

We provide elementary combinatorial proofs of several Fibonacci and Lucas number identities left open in the book Proofs That Really Count [1], and generalize these to Gibonacci sequences Gn that satisfy the Fibonacci recurrence, but with arbitrary real initial conditions. We offer several new identities as well.

[1] A. T. Benjamin and J. J. Quinn, Proofs That Really Count: The Art of Combinatorial Proof, The Dolciani Mathematical Expositions, 27, Mathematical Association of America, Washington, DC, 2003


A Combinatorial Approach To Fibonomial Coefficients, Arthur T. Benjamin, Sean S. Plott '08 Feb 2008

A Combinatorial Approach To Fibonomial Coefficients, Arthur T. Benjamin, Sean S. Plott '08

All HMC Faculty Publications and Research

A combinatorial argument is used to explain the integrality of Fibonomial coefficients and their generalizations. The numerator of the Fibonomial coeffcient counts tilings of staggered lengths, which can be decomposed into a sum of integers, such that each integer is a multiple of the denominator of the Fibonomial coeffcient. By colorizing this argument, we can extend this result from Fibonacci numbers to arbitrary Lucas sequences.


Paint It Black -- A Combinatorial Yawp, Arthur T. Benjamin, Jennifer J. Quinn, James A. Sellers, Mark A. Shattuck Feb 2008

Paint It Black -- A Combinatorial Yawp, Arthur T. Benjamin, Jennifer J. Quinn, James A. Sellers, Mark A. Shattuck

All HMC Faculty Publications and Research

No abstract provided in this paper.


Distribution Of The Number Of Encryptions In Revocation Schemes For Stateless Receivers, Christopher Eagle, Zhicheng Gao, Mohamed Omar, Daniel Panario, Bruce Richmond Jan 2008

Distribution Of The Number Of Encryptions In Revocation Schemes For Stateless Receivers, Christopher Eagle, Zhicheng Gao, Mohamed Omar, Daniel Panario, Bruce Richmond

All HMC Faculty Publications and Research

We study the number of encryptions necessary to revoke a set of users in the complete subtree scheme (CST) and the subset-difference scheme (SD). These are well-known tree based broadcast encryption schemes. Park and Blake in: Journal of Discrete Algorithms, vol. 4, 2006, pp. 215--238, give the mean number of encryptions for these schemes. We continue their analysis and show that the limiting distribution of the number of encryptions for these schemes is normal. This implies that the mean numbers of Park and Blake are good estimates for the number of necessary encryptions used by these schemes.


Mathematics Of Voting, Darryl H. Yong Jan 2008

Mathematics Of Voting, Darryl H. Yong

All HMC Faculty Publications and Research

Voting theory is a fascinating area of research involving mathematics, political scientists, and economists. The American Mathematical Society, the American Statistical Association, the Mathematical Association of America, and the Society for Industrial and Applied Mathematics chose mathematics and voting as the theme for Mathematics Awareness Month 2008. There is more information on mathematics and voting at www.mathaware.org/mam/08/. It is a mathematical topic that is rich yet accessible to students, pertinent to their lives, especially during this election year, and has the potential to draw students who may not have a strong affinity for mathematics to become interested in mathematics.


A Model For Rolling Swarms Of Locusts, Chad M. Topaz, Andrew J. Bernoff, Sheldon Logan '06, Wyatt Toolson '07 Jan 2008

A Model For Rolling Swarms Of Locusts, Chad M. Topaz, Andrew J. Bernoff, Sheldon Logan '06, Wyatt Toolson '07

All HMC Faculty Publications and Research

We construct an individual-based kinematic model of rolling migratory locust swarms. The model incorporates social interactions, gravity, wind, and the effect of the impenetrable boundary formed by the ground. We study the model using numerical simulations and tools from statistical mechanics, namely the notion of H-stability. For a free-space swarm (no wind and gravity), as the number of locusts increases, the group approaches a crystalline lattice of fixed density if it is H-stable, and in contrast becomes ever denser if it is catastrophic. Numerical simulations suggest that whether or not a swarm rolls depends on the statistical mechanical properties of …