Talk information

Date: Sunday, April 12, 2026
Time: 10:10–11:00
Place: Schreiber 309
Speaker: Elad Aigner-Horev (Ariel University)
Title: Resilience of Rademacher chaos of low degree

Abstract:

The resilience of a Rademacher chaos is the maximum number of adversarial sign-flips that the chaos can sustain without having its largest atom probability significantly altered. Inspired by probabilistic lower-bound guarantees for the resilience of linear Rademacher chaos (aka. resilience of the Littlewood-Offord problem), obtained by Bandeira, Ferber, and Kwan (Advances in Mathematics, Vol. 319, 2017), we provide probabilistic lower-bound guarantees for the resilience of Rademacher chaos of arbitrary degree; these being most meaningful provided that the degree is constant.

Joint work with Daniel Rosenberg and Roi Weiss.