Jump to: directions and parking | carpools and public transport | registration | speakers and schedule | food | organizers / questions?

The Seventeenth Bay Area Discrete Math Day (BADMath Day), sponsored by D.E. Shaw & Co., will take place at Stanford University on Saturday, September 27, 2008 between 10:00 AM and 5:00 PM.

** We will meet in Bldg. 370, Rm. 370, which is on the main quad.
A link to a campus map can be found here.**

BADMath Days are
one-day meetings aimed at facilitating communication between
researchers and graduate students of discrete mathematics around the
San Francisco Bay Area. These days happen twice a year and strive to
create an informal atmosphere to talk about discrete mathematics. The
term "discrete mathematics" is chosen to include at least the
following topics: Algebraic and Enumerative Combinatorics, Additive Combinatorics, Discrete
Geometry, Graph Theory, Coding and Design Theory, Combinatorial
Aspects of Computational Algebra and Geometry, Combinatorial
Optimization, Probabilistic Combinatorics, Combinatorial Aspects of
Statistics, and Combinatorics in
Mathematical Physics.

We will have more carpool information soon, but if you are interested in carpooling, for the moment contact your local organizer. We'd especially love volunteers to drive!

If you prefer to take public transportation, Caltrain conveniently stops at the edge of Stanford's campus (the downtown Palo Alto stop.) From this stop, it is about a 10- to 15-minute walk to the math building: just walk southwest on University/Palm through campus. There is a Caltrain leaving San Francisco at 8:00 and arriving at PA at 9:02 AM. From the East Bay, there is no good option since the Dumbarton Express (a bus from the Fremont BART) does not run on weekends. We recommend driving, but if this is completely out of the question, BART to Millbrae to pick up the Caltrain is theoretically possible.

- 9:00 - 10:00am Welcome and refreshments
- 10:00 - 11:00am Eric Babson, University of California, Davis
- 11:15 - 11:45am Brendon Rhoades, University of California, Berkeley
- 12:00 - 12:30pm Chris Peterson, Colorado State University
- 12:30 - 2:00pm Lunch: provided on-site
- 2:00 - 2:30pm Brant Jones, University of California, Davis
- 2:45 - 3:15pm Glenn Appleby, University of Santa Clara
- 3:15 - 4:00pm Coffee and tea
- 4:00 - 5:00pm Ben Green, University of Cambridge
- 6:00 - 8:00pm Dinner in Palo Alto (at Ming's in Palo Alto)

Eric Babson: *Graph homomorphisms*

The talk will focus on homomorphisms between graphs. There are three basic questions which have been addressed here and they have been studied with a variety of techniques. First are questions relating structural facts about the homomorphisms into one graph to the existence of homomorphisms into another. The structural facts which have been studied include topological, metric and measure theoretic ones and the upshot has been a lower bound on chromatic number. It is notable that the different methods have produced very similar, but different, results. Second is the question of the complexity of testing for the existence of a map. For this question there has been work relating these complexities to the same question for related structures. One resulting theorem is that for graphs the problem of testing for a map into a fixed graph is always either np complete or polynomial time. Third is the question of counting the maps between two graphs. This is closely related to the generalized birthday problem and has been studied via linear algebraic and statistical methods. One theorem here characterizes the possible functions counting maps from graphs into a fixed target graph.

Brendon Rhoades: *Fixed Point Enumeration and Ribbon Operators*

Using plethystic operators of Lascoux, Leclerc, and Thibon, we answer a question of Reiner, Stanton, and White regarding fixed point enumeration for the action of cyclic row and column rotation on certain finite sets of matrices. Our fixed point results are stated using the bicyclic sieving phenomenon, defined in a 2008 paper of Barcelo, Reiner, and Stanton. Using similar methods, we also obtain a module isomorphism due to Morita and Nakajima.

Chris Peterson: * Inexact methods for exact results*

In this talk I hope to illustrate, in very concrete terms, the essence (and utility) of generic points on algebraic varieties. The connection to Discrete Mathematics is through a warm-up example using continued fractions and a more souped up version using "lattice basis reduction". A very brief reference to aliens will also be included.

Brant Jones: *Pattern avoidance enumeration and heaps of pieces*

Several disparate phenomena have been characterized by permutation pattern avoidance including: stack sortability in computer science, geometric information about Schubert varieties, and properties of the set of reduced words of a permutation. In this talk, we will discuss an approach for enumerating certain classes of pattern-avoiding permutations using partial orders called heaps that have been introduced by Viennot and Stembridge. This is joint work with Hugh Denoncourt.

Glenn Appleby: *Invariants of Matrix Pairs over Discrete Valuation Rings and Littlewood-Richardson Fillings*

Suppose $\mu$ is the partition of (orders of) the invariant factors of an $n \times n$ matrix $M$ over a discrete valuation $R$ of characteristic zero. Suppose $\nu$ is the partition associated to $N$ and $\lambda$ the partition for the product $MN$. It is known in this case that the Littlewood-Richardson coefficient $c_{\mu \nu}^{\lambda}$ is non-zero, and that this coefficient can be enumerated combinatorially by Littlewood-Richardson fillings of the skew-shape $\lambda / \mu$ with content $\nu$. Recent work shows that these combinatorially defined fillings actually form natural matrix invariants. In fact, we can find matrix realizations that interpret such fillings (so that, for instance, each orbit of a matrix pair under a natural group action determines a unique filling), as well as bijections between fillings (that establish the equality $c_{\mu \nu}^{\lambda} = c_{\nu \mu}^{\lambda}$ and also other combinatorially defined procedures defining and calculating Littlewood-Richardson coefficients. The determinantal formulas we obtain for these combinatorial objects suggest other generalizations of Littlewood-Richardson-like phenomena.

Ben Green: *Some themes in Additive Combinatorics*

I will introduce some of the main themes in additive combinatorics. Specifically, I will introduce the Gowers norms and the "inverse conjectures" concerning them, as well as the circle of questions surrounding Freiman's theorem on the structure of sets with small doubling.

The BADMath Committee:

- Federico Ardila, San Francisco State University
- Ruchira Datta, University of California, Berkeley
- Mike Develin, D.E. Shaw & Co.
- Tim Hsu, San Jose State University
- Matt Kahle, Stanford University
- Fu Liu, University of California, Davis
- Carol Meyers, Lawrence Livermore National Laboratory
- Rick Scott, University of Santa Clara
- Ellen Veomett, California State University, East Bay
- Nick Weininger, Google