
Tuesdays 12:15  1:10 PM
Millikan 211
Pomona College, Department of Mathematics
610 N. College Ave. (Corner of 6th and College Ave.)
Claremont, CA 91711
For more information contact: Gizem Karaali
email: Gizem.Karaali@pomona.edu
Our Next Speaker  Upcoming Seminars  Abstracts  Archive
Our Next Speaker  Upcoming Seminars  Abstracts
Calendar and Upcoming Seminars
 Tuesday, September 9, 2008
Organizational Meeting
 Tuesday, September 16, 2008
Julie Glass (California State University East Bay)
Interlocking Linkages
 Tuesday, September 23, 2008
Lenny Fukshansky (Claremont McKenna College)
On Siegel's lemma
 Tuesday, September 30, 2008
Ghassan Sarkis (Pomona College)
A very brief introduction to fields of norms
 Tuesday, October 7, 2008
Anna E. Bargagliotti (University of Memphis)
Inconsistencies with Nonparametric Procedures and Statistics: Combinatoric and Asymptotic Results
 Tuesday, October 14, 2008
Sam Nelson (Claremont McKenna College)
More algebraic structures from knot theory
 Tuesday, October 21, 2008
Fall Break
 Tuesday, October 28, 2008
Jonathan Lubin (Brown University)
The Applied Mathematics of the Nottingham Group
 Tuesday, November 4, 2008
Dagan Karp (Harvey Mudd College)
An introduction to GromovWitten theory
 Tuesday, November 11, 2008
Alex Hoffnung (University of California Riverside)
Groupoidification
 Tuesday, November 18, 2008
Eric Rains (Caltech)
Bounds on selfdual codes and lattices
 Tuesday, November 25, 2008
Geoffrey Buhl (Califonia State University Channel Islands)
Beyond Moonshine
 Tuesday, December 2, 2008
Michael Krebs (California State University Los Angeles)
Using Group Theory and Graph Theory to Build Fast Communications
Networks: A Brief Introduction to Expanders and Ramanujan Graphs
 Tuesday, December 9, 2008
Francis Su (Harvey Mudd College)
Minimal Triangulations of Cubes and Simplotopes
Our Next Speaker  Upcoming Seminars  Abstracts
Abstracts
 Interlocking Linkages
Julie Glass (California State University East Bay)
This talk will introduce the audience to some of the history and basic ideas used in the study of chains in the area of computational geometry. A chain is a collection of rigid bars connected at their vertices (also known as a linkage), which form a simple path (an open chain) or a simple cycle (a closed chain). A folding of a chain (or any linkage) is a certain reconfiguration obtained by moving the vertices. A collection of chains are said to be interlocked if they cannot be separated by foldings. This talk will explain some standard techniques using geometry and knot theory to address the problem of when linkages are interlocked. Finally, we will answer the question, “Can a 2chain and a kchain be interlocked?” This talk will be accessible to a broad audience.
 On Siegel's lemma
Lenny Fukshansky (Claremont McKenna College)
Siegel's lemma in its simplest form is a statement about the existence of smallsize solutions to a system of linear equations with integer coefficients: such results were originally motivated by their applications in transcendence. A modern version of this classical theorem guarantees the existence of a whole basis of small "size" for a vector space over a global field (that is number field, function field, or their algebraic closures). The role of size is played by a height function, an important tool from Diophantine geometry, which measures "arithmetic complexity" of points. For many applications it is also important to have a version of Siegel's lemma with some additional algebraic conditions placed on points in question. I will discuss the classical versions of Siegel's lemma, along with my recent results on existence of points of bounded height in a vector space outside of a finite union of varieties over a global field.
 A very brief introduction to fields of norms
Ghassan Sarkis (Pomona College)
We will present the fieldofnorms construction of Fontaine and Wintenberger, which associates certain totally ramified extensions of local fields with positivecharacteristic fields in a way that relates the Galois group of the extension to a subgroup of automorphisms of the positivecharacteristic field. Time permitting, we will discuss applications the fieldofnorms theory to padic dynamical systems.
 Inconsistencies with Nonparametric Procedures and Statistics: Combinatoric and Asymptotic Results
Anna E. Bargagliotti (University of Memphis)
Nonparametric statistical tests can be used to differentiate among alternatives. Each test is uniquely identified with a procedure that analyzes ranked data. Procedure results are then incorporated
into a test statistic. Inconsistencies among tests occur at both the
procedure level and the statistic level. In this talk, I will characterize symmetry structures of data that explain why different procedures can output different rankings when analyzing the same data. In addition, I will quantify the number of ways that two ranked data sets can be aggregated and define a strict condition data must satisfy in order to ensure consistent procedure results. Finally, I will discuss how procedure inconsistencies affect the test statistics. Using the KruskalWallis test as an example, I will outline how to asymptotically find the probability with which the null is rejected.
 More algebraic structures from knot theory
Sam Nelson (Claremont McKenna College)
Quandles are a type of nonassociative algebraic structure defined from the combinatorics of knot diagrams. In this talk will recall the basics of quandle theory and look at some generalizations of quandles including biquandles, racks and biracks. If time permits, we will also look at tangle functors and a connection to Hopf algebras.
 The Applied Mathematics of the Nottingham Group
Jonathan Lubin (Brown University)
If k is a finite field, say with p^{n} elements, then we may form the group of all formal power series u(x) ∈ k[[t]] for which u(0) = 0, u'(0) = 1, the group operation being substitution (composition). This group is often called the Nottingham group over k. It's a propgroup, i.e. the projective limit of finite pgroups, simple enough in definition, but in many ways, very mysterious in behavior. Camina has shown that every finite pgroup can be embedded in Nottingham, and Klopsch has classified all the conjugacy classes of elements of order p. They remarked a while back that they did not know of any explicitly given elements of order even as low as p^{2}. In this talk I will apply old mathematics to give a description of how to construct all elements of the Nottingham group of ppower order, and tell a classification up to conjugacy. But a characterization of the conjugacy classes that's as satisfactory as Klopsch's seems elusive.
 An introduction to GromovWitten theory
Dagan Karp (Harvey Mudd College)
In this talk I hope to give an introduction to GromovWitten theory, touching on its stringtheoretic origins, applications to enumerative geometry and through the perspective of geometric moduli.
Recent theorems and conjectures may also be discussed.
 Groupoidification
Alex Hoffnung (University of California Riverside)
"Groupoidification" attempts to take familiar structures from linear algebra and enhance them to obtain structures involving groupoids. This process is not entirely systematic, however. The reverse process, "degroupoidification", is systematic and combined with examples sheds light on how to achieve the former. We describe the latter process and some examples including the groupoidification of Hecke algebras.
 Bounds on selfdual codes and lattices
Eric Rains (Caltech)
A number of particularly interesting lowdimensional codes and lattices have the extra property of being equal to (or, for lattices, similar to) their duals; as a result, it is natural to wonder to what extent selfduality constrains the minimum distance of such a code or lattice. The first significant result in this direction was that of Mallows and Sloane, who showed that a doublyeven selfdual binary code of length n has minimum distance at most 4⌊n/24⌋+4, and with Odlyzko, obtained an analogous result for lattices. Without the extra evenness assumption, they obtained a much weaker bound; in fact, as I will show, this gap between singlyeven and doublyeven codes is illusory: the bound 4⌊n/24⌋+4 holds for essentially all selfdual binary codes. For asymptotic bounds, the best result for doublyeven binary codes is that of Krasikov and Litsyn, who showed d≤Dn+o(n); where D = (15^{1/4})/2 ∼ 0.165629. I'll discuss a different proof of their bound, applicable to other types of codes and lattices, in particular showing that for any positive constant c, there are only finitely many selfdual binary codes satisfying d≥Dnc√n.
 Beyond Moonshine
Geoffrey Buhl (Califonia State University Channel Islands)
Mathematically, "Moonshine" refers to the unexpected relationship between the largest sporadic simple group, the Monster, and the modular function, j. One of the products of the study and proof of the Moonshine conjectures are new algebraic objects called vertex operator algebras. Surprisingly, these objects are exactly the so called chiral algebras of string theory. For certain vertex operator algebras, there is an associated modular function, generalizing one aspect of the moonshine conjectures. In this talk I will describe the moonshine conjectures, give a definition of vertex operator algebras, and describe which vertex operator algebras have modularity properties.
 Using Group Theory and Graph Theory to Build Fast Communications
Networks: A Brief Introduction to Expanders and Ramanujan Graphs
Michael Krebs (California State University Los Angeles)
Think of a graph as a communications network. Putting in edges (e.g., fiber optic cables, telephone lines) is expensive, so we wish to limit the number of edges in the graph. At the same time, we would like messages in the graph to spread as rapidly as possible. We will see that the speed of communication is closely related to the eigenvalues of the graph's adjacency matrix. Essentially, the smaller the eigenvalues are, the faster messages spread. It turns out that there is a bound, due to Serre and others, on how small the eigenvalues can be. This gives us a rough sense of what it means for graphs to represent "optimal" communications networks; we call these Ramanujan graphs. Families of kregular Ramanujan graphs have been constructed in this manner by Sarnak and others whenever k minus one equals a power of a prime number. No one knows whether families of kregular Ramanujan graphs exist for all k.
 Minimal Triangulations of Cubes and Simplotopes
Francis Su (Harvey Mudd College)
In this talk, I will describe recent progress on the question of determining the smallest triangulation of a ddimensional cube, and more generally, the smallest triangulation of a simplotope: the product of simplices. Some interesting combinatorial insights come out of the geometry.
Our Next Speaker  Upcoming Seminars  Abstracts
Archive
