Joint Mathematics Meetings AMS Special Session

Current as of Friday, January 18, 2013 00:31:56

Joint Mathematics Meetings
San Diego Convention Center and San Diego Marriott Hotel and Marina, San Diego, CA
January 9-12, 2013 (Wednesday - Saturday)
Meeting #1086

Associate secretaries:

Georgia Benkart, AMS benkart@math.wisc.edu
Gerard A Venema, MAA venema@calvin.edu

• Saturday January 12, 2013, 8:00 a.m.-10:50 a.m.
  AMS Special Session on Patterns in Permutations and Words, I
  Room 14B, Mezzanine Level, San Diego Convention Center
  Organizers:
  Jeffrey Liese, California State Polytechnic University, San Luis Obispo
  Brian K. Miceli, Trinity University bmiceli@trinity.edu
  Jeffrey Remmel, University of California, San Diego
  

  • 8:00 a.m.
    The most and the least avoided consecutive patterns.
    Sergi Elizalde*, Dartmouth College
    (1086-05-541)
  • 8:30 a.m.
    Upper bounds for the Stanley-Wilf limit of 1324.
    Anders Claesson*, Department of Computer and Information Sciences, University of Strathclyde
    Vít Jelínek, Computer Science Institute, Charles University
    Einar Steingrímsson, Department of Computer and Information Sciences, University of Strathclyde
    (1086-05-2049)
  • 9:00 a.m.
    New upper bounds for permutations avoiding 1324 and other extremal patterns.
    Miklos Bona*, University of Florida
    (1086-05-991)
  • 9:30 a.m.
    The Permutation Poset, its Möbius Function and Topology.
    Einar Steingrimsson*, University of Strathclyde
    (1086-05-2040)
  • 10:00 a.m.
    Subclasses of the separable permutations.
    M. D. Atkinson, University of Otago
    Michael H. Albert, University of Otago
    Vincent Vatter*, University of Florida
    (1086-05-1930)
  • 10:30 a.m.
    Recent Progress on the Shuffle Conjecture.
    Adriano M. Garsia*, University of California San Diego
    (1086-05-1455)
• Saturday January 12, 2013, 1:00 p.m.-5:50 p.m.
  AMS Special Session on Patterns in Permutations and Words, II
  Room 14B, Mezzanine Level, San Diego Convention Center
  Organizers:
  Jeffrey Liese, California State Polytechnic University, San Luis Obispo
  Brian K. Miceli, Trinity University bmiceli@trinity.edu
  Jeffrey Remmel, University of California, San Diego
  

  • 1:00 p.m.
    Barred and vincular pattern avoidance.
    Bridget Tenner*, DePaul University
    (1086-05-1144)
  • 1:30 p.m.
    Crucial and bicrucial permutations with respect to arithmetic monotone patterns.
    Sergey Avgustinovich, Sobolev Institute of Mathematics
    Sergey Kitaev*, University of Strathclyde
    Alexandr Valyuzhenich, Novosibirsk State University
    (1086-05-1203)
  • 2:00 p.m.
    GRIM: An algorithm for the discovery of generalized permutation patterns.
    Henning Arnor Ulfarsson*, Reykjavik University
    Anders Claesson, University of Strathclyde
    (1086-05-1831)
  • 2:30 p.m.
    Pattern Avoidance in Rook Monoids.
    Lara K. Pudwell*, Valparaiso University
    Daniel A. Daly, Southeast Missouri State University
    (1086-05-1724)
  • 3:00 p.m.
    A Bijection with Derangements.
    Miles Eli Jones*, Univ. of California, San Diego
    (1086-05-1164)
  • 3:30 p.m.
    Parallelogram polyominoes, the sandpile model on $K_{m,n}$ and a $q,t$-Narayana polynomial.
    Mark Dukes*, University of Strathclyde, UK
    Yvan Le Borgne, CNRS, University Bordeaux 1
    (1086-05-1409)
  • 4:00 p.m.
    Permuted Basement Fillings, k-ary Trees, and Watermelons.
    Janine LoBue*, University of California, San Diego
    (1086-05-1624)
  • 4:30 p.m.
    The Carlitz-Scoville-Vaughan theorem and its applications to permutation enumeration.
    Ira M. Gessel*, Brandeis University
    (1086-05-625)
  • 5:00 p.m.
    A $q$-analog of generalized Eulerian numbers.
    John Shareshian, Washington University
    Michelle L Wachs*, University of Miami
    (1086-05-2812)
  • 5:30 p.m.
    Equidistribution of some Euler-Mahonian statistics.
    Alexander Burstein*, Howard University
    (1086-05-2802)