Estimates for the concentration function of combinatorial number theory and probability

DOI10.1007/BF02018403zbMath0336.10050MaRDI 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

11K99: Probabilistic theory: distribution modulo (1); metric theory of algorithms

60F99: Limit theorems in probability theory

11B30: Arithmetic combinatorics; higher degree uniformity

Related Items

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