An algebraic inverse theorem for the quadratic Littlewood-Offord problem, and an application to Ramsey graphs
From MaRDI portal
Publication:5126775
DOI10.19086/da.14351zbMath1480.05089arXiv1909.02089OpenAlexW3048484789MaRDI QIDQ5126775
Publication date: 20 October 2020
Published in: discrete Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.02089
Inequalities; stochastic orderings (60E15) Combinatorial probability (60C05) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items (3)
Singularity of the \(k\)-core of a random graph ⋮ Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture ⋮ The least singular value of a random symmetric matrix
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Inverse Littlewood-Offord problems and the singularity of random symmetric matrices
- Optimal inverse Littlewood-Offord theorems
- Random symmetric matrices are almost surely nonsingular.
- Induced subgraphs of Ramsey graphs with many distinct degrees
- Intersection theorems with geometric consequences
- Erdős and Rényi conjecture
- Some recent problems and results in graph theory
- Non-Ramsey graphs are \(c\log n\)-universal
- Symmetrization and concentration inequalities for multilinear forms with applications to zero-one laws for Lévy chaos
- 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction
- Bounds for graph regularity and removal lemmas
- Bilinear and quadratic variants on the Littlewood-Offord problem
- Singularity of random Bernoulli matrices
- Inverse Littlewood-Offord theorems and the condition number of random discrete matrices
- The Littlewood-Offord problem in high dimensions and a conjecture of Frankl and Füredi
- Ramsey graphs induce subgraphs of many different sizes
- The Littlewood-Offord problem and invertibility of random matrices
- On a Ramsey type theorem
- Anti-concentration for polynomials of independent random variables
- Real Advantage
- A sharp inverse Littlewood-Offord theorem
- Sizes of Induced Subgraphs of Ramsey Graphs
- Induced subgraphs with distinct sizes
- Estimates for the concentration function of combinatorial number theory and probability
- Induced subgraphs of prescribed size
- Combinatorial anti-concentration inequalities, with applications
- Anticoncentration for subgraph statistics
- Edge-statistics on large graphs
- Ramsey Graphs Induce Subgraphs of Quadratically Many Sizes
- Proof of a conjecture on induced subgraphs of Ramsey graphs
- From the Littlewood-Offord problem to the Circular Law: Universality of the spectral distribution of random matrices
- Two-source dispersers for polylogarithmic entropy and improved ramsey graphs
- Explicit two-source extractors and resilient functions
- Small Ball Probability, Inverse Theorems, and Applications
- On the Kolmogorov-Rogozin inequality for the concentration function
- Some remarks on the theory of graphs
- On a lemma of Littlewood and Offord
This page was built for publication: An algebraic inverse theorem for the quadratic Littlewood-Offord problem, and an application to Ramsey graphs
