Estimates for the concentration function of combinatorial number theory and probability

DOI10.1007/BF02018403zbMath0336.10050OpenAlexW2047705353MaRDI QIDQ4104036

Gábor Halász

Publication date: 1977

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02018403

Mathematics Subject Classification ID

Probabilistic theory: distribution modulo (1); metric theory of algorithms (11K99) Limit theorems in probability theory (60F99) Arithmetic combinatorics; higher degree uniformity (11B30)

Related Items

Random walks with different directions ⋮ Sparse recovery properties of discrete random matrices ⋮ On the number of Hadamard matrices via anti-concentration ⋮ Concentration of the number of intersections of random eigenfunctions on flat tori ⋮ On the Littlewood-Offord problem ⋮ On the quantum query complexity of local search in two and three dimensions ⋮ Interview with Van Vu ⋮ Non-abelian Littlewood-Offord inequalities ⋮ Nodal set of monochromatic waves satisfying the random wave model ⋮ Random symmetric matrices are almost surely nonsingular. ⋮ The Littlewood-Offord problem in high dimensions and a conjecture of Frankl and Füredi ⋮ Anticoncentration and the Exact Gap-Hamming Problem ⋮ Erdős-Littlewood-Offord problem with arbitrary probabilities ⋮ On sparse random combinatorial matrices ⋮ From the Littlewood-Offord problem to the Circular Law: Universality of the spectral distribution of random matrices ⋮ Quantitative invertibility of random matrices: a combinatorial perspective ⋮ Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture ⋮ On the Littlewood‐Offord problem for arbitrary distributions ⋮ A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics ⋮ Inverse Littlewood-Offord problems and the singularity of random symmetric matrices ⋮ Random orthonormal polynomials: Local universality and expected number of real roots ⋮ Multivariate estimates for the concentration functions of weighted sums of independent, identically distributed random variables ⋮ Optimal inverse Littlewood-Offord theorems ⋮ Siegel’s Lemma Is Sharp ⋮ Anti-concentration Inequalities for Polynomials ⋮ Estimates for the concentration functions in the Littlewood-Offord problem ⋮ Random embedding of \({\ell_p^n}\) into \({\ell_r^N}\) ⋮ Bilinear and quadratic variants on the Littlewood-Offord problem ⋮ Structure of eigenvectors of random regular digraphs ⋮ Random doubly stochastic matrices: the circular law ⋮ Bounds on the concentration function in terms of the Diophantine approximation ⋮ Random matrices: tail bounds for gaps between eigenvalues ⋮ On the rate of decay of concentration functions of \(n\)-fold convolutions of probability distributions ⋮ Antichain codes ⋮ The Littlewood-Offord problem and invertibility of random matrices ⋮ A nonuniform Littlewood-Offord inequality for all norms ⋮ Resilience for the Littlewood-Offord problem ⋮ On the Rank of Random Sparse Matrices ⋮ Proof of a conjecture of Offord ⋮ SINGULARITY OF RANDOM SYMMETRIC MATRICES—A COMBINATORIAL APPROACH TO IMPROVED BOUNDS ⋮ Resilience for the Littlewood-Offord problem ⋮ An algebraic inverse theorem for the quadratic Littlewood-Offord problem, and an application to Ramsey graphs ⋮ On the singularity of random symmetric matrices ⋮ Anti-concentration for subgraph counts in random graphs ⋮ Recent progress in combinatorial random matrix theory ⋮ Braess's paradox for the spectral gap in random graphs and delocalization of eigenvectors ⋮ The Littlewood-Offord problem for Markov chains ⋮ Surjectivity of near-square random matrices ⋮ Resilience of the rank of random matrices ⋮ Arak Inequalities for Concentration Functions and the Littlewood--Offord Problem ⋮ Some new results in random matrices over finite fields ⋮ On the counting problem in inverse Littlewood–Offord theory ⋮ Cosine polynomials with few zeros ⋮ On the singularity probability of random Bernoulli matrices ⋮ Geometric and o-minimal Littlewood-Offord problems ⋮ Roots of random functions: A framework for local universality ⋮ Polynomial Threshold Functions, Hyperplane Arrangements, and Random Tensors