University of Cambridge > Talks.cam > Combinatorics Seminar > Tight anti-concentration of Rademacher sums

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Tight anti-concentration of Rademacher sums

Download to your calendar using vCal

  • UserLawrence Hollom (Cambridge)
  • ClockThursday 16 May 2024, 14:30-15:30
  • HouseMR12.

If you have a question about this talk, please contact .

We consider lower bounds on anti-concentration probabilities of the form P(|X| >= x), where X = a_1 ε_1 ... a_n ε_n is a Rademacher sum; ε_i are independent and uniform signs +1 or -1, and a_i > 0 are constants normalised so that Var(X) = 1. We determine the infimal value of P(|X| >= x) over Rademacher sums X for all values x >= 0, giving a partial answer to a question by Keller and Klein. In particular, for x = 1 we improve on a sequence of results to produce the optimal lower bound P(|X| >= 1) >= 7/32, confirming a conjecture of Hitczenko and Kwapień.

This talk is part of the Combinatorics Seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Lecture Theatre 3, Judge Business School, Trumpington Street, Cambridge CB2 1AG MRC LMB, Sanger or Brenner Room SG1 & SG2, Alison Richard Building, 7 West Rd, Cambridge CB3 9DT

Other talks

Caribbean Trip and Cacti Max Perutz Lecture - Title TBC Talk title TBC Formal Dinner at Selwyn College Seminars in Cancer Morning Tea and Coffee
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity