
AMS Meeting Program by Special Session
Current as of Tuesday, April 12, 2005 15:09:07
Program 
Deadlines 
Inquiries: meet@ams.org
International Joint Mathematics Meeting
Merida, Mexico, December 14, 1993
Meeting #888
Associate secretaries: Robert M Fossum, AMS rmfossum@uiuc.edu
Special Session on Graphs and Combinatorics

Thursday December 2, 1993, 09:0011:50
Special Session on Graphs and Combinatorics, I

09:00
The linesplanes inequality in binary matroids.
Joseph P.S. Kung*, University of North Texas, Denton
(8880581)

09:30
A note on spanning trees with bounded degrees.
Eduardo Rivera Campo*, UAMI
(8880560)

10:00
Total colouring of some graphs.
Abdon SanchezArroyo*, Facultad de CienciasUNAM
(8880561)

10:30
Discussion

11:00
Hadamard invertibility of linearly recursive sequences in several variables.
Earl J. Taft*, Rutgers University, New Brunswick, New Jersey
(8880514)

11:30
The K(pie,1) property for two classes of graphic arrangements.
Michael J. Falk*, Northern Arizona University, Flagstaff
(88852157)

Thursday December 2, 1993, 16:0018:50
Special Session on Graphs and Combinatorics, II

16:00
A generalized metric association scheme.
Gregory Hill*, University of North Texas, Denton
(8880538)

16:30
Coloring the icosahedron and the 120 cell.
Steve Fisk*, Bowdoin College, Brunswick, Maine
(8880584)

17:00
The ring of operations on Burnside rings generated by the generalized symmetric powers.
Ernesto Vallejo*, ITAM, Rio Hondo
(8880503)

17:30
Discussion

18:00
An upper bound to the crossing number of K_nx drawn on q pages.
P. Salemi, ISAB Gruppo ERG, Italy
F. Broggi, University of Milan, Italy
E. Damiani, University of Milan, Italy
O. D'Antona*, University of Milan, Italy
(8880530)

18:30
A new proof of the interval of ranks case for the Boolean algebra.
Margaret A. Readdy*, University of Quebec at Montreal, Canada
(88806146)

Friday December 3, 1993, 09:0011:50
Special Session on Graphs and Combinatorics, III

09:00
Flood light illumination problems.
Jorge Urrutia*, University of Ottawa, Canada
(8880559)

09:30
Recent results on Dowling lattices.
Joseph E. Bonin*, George Washington University, Washington, D.C.
(8880539)

10:00
On the enumeration of npolyhedral embeddings of cartesian products of cycles.
Adrian Riskin*, Northern Arizona University, Flagstaff
(88805135)

10:30
Discussion

11:00
Clique divergence in graphs. Some variations.
Victor NeumannLara*, IMATEUNAM
(8880563)

11:30
A simple algorithm to generate the Bernoulli and Euler polynomials.
Donald R. Snow*, Brigham Young University, Provo, Utah
(88805137)

Friday December 3, 1993, 16:0018:50
Special Session on Graphs and Combinatorics, IV

16:00
Multiobjective traffic assignment model for Toluca City.
Juan GaytanIniestra*, UAEM
Felipe CamachoMejia, UAEM
(8880562)

16:30
Selected problems in lattice paths enumeration.
Heinrich Niederhausen*, Florida Atlantic University, Boca Raton
(88805145)

17:00
The square of paths and cycles.
Genghua Fan, Arizona State University, Tempe
Henry A. Kierstead*, Arizona State University, Tempe
(88805156)

17:30
Partition lattices and affine geometry.
M. K. Bennett*, University of Massachusetts, Amherst
(8880631)

18:00
The combinatorics of the product of sums of squares problem.
Gilberto Calvillo, CINVESTAV IPN
Isidoro Gitler, CINVESTAV IPN
Jose MartinezBernal*, CINVESTAV IPN
(8880564)

18:30
Projective polyhedral manifolds.
Jorge L. Arocha*, IMATEUNAM
Javier Bracho, IMATEUNAM
Luis Montejano, IMATEUNAM
(8880558)
Inquiries: meet@ams.org

