Joint Mathematics Meetings Program by AMS Special Session
Current as of Saturday, January 23, 2010 00:39:30
Program 
Deadlines 
Timetable 
Inquiries: meet@ams.org
Joint Mathematics Meetings
San Francisco, CA, January 1316, 2010 (Wednesday  Saturday)
Meeting #1056
Associate secretaries:
Matthew Miller, AMS miller@math.sc.edu
Gerard A Venema, MAA venema@calvin.edu
AMS Special Session on Permutations

Saturday January 16, 2010, 8:30 a.m.10:50 a.m.
AMS Special Session on Permutations, I
Room 3006, 3rd Floor, Moscone
Organizers:
Persi Diaconis, Stanford University
Ira M. Gessel, Brandeis University gessel@brandeis.edu
Richard P. Stanley, Massachusetts Institute of Technology

8:30 a.m.
Flag descents and Ppartitions.
Ira M. Gessel*, Brandeis University
(1056051512)

9:00 a.m.
Descents and drops of permutations.
Fan Chung, UC San Diego
Anders Claesson, Reykjavik Univ.
Mark Dukes, Univ. of Iceland
Ron Graham*, UC San Diego
(1056051787)

9:30 a.m.
Eulerian quasisymmetric functions.
John Shareshian*, Washington University
Michelle L Wachs, University of Miami
(1056051607)

10:00 a.m.
Eulerian quasisymmetric functions and cyclic sieving.
Bruce Sagan, Michigan State University
John Shareshian, Washington University
Michelle L Wachs*, University of Miami
(1056051888)

10:30 a.m.
Combinatorial interpretations for $\gamma$vectors.
T. Kyle Petersen*, DePaul University
Eran Nevo, Cornell University
(105605457)

Saturday January 16, 2010, 1:00 p.m.5:50 p.m.
AMS Special Session on Permutations, II
Room 3006, 3rd Floor, Moscone
Organizers:
Persi Diaconis, Stanford University
Ira M. Gessel, Brandeis University gessel@brandeis.edu
Richard P. Stanley, Massachusetts Institute of Technology

1:00 p.m.
Permutations associated with random interval partitions.
Jim Pitman*, University of California, Berkeley
(1056051620)

1:30 p.m.
$n!$ matchings, $n!$ posets.
Anders Claesson*, The Mathematics Institute, School of Computer Science, Reykjavik University
Svante Linusson, KTHRoyal Institute of Technology
(1056051939)

2:00 p.m.
The absence of a given pattern and the number of occurrences of another.
Miklos Bona*, University of Florida
(105605932)

2:30 p.m.
Extension of the $d$divisible partition lattice.
Richard Ehrenborg*, University of Kentucky
JiYoon Jung, University of Kentucky
(1056051585)

3:00 p.m.
Bijective enumeration of permutations starting with a longest increasing subsequence.
Greta Panova*, Harvard University
(1056051077)

3:30 p.m.
From random permutations to random matrices  an alternative for RSK.
Alexei Borodin*, California Institute of Technology
(1056052152)

4:00 p.m.
Carries and shuffling.
Persi Diaconis, Stanford Univeristy
Jason Fulman*, University of Southern California
(1056051709)

4:30 p.m.
Distribution of Segment Lengths in Genome Rearrangements.
Glenn P Tesler*, University of California, San Diego
(1056052013)

5:00 p.m.
Permutation problems.
Donald E. Knuth*, Stanford University
(105605168)

5:30 p.m.
How to encipher small messages: Encryption using the Thorp shuffle.
Ben J Morris*, UC Davis
Phillip Rogaway, UC Davis
Till Stegers, UC Davis
(1056601404)
MAA Sectional Meetings
MAA National Meetings
Inquiries: meet@ams.org