AMS Sectional Meeting Program by Special Session

Current as of Saturday, October 11, 2008 00:27:40

Program | Deadlines | Registration/Housing/Etc. | Special Event or Lecture | Inquiries: meet@ams.org

Associate secretaries:
Michel L Lapidus, AMS lapidus@math.ucr.edu, lapidus@mathserv.ucr.edu

Saturday October 4, 2008, 8:00 a.m.-10:50 a.m.
Special Session on Algorithmic Probability and Combinatorics, I
Room 1, Woodward Building (Instructional Resources Center/IRC)
Organizers:
Manuel Lladser, University of Colorado lladser@colorado.edu
Robert S. Maier, University of Arizona rsm@math.arizona.edu
Marni Mishna, Simon Fraser University mmishna@cs.sfu.ca
Andrew Rechnitzer, University of British Columbia andrewr@math.ubc.ca
- 8:00 a.m.
  One-dimensional quantum random walk with more than two chiralities.
  Torin Greenwood*, University of Pennsylvania
  Robin Pemantle, University of Pennsylvania
  (1041-05-114)
- 8:30 a.m.
  Directed Paths in a Layered Environment.
  E. J. Janse van Rensburg*, York University
  (1041-82-123)
- 9:00 a.m.
  Directed Compact Percolation near a damp wall and lattice paths.
  Aleks L Owczarek*, The University of Melbourne
  (1041-05-37)
- 9:30 a.m.
  Subsets of self-avoiding walks and polygons.
  Anthony J Guttmann*, University of Melbourne
  John Dethridge, Australia
  Tim Garoni, NYU
  Iwan Jensen, University of Melbourne
  (1041-05-302)
- 10:00 a.m.
  Fuchsian ODE searches using modular arithmetic.
  Iwan Jensen*, Department of Mathematics and Statistics, The University of Melbourne
  (1041-34-128)
- 10:30 a.m.
  Prudent self-avoiding walks.
  Mireille Bousquet-Mélou*, CNRS, LaBRI, Université Bordeaux 1
  (1041-05-23)

Saturday October 4, 2008, 3:00 p.m.-5:20 p.m.
Special Session on Algorithmic Probability and Combinatorics, II
Room 1, Woodward Building (Instructional Resources Center/IRC)
Organizers:
Manuel Lladser, University of Colorado lladser@colorado.edu
Robert S. Maier, University of Arizona rsm@math.arizona.edu
Marni Mishna, Simon Fraser University mmishna@cs.sfu.ca
Andrew Rechnitzer, University of British Columbia andrewr@math.ubc.ca
- 3:00 p.m.
  A new approach to the variance of shape characteristics of random digital search trees.
  Hsien-Kuei Hwang*, Institute of Statistical Science, Academia Sinica, Taipei
  (1041-68-242)
- 3:30 p.m.
  Enumeration of distance-hereditary graphs.
  Cedric Chauve*, Simon Fraser University
  Eric Fusy, Simon Fraser University and CNRS
  (1041-05-113)
- 4:00 p.m.
  Smallest Components and Restricted Patterns in Combinatorial Decomposable Structures.
  Daniel Panario*, School of Mathematics and Statistics, Carleton University
  (1041-05-101)
- 4:30 p.m.
  An involution for the enumeration of alternating sign matrices.
  Richard Brak*, The University of Melbourne
  P. Fijn, The University of Melbourne
  (1041-05-117)
- 5:00 p.m.
  Enumeration opens the door: revealing the structure of the graph by counting bases of two matroids.
  Marni Mishna, Simon Fraser University
  Nancy Ann Neudauer*, Pacific University
  Brett Stevens, Carleton University
  (1041-05-141)

Sunday October 5, 2008, 8:30 a.m.-10:50 a.m.
Special Session on Algorithmic Probability and Combinatorics, III
Room 1, Woodward Building (Instructional Resources Center/IRC)
Organizers:
Manuel Lladser, University of Colorado lladser@colorado.edu
Robert S. Maier, University of Arizona rsm@math.arizona.edu
Marni Mishna, Simon Fraser University mmishna@cs.sfu.ca
Andrew Rechnitzer, University of British Columbia andrewr@math.ubc.ca
- 8:30 a.m.
  Graph classes with given $3$-connected components: asymptotic counting, limit laws and critical phenomena.
  Juanjo Rué*, Universitat Politècnica de Catalunya (UPC)
  Marc Noy, Universitat Politècnica de Catalunya (UPC)
  Omer Giménez, Universitat Politècnica de Catalunya (UPC)
  (1041-05-102)
- 9:00 a.m.
  Random Pattern-Avoiding Permutations.
  Neal Madras*, York University
  (1041-60-44)
- 9:30 a.m.
  Pattern Theorems for Self-Avoiding Polygons in $\mathbb{Z}^2$ and $\mathbb{Z}^3$.
  Chris Soteros*, University of Saskatchewan
  (1041-05-284)
- 10:00 a.m.
  Cut-off and exit from metastability: two sides of the same coin.
  Javiera Barrera*, Universidad Tec. Federico Sta. María
  Olivier Bertoncini, Université de Rouen
  Roberto Fernández, Université de Rouen
  (1041-60-29)
- 10:30 a.m.
  Tails of perpetuities.
  Paweł Hitczenko*, Department of Mathematics, Drexel University
  Jacek Wesołowski, Wydział MiNI, Politechnika Warszawska
  (1041-60-36)

Sunday October 5, 2008, 3:00 p.m.-4:50 p.m.
Special Session on Algorithmic Probability and Combinatorics, IV
Room 1, Woodward Building (Instructional Resources Center/IRC)
Organizers:
Manuel Lladser, University of Colorado lladser@colorado.edu
Robert S. Maier, University of Arizona rsm@math.arizona.edu
Marni Mishna, Simon Fraser University mmishna@cs.sfu.ca
Andrew Rechnitzer, University of British Columbia andrewr@math.ubc.ca
- 3:00 p.m.
  Boltzmann samplers, Pólya theory, and cycle-pointing.
  Manuel Bodirsky, Ecole Polytechnique, Paris.
  Eric P Fusy*, Simon Fraser University, Vancouver
  Mihyun Kang, Humboldt Universitaet, Berlin
  Stefan Vigerske, Humboldt Universitaet, Berlin
  (1041-05-92)
- 3:30 p.m.
  The subspace pursuit algorithm for compressed sensing signal reconstruction.
  Wei Dai*, University of Illinois, Urbana-Champaign
  Olgica Milenkovic, University of Illinois, Urbana-Champaign
  (1041-60-211)
- 4:00 p.m.
  Packing sets of patterns.
  Alexander Burstein*, Howard University
  Peter Hästö, University of Oulu
  (1041-05-269)
- 4:30 p.m.
  Finitary colouring.
  Alexander E Holroyd*, University of British Columbia
  (1041-60-204)

Inquiries: meet@ams.org