scientific article; zbMATH DE number 3099315
From MaRDI portal
zbMath0061.01801MaRDI QIDQ5839995
J. E. Littlewood, A. C. Offord
Publication date: 1943
Full work available at URL: https://eudml.org/doc/65225
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Singularity of sparse Bernoulli matrices, Applications of the symmetric chain decomposition of the lattice of divisors, On the Littlewood-Offord problem, CLT for the zeros of classical random trigonometric polynomials, Arak's inequalities for concentration functions and the Littlewood-Offord problem, Interview with Van Vu, Random polynomials having few or no real zeros, Non-abelian Littlewood-Offord inequalities, Random symmetric matrices are almost surely nonsingular., Fooling Polytopes, Real roots of random polynomials: expectation and repulsion, Random trigonometric polynomials: universality and non-universality of the variance for the number of real roots, The Littlewood-Offord problem in high dimensions and a conjecture of Frankl and Füredi, Anticoncentration and the Exact Gap-Hamming Problem, On subspaces spanned by random selections of \(\pm 1\) vectors, Explicit exponential lower bounds for exact hyperplane covers, From the Littlewood-Offord problem to the Circular Law: Universality of the spectral distribution of random matrices, Improved approximation of linear threshold functions, Where are the zeroes of a random p-adic polynomial?, Cyclotomic Coincidences, On delocalization of eigenvectors of random non-Hermitian matrices, Quantitative invertibility of random matrices: a combinatorial perspective, The density of polynomials of degree n$n$ over Zp${\mathbb {Z}}_p$ having exactly r$r$ roots in Qp${\mathbb {Q}}_p$, Anticoncentration and Berry-Esseen bounds for random tensors, Inverse Littlewood-Offord problems and the singularity of random symmetric matrices, A new approach to an old problem of Erdős and Moser, Quantitative invertibility of non-Hermitian random matrices, Random orthonormal polynomials: Local universality and expected number of real roots, Zero distribution of random Bernoulli polynomial mappings, Real zeros of random trigonometric polynomials with $\ell$-periodic coefficients, Universality of the minimum modulus for random trigonometric polynomials, Ildar Abdullovich Ibragimov (on his ninetieth birthday), How many real zeros does a random Dirichlet series have?, A discrete variation of the Littlewood-Offord problem, Multiplicative structures and random walks in o-minimal groups, Complex random matrices have no real eigenvalues, Reconstructing weighted graphs with minimal query complexity, Multivariate estimates for the concentration functions of weighted sums of independent, identically distributed random variables, Optimal inverse Littlewood-Offord theorems, Anti-concentration Inequalities for Polynomials, Bernoulli sums and Rényi entropy inequalities, The Littlewood-Offord problem: Tightest packing and an M-part Sperner theorem, Estimates for the concentration functions in the Littlewood-Offord problem, Expected number of real zeroes of random Taylor series, Around the circular law, Deletion correcting codes meet the Littlewood-Offord problem, Bilinear and quadratic variants on the Littlewood-Offord problem, On the expected number of zeros of nonlinear equations, Real zeros of random sums with i.i.d. coefficients, Unnamed Item, Random doubly stochastic matrices: the circular law, No zero-crossings for random polynomials and the heat equation, Subsets of posets minimising the number of chains, On Newman and Littlewood polynomials with a prescribed number of zeros inside the unit disk, Hamiltonian cycles and symmetric chains in Boolean lattices., A bound for the maximal probability in the Littlewood-Offord problem, Expected number of real roots for random linear combinations of orthogonal polynomials associated with radial weights, Mass equidistribution for random polynomials, A nonuniform Littlewood-Offord inequality for all norms, Uniformly cross intersecting families, On the security of individual data, Resilience for the Littlewood-Offord problem, Some new results on the Littlewood-Offord problem, Optimal query complexity bounds for finding graphs, New applications of Arak's inequalities to the Littlewood-Offord problem, Resilience for the Littlewood-Offord problem, Toward the history of the Saint St. Petersburg school of probability and statistics. I: Limit theorems for sums of independent random variables, An algebraic inverse theorem for the quadratic Littlewood-Offord problem, and an application to Ramsey graphs, On the distribution of sums of residues, On the singularity of random symmetric matrices, The smallest singular value of inhomogeneous square random matrices, Recent progress in combinatorial random matrix theory, Combinatorial anti-concentration inequalities, with applications, Roots of random polynomials with coefficients of polynomial growth, On the number of real roots of random polynomials, Real zeroes of random analytic functions associated with geometries of constant curvature, On a lemma of Littlewood and Offord on the distribution of certain sums, Real roots near the unit circle of random polynomials, On a lemma of Littlewood and Offord on the distributions of linear combinations of vectors, Braess's paradox for the spectral gap in random graphs and delocalization of eigenvectors, The Littlewood-Offord problem for Markov chains, On global universality for zeros of random polynomials, Reconstructing Weighted Graphs with Minimal Query Complexity, Majorization and Rényi entropy inequalities via Sperner theory, The smallest singular value of heavy-tailed not necessarily i.i.d. random matrices via random rounding, Random polynomials: central limit theorems for the real roots, Real roots of random polynomials with coefficients of polynomial growth: a comparison principle and applications, Arak Inequalities for Concentration Functions and the Littlewood--Offord Problem, Spectrum and pseudospectrum for quadratic polynomials in Ginibre matrices, Entropy Inequalities for Sums in Prime Cyclic Groups, Stronger form of an M-part Sperner theorem, On Parity Check (0,1)-Matrix over $\mathbb{Z}_p$, Central limit theorems from the roots of probability generating functions, On the counting problem in inverse Littlewood–Offord theory, Geometric and o-minimal Littlewood-Offord problems, On the concentration of random multilinear forms and the universality of random block matrices, Roots of random functions: A framework for local universality
