8:30 a.m. Higher Index Theorems For Orbifolds. Markus J Pflaum*, University of Colorado at Boulder
Hessel Posthuma, Korteweg-de Vries Institute, Universiteit van Amsterdam, The Netherlands
Xiang Tang, Washington University, St. Louis
(1049-58-59)
9:30 a.m. Diameters of spherical $3$-orbifolds. William D. Dunbar*, Bard College at Simon's Rock
Sarah J. Greenwald, Appalachian State University
Jill McGowan, Howard University
Catherine Searle, Universidad Nacional Autónoma de México
(1049-53-55)
9:30 a.m. Oriented Matroids and the Geometry of Visibility. R Basri, Weizmann Institute
P Felzenszwalb, University of Chicago
R Girshick, University of Chicago
D Jacobs, University of Maryland
C Klivans*, University of Chicago
(1049-05-151)
8:30 a.m. Self-avoiding knots. Alexander Y Grosberg*, Department of Physics and Center for Soft Matter Research, New York University
(1049-54-83)
9:30 a.m. The Ropelengths of Knots Are Almost Linear in Terms of Their Crossing Numbers: Part 1. Yuanan Diao*, Department of Mathematics and Statistics, UNC Charlotte
Ernst Claus, Department of Mathematics, Western Kentucky University
Attila Por, Department of Mathematics, Western Kentucky University
Uta Ziegler, Department of Computer Science, Western Kentucky University
(1049-57-76)
10:00 a.m. The Ropelengths of Knots Are Almost Linear in Terms of Their Crossing Numbers: Part 2. Yuanan Diao, Department of Mathematics and Statistics, UNC Charlotte
Ernst Claus*, Department of Mathematics, Western Kentucky University
Attila Por, Department of Mathematics, Western Kentucky University
Uta Ziegler, Department of Computer Science, Western Kentucky University
(1049-57-77)
9:30 a.m. Computing pure Nash equilibria in games with piecewise linear utilities. Christopher Thomas Ryan*, Sauder School of Business, University of British Columbia
Matthias Koeppe, University of California, Davis, Department of Mathematics
Albert Xin Jiang, University of British Columbia, Department of Computer Science
Kevin Leyton-Brown, University of British Columbia, Department of Computer Science
Maurice Queyranne, Sauder School of Business, British Columbia
(1049-91-57)
4:30 p.m. A fast ergodic algorithm for generating ensembles of equilateral random polygons. R Varela*, Department of Computer Science, San Francisco State University, 1600 Holloway Ave, San Francisco, CA 94132, USA
K Hinson, Department of Mathematics and Statistics, University of North Carolina at Charlotte Charlotte, NC 28223, USA
J Arsuaga, Department of Mathematics, San Francisco State University, 1600 Holloway Ave, San Francisco, CA 94132, USA
Y Diao, Department of Mathematics and Statistics, University of North Carolina at Charlotte Charlotte, NC 28223, USA
(1049-54-125)
3:00 p.m. Degeneration of flat structures. Moon Duchin*, University of Michigan
Christopher Leininger, University of Illinois
Kasra Rafi, University of Oklahoma
(1049-51-198)