Feb. 20, 3:30pm, Wean 8220

Pawel Pralat, Ryerson University

A few random open problems, some of them for random graphs

Pawel Pralat, Ryerson University

A few random open problems, some of them for random graphs

Mar. 20, 4:30pm, Wean 8220 (Note unusual time)

Daniel Kane, Stanford University

On a problem related to the ABC conjecture

Daniel Kane, Stanford University

On a problem related to the ABC conjecture

Apr. 17, 3:30pm, Wean 8220

Imre Bárány, Rényi Mathematical Institute and University College London

On a geometric Ramsey number

Imre Bárány, Rényi Mathematical Institute and University College London

On a geometric Ramsey number

May. 1, 3:30pm, Wean 8220

Carl Yerger, Davidson College

Steinberg's Conjecture, the Bordeaux Coloring Conjecture and Near-Coloring

Carl Yerger, Davidson College

Steinberg's Conjecture, the Bordeaux Coloring Conjecture and Near-Coloring

Sep. 19, 3:30pm, Wean 8220

Jie Ma, Carnegie Mellon University

Graphs with maximum number of proper*q*-colorings and a conjecture of Lazebnik

Jie Ma, Carnegie Mellon University

Graphs with maximum number of proper

Sep. 26, 3:30pm, Wean 8220

Santosh Vempala, Georgia Tech

On the Complexity of Random Problems with Planted Solutions

Santosh Vempala, Georgia Tech

On the Complexity of Random Problems with Planted Solutions

Oct. 3, 3:30pm, Wean 8220

Michael Krivelevich, Tel Aviv University

Smoothed analysis on connected graphs

Michael Krivelevich, Tel Aviv University

Smoothed analysis on connected graphs

Oct. 10, 3:30pm, Wean 8220

Hao Huang, IAS and Rutgers University

The minimum number of nonnegative edges in hypergraphs

Hao Huang, IAS and Rutgers University

The minimum number of nonnegative edges in hypergraphs

Oct. 17, 3:30pm, Gates 7501 (Note unusual location)

Michael Saks, Rutgers University

Population recovery with high erasure probability

Michael Saks, Rutgers University

Population recovery with high erasure probability

Oct. 25, 4:00pm, Gates 6115 (Note unusual day, time, and location)

Yuval Peres, Microsoft Research

Hidden cliques in large graphs, search games and Kakeya sets (CSD Distinguished Lecture)

Yuval Peres, Microsoft Research

Hidden cliques in large graphs, search games and Kakeya sets (CSD Distinguished Lecture)

Oct. 31, 3:30pm, Wean 8220

Ameerah Chowdhury, Carnegie Mellon University

A proof of the Manickam–Miklós–Singhi conjecture for vector spaces

Ameerah Chowdhury, Carnegie Mellon University

A proof of the Manickam–Miklós–Singhi conjecture for vector spaces

Nov. 7, 3:30pm, Gates 4401 (Note unusual location)

Shafi Goldwasser, MIT and Weizman

The Cryptographic Lens (SCS Distinguished Lecture)

Shafi Goldwasser, MIT and Weizman

The Cryptographic Lens (SCS Distinguished Lecture)

Nov. 14, 3:30pm, Wean 8220

Liu Yang, MIT and CMU

Online Allocation and Pricing with Economies of Scale

Liu Yang, MIT and CMU

Online Allocation and Pricing with Economies of Scale

Nov. 21, 3:30pm, Wean 8220

Constantinos Daskalakis, MIT

An Optimization Approach to Mechanism Design

Constantinos Daskalakis, MIT

An Optimization Approach to Mechanism Design

Nov. 22, 3:30pm, Wean 8220 (Note unusual day)

Nayantara Bhatnagar, University of Delaware

Lengths of Monotone Subsequences in a Mallows Permutation

Nayantara Bhatnagar, University of Delaware

Lengths of Monotone Subsequences in a Mallows Permutation

Nov. 28, everywhere **except** Wean 8220

Turkey, Thanksgiving

Turkey, Thanksgiving

Dec. 5, 3:30pm, Wean 8220

Adam Sheffer, Tel Aviv University

Recent progress in distinct distances problems

Adam Sheffer, Tel Aviv University

Recent progress in distinct distances problems

Dec. 16, 3:30pm, Wean 8220

Dhruv Mubayi, University of Illinois at Chicago

Intersection Theorems for Finite Sets

Dhruv Mubayi, University of Illinois at Chicago

Intersection Theorems for Finite Sets

If you **want to be a speaker** or have questions or suggestions
about the seminar, please contact
**the organizer**:
Boris Bukh ()

Subscribe to the ACO seminar mailing list