Adam Hammett
Mathematics Instructor, The Ohio State University
Ph.D. in Mathematics (Ohio State, 2007)
Curriculum Vitae
Contact Info
Recent Papers
- How often are two permutations comparable?,
with
Boris Pittel (2006, to appear, accepted by
Trans. of the AMS):
pdf version
- Meet and Join in the Weak Order Lattice,
with Boris Pittel (2006, preprint):
pdf version
- Here is a link to the current version of my dissertation,
On Comparability of Random Permutations. In it, there are
several extensions of and problems related to the above papers:
pdf version
Recent Speaking Engagements
- I spoke on an early version of the above "Trans. of the AMS"
paper at our own Ergodic
Theory and Probability Seminar quite some time ago (January, 2005);
here is the
abstract.
- My advisor,
Boris Pittel, spoke on the final version of this paper at the University of
Michigan Combinatorics Seminar (April, 2005);
here is the
abstract.
- I spoke on this same paper at our own Combinatorics Seminar on
February 22, 2006; here is the
abstract.
- I spoke on this same paper two more times, at the
AMS sectional meeting in Cincinnati, OH (October, 2006), and
once more at the
AMS national meeting in New Orleans, LA (January, 2007).
- I spoke at our Combinatorics Seminar, October 31, 2007,
about progress on my current research project (with
Boris Pittel):
properties of (uniformly) random maximal chains in weak order; here is
the abstract.
- On November 14, 2007, I spoke to the OSU
Radical Pi Undergraduate Math Club about randomized algorithms;
here is the
flyer.
Research Interests
- Probability Theory, Combinatorial Probability, Random Structures,
Analysis of Randomized Algorithms, Enumerative Combinatorics, Poset Theory
Current Research Projects
- Properties of Infs/Sups in the weak (Bruhat) order lattice
- Properties of random maximal chains in the weak order lattice
(also known as "random sorting networks")
Current Teaching Responsibilities
