On the counting problem in inverse Littlewood–Offord theory

DOI10.1112/jlms.12409zbMath1470.60012arXiv1904.10425OpenAlexW3107139235MaRDI QIDQ5006328

Asaf Ferber, Wojciech Samotij, Kyle Luh, Vishesh Jain

Publication date: 13 August 2021

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1904.10425

zbMATH Keywords

inverse Littlewood-Offord theorems

Mathematics Subject Classification ID

Random matrices (probabilistic aspects) (60B20) Asymptotic enumeration (05A16)

Related Items

Sparse recovery properties of discrete random matrices ⋮ Singularity of sparse random matrices: simple proofs ⋮ On the smallest singular value of symmetric random matrices ⋮ Singularity of discrete random matrices ⋮ On sparse random combinatorial matrices ⋮ Singularity of random symmetric matrices revisited ⋮ Quantitative invertibility of random matrices: a combinatorial perspective ⋮ The least singular value of a random symmetric matrix ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ Singularity of random symmetric matrices -- simple proof ⋮ Antichain codes ⋮ SINGULARITY OF RANDOM SYMMETRIC MATRICES—A COMBINATORIAL APPROACH TO IMPROVED BOUNDS ⋮ Approximate Spielman-Teng theorems for the least singular value of random combinatorial matrices ⋮ Some new results in random matrices over finite fields ⋮ The strong circular law: A combinatorial view ⋮ Random symmetric matrices: rank distribution and irreducibility of the characteristic polynomial

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the singularity of adjacency matrices for random regular digraphs
• Optimal inverse Littlewood-Offord theorems
• On the singularity probability of discrete random matrices
• The solution of van der Waerden's problem for permanents
• On the singularity of random symmetric matrices
• Approximate Spielman-Teng theorems for the least singular value of random combinatorial matrices
• The circular law for random regular digraphs
• Singularity of random Bernoulli matrices
• Inverse Littlewood-Offord theorems and the condition number of random discrete matrices
• Asymptotic enumeration of dense 0-1 matrices with equal row sums and equal column sums
• Discrepancy properties for random regular digraphs
• A sharp inverse Littlewood-Offord theorem
• On the singularity probability of random Bernoulli matrices
• Estimates for the concentration function of combinatorial number theory and probability
• On the Probability That a Random ± 1-Matrix Is Singular
• SINGULARITY OF RANDOM SYMMETRIC MATRICES—A COMBINATORIAL APPROACH TO IMPROVED BOUNDS
• On the Singularity of Random Combinatorial Matrices
• Über ein Problem von Erdös und Moser
• Small Ball Probability, Inverse Theorems, and Applications
• On a lemma of Littlewood and Offord