left-arrowleft-arrowright-arrowleft-arrowAsset 9
Logo
'

Events Search and Views Navigation

Event Views Navigation

Today

Applied Math Talk: Robust Estimators for Monte Carlo data given by Prof. Mark Huber (CMC)

Emmy Noether Room, Millikan 1021, Pomona College 610 N. College Ave., Claremont, California

Data coming from Monte Carlo experiments is often analyzed in the same way as data from more traditional sources.  The unique nature of Monte Carlo data, where it is easy to take a random number of samples, allows for estimators where the user can control the relative error of the estimate much more precisely than […]

Quandle module quivers (Sam Nelson, CMC)

Emmy Noether Room, Millikan 1021, Pomona College 610 N. College Ave., Claremont, California

Quandle coloring quivers categorify the quandle counting invariant. In this talk we enhance the quandle coloring quiver invariant with quandle modules, generalizing both the quiver invariant and the quandle module polynomial invariant. This is joint work with Karma Istanbouli (Scripps College).

Applications of Markov Chains to Swarm Robotics and Political Redistricting

Freeberg Forum, LC 62, Kravis Center, CMC

What do swarm robotics and political redistricting have in common? One answer is Markov chains, which have recently been used in very different ways to address problems in both these areas. To get a large swarm to exhibit a desired behavior, one solution is to make each individual in the swarm fairly intelligent; another is […]

Applied Math Talk: Information Theory, Archetypal Analysis and MT Flu given by Professor Emily Stone (University of Montana-Missoula)

Emmy Noether Room, Millikan 1021, Pomona College 610 N. College Ave., Claremont, California

In this talk I will discuss a rather unique collection of tools and how they have been used to understand the spread of Influenza virus in the State of Montana.  With flu counts from each county over a 10 year period some patterns emerge, which explain some vectors of the disease spread.  Archetypal analysis then […]

On badly approximable numbers (Nikolai Moshchevitin, Moscow State University)

Emmy Noether Room, Millikan 1021, Pomona College 610 N. College Ave., Claremont, California

It is well known that a real number is badly approximable if and only if the partial quotients in its continued fraction expansion are bounded. Motivated by a recent wonderful paper by Ngoc Ai Van Nguyen, Anthony Poels and Damien Roy (where the authors give a simple alternative solution of Schmidt-Summerer's problem) we found an […]

Ken Millett (UCSB)

Millikan 2099, Pomona College 610 N. College Ave., Claremont, CA, United States

Gordian Knots According to the legend of Phrygian Gordium, Alexander the Great cut the ``Gordian Knot’’ and eventually went on to rule Asia thereby fulfilling an ancient prophecy.  Where there are several descriptions of the precise nature of the Gordian Knot and Alexander’s action, an explicit mathematical treatment (the theory of thick knots) and the reasons […]

Kenneth Millett (University of California, Santa Barbara)

Millikan 2099, Pomona College 610 N. College Ave., Claremont, CA, United States

Gordian Knots According to the legend of Phrygian Gordium, Alexander the Great cut the ``Gordian Knot’’ and eventually went on to rule Asia thereby fulfilling an ancient prophecy.  Where there are several descriptions of the precise nature of the Gordian Knot and Alexander’s action, an explicit mathematical treatment (the theory of thick knots) and the reasons […]

Nano Knot theory, methods to study tiny knot in nature

Freeberg Forum, LC 62, Kravis Center, CMC

Knotting in living organisms is a feature that is visible to the careful observer of biological life.  Since the 1970’s, with the increasing power of electron microscopes, scientists have been able to capture images of such structures in living organisms at near atomic levels.  We will explore the mathematics of knotting that has provided tools study these […]

Discrepancy theory and related questions (Dmitriy Bilyk, University of Minnesota)

Millikan 2099, Pomona College 610 N. College Ave., Claremont, CA, United States

The talk will concentrate on open questions related to the optimal bounds for the discrepancy of an $N$-point set in the $d$-dimensional unit cube. The so-called star-discrepancy measures the difference between the actual and expected number of points in axis-parallel rectangles, and thus measures the equidistribution of the set. This notion has been explored by H. Weyl, K. Roth, and many others, […]

Energy optimization on the sphere

Freeberg Forum, LC 62, Kravis Center, CMC

Many problems, arising in discrete and metric geometry, signal processing, physics, etc, can be reformulated as questions of optimizing discrete or continuous measures. We shall review some of such conjectures, as well as approaches to determining optimal (or at least good) point distributions and measures, and connections to other problems, such as discrepancy, sphere packings […]

Applied Math Talk: Approaches to modeling dispersal and swarm behavior at multiple scales given by Prof. Christopher Strickland ( The University of Tennessee, Knoxville)

Emmy Noether Room, Millikan 1021, Pomona College 610 N. College Ave., Claremont, California

Biological invasions often have outsized consequences for the invaded ecosystem and represent an interesting challenge to model mathematically. Landscape heterogeneity, non-local or time-dependent spreading mechanisms, coarse data, and air or water flow transport are but a few of the complications that can greatly affect our understanding of small organism movement – a critical component of […]

Graph coloring reconfiguration systems (Prateek Bhakta, University of Richmond)

Emmy Noether Room, Millikan 1021, Pomona College 610 N. College Ave., Claremont, California

For k >= 2, the k-coloring graph C(G) of a base graph G has a vertex set consisting of the proper k-colorings of G with edges connecting two vertices corresponding to two different colorings of G if those two colorings differ in the color assigned to a single vertex of G. A base graph whose […]