Anti-concentration with respect to random permutations

DOI10.37236/15067MaRDI QIDQ7364533zbMATH OpenFDO

Authors Aaron Berger, Ross Berkowitz, Patrick Devlin, Van Vu

Publication date 2 October 2026

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.37236/15067

Mathematics Subject Classification ID

Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Combinatorial probability (60C05)

Cites work

• Adjacency matrices of random digraphs: singularity and anti-concentration
• An Estimate for Concentration Functions
• scientific article; zbMATH DE number 3171472 (Why is no real title available?)
• scientific article; zbMATH DE number 3099315 (Why is no real title available?)
• Inverse Littlewood-Offord theorems and the condition number of random discrete matrices
• On a lemma of Littlewood and Offord
• On the Distribution of the Number of Real Roots of Random Polynomials
• On the Kolmogorov-Rogozin inequality for the concentration function
• Real zeroes of random polynomials. II: Descartes' rule of signs and anti-concentration on the symmetric group
• Small ball probability, inverse theorems, and applications
• The fraction of an \(S_n\)-orbit on a hyperplane
• Théorie de l'addition des variables aléatoires.
• Two Uniform Limit Theorems for Sums of Independent Random Variables
• Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property
• What fraction of an \(S_n\)-orbit can lie on a hyperplane?

This page was built for publication: Anti-concentration with respect to random permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7364533)