January 19, 3:30pm, Wean 8220

Alistair Benford, University of Birmingham

Oriented trees in tournaments

Alistair Benford, University of Birmingham

Oriented trees in tournaments

January 26, 3:30pm, Wean 8220

Konstantin Tikhomirov, Carnegie Mellon University

A remark on the Ramsey number of the hypercube

Konstantin Tikhomirov, Carnegie Mellon University

A remark on the Ramsey number of the hypercube

February 2, 3:30pm, Wean 8220

Riley Thornton, Carnegie Mellon University

Component finite subgraphs of regular trees

Riley Thornton, Carnegie Mellon University

Component finite subgraphs of regular trees

February 9, 3:30pm, Wean 8220

Huy Tuan Pham, Stanford University

Talagrand’s unfulfilled dreams and related problems in probabilistic combinatorics

Huy Tuan Pham, Stanford University

Talagrand’s unfulfilled dreams and related problems in probabilistic combinatorics

February 16, 3:30pm, Wean 8220

Kevin Shu, Georgia Tech

Sparse Quadratic Programs via Polynomial Roots

Kevin Shu, Georgia Tech

Sparse Quadratic Programs via Polynomial Roots

February 23, 3:30pm, Wean 8220

Cosmin Pohoata, Institute for Advanced Study

Rainbow matchings in hypergraphs

Cosmin Pohoata, Institute for Advanced Study

Rainbow matchings in hypergraphs

March 2, 3:30pm, Wean 8220

Michael Krivelevich, Tel Aviv University

Improving graph's parameters through random perturbation

Michael Krivelevich, Tel Aviv University

Improving graph's parameters through random perturbation

March 9 Spring break, no seminar

March 16, 3:30pm, Wean 8220

Farbod Shokrieh, University of Washington, Seattle

Graphs, Jacobians, and measures

Farbod Shokrieh, University of Washington, Seattle

Graphs, Jacobians, and measures

March 23, 3:30pm, Wean 8220

Liana Yepremyan, Emory University

The random Turan number of even linear cycles

Liana Yepremyan, Emory University

The random Turan number of even linear cycles

March 30, 3:30pm, Wean 8220

Edinah Gnang, Johns Hopkins University

A proof of the Kotzig–Ringel–Rosa Conjecture

Edinah Gnang, Johns Hopkins University

A proof of the Kotzig–Ringel–Rosa Conjecture

April 13 All talks in Wean 8220.

11am

Ryan Alweiss, Princeton 12pm

Lunch
2pm

Marta Pavelka, University of Miami3:30pm

Henry Adams, Colorado State University
April 20, 3:30pm, Wean 8220

Shira Zerbib, Iowa State University

New bounds on piercing numbers and line-piercing numbers in families of convex sets in the plane

Shira Zerbib, Iowa State University

New bounds on piercing numbers and line-piercing numbers in families of convex sets in the plane

April 27, 3:30pm, Wean 8220

Boris Bukh, Carnegie Mellon University

Extremal graphs without exponentially-small bicliques

Boris Bukh, Carnegie Mellon University

Extremal graphs without exponentially-small bicliques

September 8, 3:30pm, Wean 8220

Antonio Blanca, Pennsylvania State University

Sampling from the ferromagnetic Potts model on random graphs

Antonio Blanca, Pennsylvania State University

Sampling from the ferromagnetic Potts model on random graphs

September 15, 3:30pm, Wean 8220

Jakob Hofstad, Carnegie Mellon University

Two Point Concentration of the Independence Number for Sparse Random Graphs

Jakob Hofstad, Carnegie Mellon University

Two Point Concentration of the Independence Number for Sparse Random Graphs

September 22, 3:30pm, Wean 8220

Alexandros Eskenazis, Sorbonne University

Dimension reduction for incompressible subsets of $\ell_p$

Alexandros Eskenazis, Sorbonne University

Dimension reduction for incompressible subsets of $\ell_p$

October 6, 3:30pm, Wean 8220

Himanshu Gupta, University of Delaware

The least Euclidean distortion constant of a distance-regular graph

Himanshu Gupta, University of Delaware

The least Euclidean distortion constant of a distance-regular graph

October 13, 3:30pm, Wean 8220

Matt Zaremsky, University of Albany

Shift-similar groups of permutations of the natural numbers

Matt Zaremsky, University of Albany

Shift-similar groups of permutations of the natural numbers

October 20 Fall break, tentatively no seminar.

October 27, 3:30pm, Wean 8220

Kiumars Kaveh, University of Pittsburgh

Convex polytopes, toric varieties and combinatorics appearing in Arthur's trace formula

Kiumars Kaveh, University of Pittsburgh

Convex polytopes, toric varieties and combinatorics appearing in Arthur's trace formula

November 3, 3:30pm, Wean 8220

Zoe Wellner, Carnegie Mellon University

A Colorful Borsuk-Ulam theorem

Zoe Wellner, Carnegie Mellon University

A Colorful Borsuk-Ulam theorem

November 10, 3:30pm, Wean 8220

Giorgis Petridis, University of Georgia

Covering sets by translates and a question of Bukh

Giorgis Petridis, University of Georgia

Covering sets by translates and a question of Bukh

November 17, 3:30pm, Wean 8220

Colin Jahel, Carnegie Mellon University

Asymptotic theories and homomorphically-avoided structures

Colin Jahel, Carnegie Mellon University

Asymptotic theories and homomorphically-avoided structures

November 24 Thanksgiving break, no seminar.

December 1, 3:30pm, Wean 8220

Corrine Yap, Rutgers University

Algorithms for the Potts model on expander graphs

Corrine Yap, Rutgers University

Algorithms for the Potts model on expander graphs

December 8, 3:30pm, Wean 8220

Penny Haxell, University of Waterloo

Large Cliques in Graphs with High Chromatic Number

Penny Haxell, University of Waterloo

Large Cliques in Graphs with High Chromatic Number

If you want to be a speaker or have questions or suggestions about the seminar, please contact the organizer, Amzi Jeffs.

Subscribe to the ACO seminar mailing list.