On a lemma of Littlewood and Offord

DOI10.1090/S0002-9904-1945-08454-7zbMath0063.01270OpenAlexW2014485295WikidataQ56430235 ScholiaQ56430235MaRDI QIDQ5842843

No author found.

Publication date: 1945

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

Full work available at URL: https://doi.org/10.1090/s0002-9904-1945-08454-7

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial probability (60C05) Power series (including lacunary series) in one complex variable (30B10) Random power series in one complex variable (30B20)

Related Items (only showing first 100 items - show all)

Forbidden induced subposets of given height ⋮ Singularity of sparse Bernoulli matrices ⋮ Multicoloured extremal problems ⋮ The distribution of knots in the Petaluma model ⋮ Extreme \(k\)-families ⋮ Largest family without a pair of posets on consecutive levels of the Boolean lattice ⋮ Adjacency matrices of random digraphs: singularity and anti-concentration ⋮ Non-abelian Littlewood-Offord inequalities ⋮ On the average rank of LYM-sets ⋮ Matchings, cutsets, and chain partitions in graded posets ⋮ Kleitman's conjecture about families of given size minimizing the number of \(k\)-chains ⋮ Random symmetric matrices are almost surely nonsingular. ⋮ Saturated chains of subsets and a random walk ⋮ On subspaces spanned by random selections of \(\pm 1\) vectors ⋮ Convex hulls of more-part Sperner families ⋮ Erdős-Littlewood-Offord problem with arbitrary probabilities ⋮ Explicit exponential lower bounds for exact hyperplane covers ⋮ On the tightest packing of sums of vectors ⋮ On the singularity of random Bernoulli matrices -- novel integer partitions and lower bound expansions ⋮ Saturating Sperner families ⋮ A generalization of the independence number ⋮ Improved approximation of linear threshold functions ⋮ Geometric relationship between parallel hyperplanes, quadrics, and vertices of a hypercube ⋮ A note on the size of \(\mathscr{N}\)-free families ⋮ Sperner type theorems with excluded subposets ⋮ Smallest singular value and limit eigenvalue distribution of a class of non-Hermitian random matrices with statistical application ⋮ On delocalization of eigenvectors of random non-Hermitian matrices ⋮ A non-uniform Littlewood-Offord inequality ⋮ Incomparable copies of a poset in the Boolean lattice. ⋮ A tour of \(M\)-part \(L\)-Sperner families ⋮ A Meshalkin theorem for projective geometries ⋮ On saturated \(k\)-Sperner systems ⋮ A LYM inequality for induced posets ⋮ Inverse Littlewood-Offord problems and the singularity of random symmetric matrices ⋮ A new approach to an old problem of Erdős and Moser ⋮ Generalizing Sperner's lemma to a free module over a special principal ideal ring ⋮ Idempotent ultrafilters, multipleweak mixing and Szemerédi's theorem for generalized polynomials ⋮ Multivariate estimates for the concentration functions of weighted sums of independent, identically distributed random variables ⋮ Optimal inverse Littlewood-Offord theorems ⋮ The Littlewood-Offord problem: Tightest packing and an M-part Sperner theorem ⋮ Estimates for the concentration functions in the Littlewood-Offord problem ⋮ Exact forbidden subposet results using chain decompositions of the cycle ⋮ An upper bound on the size of diamond-free families of sets ⋮ Step-by-step community detection in volume-regular graphs ⋮ Bilinear and quadratic variants on the Littlewood-Offord problem ⋮ The partition method for poset-free families ⋮ Positive and negative cycles in Boolean networks ⋮ Diamond-free subsets in the linear lattices ⋮ A solution of the Sperner-Erdős problem ⋮ Diamond-free families ⋮ Turán problems on non-uniform hypergraphs ⋮ Analogues of Milner's theorem for families without long chains and of vector spaces ⋮ Set families with forbidden subposets ⋮ Supersaturation and stability for forbidden subposet problems. ⋮ Comparable pairs in families of sets ⋮ The smallest singular value of a shifted $d$-regular random square matrix ⋮ Noise stability of weighted majority ⋮ A bound for the maximal probability in the Littlewood-Offord problem ⋮ On the singularity of adjacency matrices for random regular digraphs ⋮ Inverse Littlewood-Offord problems for quasi-norms ⋮ Anti-concentration property for random digraphs and invertibility of their adjacency matrices ⋮ Bounds on maximal families of sets not containing three sets with \(A\cap B \subset C\), \(A \not\subset B\) ⋮ Sampled fictitious play is Hannan consistent ⋮ On Bernoulli decompositions for random variables, concentration bounds, and spectral localization ⋮ An improvement of the general bound on the largest family of subsets avoiding a subposet ⋮ Random matrices: tail bounds for gaps between eigenvalues ⋮ Sperner's theorem on maximal-sized antichains and its generalization ⋮ Orthogonal structures on finite partial orders ⋮ A nonuniform Littlewood-Offord inequality for all norms ⋮ Uniformly cross intersecting families ⋮ Forbidden subposet problems for traces of set families ⋮ Some new results on the Littlewood-Offord problem ⋮ Strong properties in partially ordered sets. I ⋮ Optimal query complexity bounds for finding graphs ⋮ Families of subsets without a given poset in double chains and Boolean lattices ⋮ New applications of Arak's inequalities to the Littlewood-Offord problem ⋮ Old and new applications of Katona's circle ⋮ Toward the history of the Saint St. Petersburg school of probability and statistics. I: Limit theorems for sums of independent random variables ⋮ Balancing Gaussian vectors ⋮ On the singularity of random symmetric matrices ⋮ Anti-concentration for subgraph counts in random graphs ⋮ Recent progress in combinatorial random matrix theory ⋮ Induced and non-induced poset saturation problems ⋮ Traces of antichains ⋮ Reconstructing subsets of \(\mathbb{Z}_n\) ⋮ On cloud-antichains and related configurations ⋮ The Littlewood-Offord problem for Markov chains ⋮ On randomized algorithms for the majority problem ⋮ Forbidden subposet problems in the grid ⋮ Ramsey-Sperner theory ⋮ Sperner properties for groups and relations ⋮ \(Q _{2}\)-free families in the Boolean lattice ⋮ Investigating posets via their maximal chains ⋮ Generalized forbidden subposet problems ⋮ Stronger form of an M-part Sperner theorem ⋮ A class of matroids derived from saturated chain partitions of partially ordered sets ⋮ The Sperner property for posets: A probabilistic approach ⋮ Geometric and o-minimal Littlewood-Offord problems ⋮ Extremal hypergraph problems and convex hulls ⋮ A shorter, simpler, stronger proof of the Meshalkin--Hochberg--Hirsch bounds on componentwise antichains

This page was built for publication: On a lemma of Littlewood and Offord