AMS :: Joint Mathematics Meetings, Program by Special Session
Joint Mathematics Meetings Program by Special Session
Current as of Thursday, January 15, 2009 00:44:12
Program |
Deadlines |
Timetable |
Inquiries: meet@ams.org
Joint Mathematics Meetings
Washington, DC, January 5-8, 2009 (Monday - Thursday)
Meeting #1046
Associate secretaries: Bernard Russo , AMS brusso@math.uci.edu
James J Tattersall , MAA tat@providence.edu
AMS-ASL Special Session on Model Theoretic Methods in Finite Combinatorics
Tuesday January 6, 2009, 1:00 p.m.-4:20 p.m. AMS-ASL Special Session on Model Theoretic Methods in Finite Combinatorics, I
Virginia Suite B, Lobby Level, Marriott Organizers: Martin Grohe , Humboldt University
Johann A. Makowsky , Technion Israel Institute of Technology janos@cs.technion.ac.il
1:00 p.m.
Discussion
1:30 p.m.
Symmetrized Ramsey theorems for graphs and for countably categorical structures.
Menachem Kojman* , Ben Gurion University, Bersheva, Israel
(1046-05-342)
2:00 p.m.
Universal graphs with forbidden subgraphs.
Gregory L. Cherlin* , Rutgers University, New Brunswick, NJ
(1046-03-366)
2:30 p.m.
Partition theorems and permutation groups.
Andreas Blass* , University of Michigan
(1046-03-471)
3:00 p.m.
A Geometric Zero-One Law.
Robert Gilman , Stevens Institute of Technology
Yuri Gurevich , Microsoft Research
Alexei Myasnikov* , McGill University
(1046-05-373)
3:30 p.m.
Laplace transforms and zero-one laws.
Jason P. Bell* , Simon Fraser University
(1046-05-448)
4:00 p.m.
The Specker-Blatter theorem revisited.
Eldar Fischer* , Faculty of Computer Science, Technion - Israel Institute of Technology, Haifa, Israel
Johann A. Makowsky , Faculty of Computer Science, Technion - Israel Institute of Technology, Haifa, Israel
(1046-05-343)
Wednesday January 7, 2009, 1:00 p.m.-5:50 p.m. AMS-ASL Special Session on Model Theoretic Methods in Finite Combinatorics, II
Virginia Suite B, Lobby Level, Marriott Organizers: Martin Grohe , Humboldt University
Johann A. Makowsky , Technion Israel Institute of Technology janos@cs.technion.ac.il
1:00 p.m.
Why is the chromatic polynomial a polynomial? A model theoretic interpretation.
Tomer Kotek* , Technion - Israel Institute of Technology
Johann A. Makowsky , Technion - Israel Institute of Technology
Boris Zilber , Oxford University, Oxford, Great Britain
(1046-03-393)
1:30 p.m.
Towards a theory of graph polynomials.
Johann A. Makowsky* , Computer Science, Technion - Israel Institute of Technology
(1046-03-338)
2:00 p.m.
Non standard methods in hypergraph theory.
Gabor Elek , The Alfred Renyi Mathematical Institute of the Hungarian Academy of Sciences, Budapest, Hungary
Balasz Szegedy* , University of Toronto, Toronto, Canada
(1046-05-339)
2:30 p.m.
Homomorphism universal structures.
Jan Hubicka , Charles University Prague, Czech Republic
Jaroslav Nesetril* , Charles University Prague
(1046-05-341)
3:00 p.m.
On the Monadic Second-Order Transduction Hierarchy.
Achim Blumensath* ,
Bruno Courcelle , Universite Bordeaux 1, LaBRI
(1046-03-118)
3:30 p.m.
Ramsey Theory and Constraint Propagation Heuristics.
Albert Atserias* , Departament de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, Barcelona, Spain
(1046-05-496)
4:00 p.m.
Algorithmic Meta-Theorems.
Stephan Kreutzer* , University of Oxford
(1046-05-340)
4:30 p.m.
Counting constraint satisfaction problems.
Andrei A. Bulatov* , Simon Fraser University
(1046-05-377)
5:00 p.m.
k-Clique Requires k/4 Variables.
Benjamin Rossman* , Massachusetts Institute of Technology
(1046-68-387)
5:30 p.m.
Discussion
MAA Online
Inquiries: meet@ams.org