Joint Mathematics Meetings AMS Special Session

Current as of Saturday, January 18, 2025 03:30:05

• Program
• ·
• Deadlines
• ·
• Timetable
• ·
• Inquiries: meet@ams.org

2025 Joint Mathematics Meetings (JMM 2025)

• Seattle Convention Center and the Sheraton Grand Seattle, Seattle, WA
• January 8-11, 2025 (Wednesday - Saturday)
• Meeting #1203

Associate Secretary for the AMS Scientific Program:

Brian D. Boe, brian@math.uga.edu

AMS Special Session on Extremal and Probabilistic Combinatorics

• Saturday January 11, 2025, 8:30 a.m.-12:00 p.m.
  AMS Special Session on Extremal and Probabilistic Combinatorics, I
  Extremal combinatorics is the study of the maximum or minimum size of combinatorial objects with some desired property. Probabilistic combinatorics studies properties of combinatorial objects that hold almost surely as the size of the object grows. These related fields are central in combinatorics and have significant applications in other areas of mathematics, computer science, engineering and bioinformatics. This session features new results, tools and open problems in this area.
  Tahoma 3, Seattle Convention Center Arch at 800 Pike
  Organizers:
  Jd Nir, Oakland University nir.justin@gmail.com
  Lina Li, Iowa State University
  Ruth Luo, University of South Carolina
  

  • 8:30 a.m.
    The largest isosceles triangle-free subset of the grid
    Adam Zsolt Wagner*, Google DeepMind
    (1203-05-42550)
  • 9:00 a.m.
    A Smorgasbord of Small Ramsey Numbers
    Bernard Lidický, Iowa State University
    Gwen McKinley*, Center for Communications Research, La Jolla
    Florian Pfender, University of Colorado Denver
    Steven Van Overberghe, Ghent University
    (1203-05-41991)
  • 9:30 a.m.
    Towards the Overfull Conjecture
    Songling Shan*, Auburn University
    (1203-05-40096)
  • 10:00 a.m.
    Monochromatic Rectangles in Grids
    Jonathan Davidson, Cal State LA
    Jason O'Neill*, Cal State LA
    Gary Ruiz-Navarro, Cal State LA
    Israel Wilbur, Cal State LA
    (1203-05-41246)
  • 10:30 a.m.
    A general theorem in spectral extremal graph theory
    John Byrne*, University of Delaware
    Dheer Noal Desai, University of Memphis
    Michael Tait, Villanova University
    (1203-05-41974)
  • 11:00 a.m.
    Beyond the classification theorem of Cameron, Goethals, Seidel and Shult
    Hricha Acharya, Arizona State University
    Zilin Jiang*, Arizona State University
    (1203-05-39228)
  • 11:30 a.m.
    Constant Longest Path Transversals in Sufficiently Dense Graphs
    Andrzej Czygrinow, Arizona State University
    Kevin G Milans*, West Virginia University
    Jackson Porter, West Virginia University
    (1203-05-42534)
• Saturday January 11, 2025, 1:30 p.m.-5:30 p.m.
  AMS Special Session on Extremal and Probabilistic Combinatorics, II
  Extremal combinatorics is the study of the maximum or minimum size of combinatorial objects with some desired property. Probabilistic combinatorics studies properties of combinatorial objects that hold almost surely as the size of the object grows. These related fields are central in combinatorics and have significant applications in other areas of mathematics, computer science, engineering and bioinformatics. This session features new results, tools and open problems in this area.
  Tahoma 3, Seattle Convention Center Arch at 800 Pike
  Organizers:
  Jd Nir, Oakland University nir.justin@gmail.com
  Lina Li, Iowa State University
  Ruth Luo, University of South Carolina
  

  • 1:30 p.m.
    Coloring Hypergraphs
    Zoltan Blazsik, University of Szeged
    Nathan Lemons*, Los Alamos National Laboratory
    (1203-05-45739)
  • 2:00 p.m.
    Positive co-degree densities and jumps
    József Balogh, University of Illinois Urbana-Champaign
    Anastasia Halfpap, Iowa State University
    Bernard Lidicky*, Iowa State University
    Cory Palmer, University of Montana
    (1203-05-42498)
  • 2:30 p.m.
    Positive co-degree thresholds in $3$-graphs
    Anastasia Halfpap*, University of Montana
    Van Magnan, University of Vermont
    (1203-05-42360)
  • 3:00 p.m.
    Robustness of Erdős-Ko-Rado theorems for derangements
    Karen R. Gunderson*, University of Manitoba
    Karen Meagher, University of Regina
    Joy M W Morris, University of Lethbridge
    Venkata Raghu Tej Pantangi, University of Regina
    Mahsa Nasrollahi Shirazi, University of Manitoba
    (1203-05-41984)
  • 3:30 p.m.
    Probabilistic parking functions
    Irfan Durmic, Williams College
    Alex Han, Yale University
    Pamela Estephania Harris*, Williams College
    Rodrigo Ribeiro, University of Denver
    Mei Yin, University of Denver
    (1203-05-41245)
  • 4:00 p.m.
    Exploring dynamic graphs: What to do when your flights keep getting canceled
    Amanda Epping Redlich*, University of Massachusetts Lowell
    (1203-05-42287)
  • 4:30 p.m.
    Monochromatic Sums and Products over $\mathbb {Q}$
    Ryan Alweiss*, University of Cambridge
    (1203-05-42074)
  • 5:00 p.m.
    A group-action Szemeredi-Trotter theorem and applications to orchard problems
    Yifan Jing*, the Ohio State University
    (1203-20-41686)