AMS Sectional Meeting Program by Special Session
Current as of Saturday, October 13, 2007 00:36:28
Program 
Deadlines 
Registration/Housing/Etc. 
Inquiries: meet@ams.org
2007 Fall Central Section Meeting
Chicago, IL, October 56, 2007 (Friday  Saturday)
Meeting #1030
Associate secretaries:
Susan J Friedlander, AMS
susan@math.northwestern.edu
Special Session on Algorithmic Probability and Combinatorics

Friday October 5, 2007, 8:30 a.m.10:50 a.m.
Special Session on Algorithmic Probability and Combinatorics, I
Room 1006, Lewis Center
Organizers:
Manuel Lladser, University of Colorado lladser@colorado.edu
Robert S. Maier, University of Arizona rsm@math.arizona.edu

8:30 a.m.
Phase Changes in Subtree Varieties in Random Trees.
Hosam M. Mahmoud*, The George Washington University
(103060129)

9:00 a.m.
On the Number of $k$Cousins in Tries and Suffix Trees.
Hosam M. Mahmoud, The George Washington University
Mark Daniel Ward*, Purdue University
(103060370)

9:30 a.m.
Quantum random walks in one dimension via generating functions.
Andrew Bressler*, University of Pennsylvania, Department of Mathematics
(103005155)

10:00 a.m.
A Hybrid of Darboux's Method and Singularity Analysis in Combinatorial Asymptotics.
Eric Fusy*, Simon Fraser University, Vancouver
Philippe Flajolet, Projet ALGO, INRIA Rocquencourt, France
Xavier Gourdon, Paris, France
Daniel Panario, School of Mathematics and Statistics, Carleton University, Ottawa
Nicolas Pouyanne, Université de Versailles SaintQuentin en Yvelines, France
(10300580)

10:30 a.m.
Effective methods in multivariate asymptotics.
Robin Pemantle*, University of Pennsylvania
(10300513)

Friday October 5, 2007, 3:00 p.m.5:50 p.m.
Special Session on Algorithmic Probability and Combinatorics, II
Room 1006, Lewis Center
Organizers:
Manuel Lladser, University of Colorado lladser@colorado.edu
Robert S. Maier, University of Arizona rsm@math.arizona.edu

3:00 p.m.
Transforming and reducing Dfinite combinatorial sequences.
Robert S. Maier*, University of Arizona
(103005403)

3:30 p.m.
Systematic Asymptotic Enumeration of Regular Structures.
Marni Mishna*, Dept. Mathematics, Simon Fraser University
(103005357)

4:00 p.m.
On the Congruences of Combinatorial Numbers.
ShuChung Liu*, Department of Applied Mathematics, National Hsinchu University of Education, Hsinchu, Taiwan
SenPeng Eu, Department of Applied Mathematics, National University of Kaohsiung, Kaohsiung, Taiwan
YeongNan Yeh, Institute of Mathematics, Academia Sinica, Taipei, Taiwan
(103005387)

4:30 p.m.
Planar tableaux in a strip as an exactly solvable model.
Yuliy Baryshnikov*, Bell Labs
Dan Romik, Hebrew University
(103060234)

5:00 p.m.
Asymptotic Enumeration of Trapping Sets in Random Tanner Graph Ensembles.
Olgica Milenkovic*, University of Illinois, UrbanaChampaign
Emina Soljanin, AlcatelLucent, Bell Labs Technology
Philip Whiting, AlcatelLucent, Bell Labs Technologies
(103005233)

5:30 p.m.
Discussion

Saturday October 6, 2007, 8:30 a.m.10:50 a.m.
Special Session on Algorithmic Probability and Combinatorics, III
Room 1006, Lewis Center
Organizers:
Manuel Lladser, University of Colorado lladser@colorado.edu
Robert S. Maier, University of Arizona rsm@math.arizona.edu

8:30 a.m.
Fourier analysis and statistics on groups.
Nicholas Eriksson*, Department of Statistics, University of Chicago
Persi Diaconis, Departments of Mathematics and Statistics, Stanford University
(103062137)

9:00 a.m.
Minimal Markovian embeddings of nonMarkovian random strings.
Manuel E. Lladser*, Applied Mathematics, University of Colorado at Boulder
(103060243)

9:30 a.m.
Forbidden patterns in telling random from deterministic time series.
Sergi Elizalde*, Dartmouth College
(103005321)

10:00 a.m.
New Dumont permutations.
Alexander Burstein*, Howard University
Walter Stromquist, Swarthmore College
(103005391)

10:30 a.m.
Statistics on permutation tableaux.
Pawel Hitczenko*, Drexel University
(103060284)
Inquiries: meet@ams.org