March 9, 2017
10:20 am
-
11:15 am
Cockins Hall 240
Add to Calendar
2017-03-09 11:20:00
2017-03-09 12:15:00
Combinatorics Seminar - Lutz Warnke
Title: Upper tails for arithmetic progressions in random subsetsSpeaker: Lutz Warnke (Georgia Tech)Abstract: We study the upper tail for random variables such as the number of arithmetic progressions of a given length in a random subset of a finite set. For arithmetic progressions and Schur triples we establish exponentially small bounds for the right tail which are best possible up to constant factors in the exponent (improving results of Janson and Rucinski). The proofs are phrased in the language of random induced subhypergraphs, and exploit certain structural properties of the underlying k-uniform hypergraphs (encoding arithmetic progressions or Schur triples).Seminar URL: https://u.osu.edu/probability/spring-2017/
Cockins Hall 240
OSU ASC Drupal 8
ascwebservices@osu.edu
America/New_York
public
Date Range
2017-03-09 10:20:00
2017-03-09 11:15:00
Combinatorics Seminar - Lutz Warnke
Title: Upper tails for arithmetic progressions in random subsetsSpeaker: Lutz Warnke (Georgia Tech)Abstract: We study the upper tail for random variables such as the number of arithmetic progressions of a given length in a random subset of a finite set. For arithmetic progressions and Schur triples we establish exponentially small bounds for the right tail which are best possible up to constant factors in the exponent (improving results of Janson and Rucinski). The proofs are phrased in the language of random induced subhypergraphs, and exploit certain structural properties of the underlying k-uniform hypergraphs (encoding arithmetic progressions or Schur triples).Seminar URL: https://u.osu.edu/probability/spring-2017/
Cockins Hall 240
America/New_York
public
Title: Upper tails for arithmetic progressions in random subsets
Speaker: Lutz Warnke (Georgia Tech)
Abstract: We study the upper tail for random variables such as the number of arithmetic progressions of a given length in a random subset of a finite set. For arithmetic progressions and Schur triples we establish exponentially small bounds for the right tail which are best possible up to constant factors in the exponent (improving results of Janson and Rucinski). The proofs are phrased in the language of random induced subhypergraphs, and exploit certain structural properties of the underlying k-uniform hypergraphs (encoding arithmetic progressions or Schur triples).
Seminar URL: https://u.osu.edu/probability/spring-2017/
