On a lemma of Littlewood and Offord
From MaRDI portal
Publication:5842843
DOI10.1090/S0002-9904-1945-08454-7zbMath0063.01270OpenAlexW2014485295WikidataQ56430235 ScholiaQ56430235MaRDI QIDQ5842843
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
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
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, Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture, Nearly \(k\)-distance sets, On the Littlewood‐Offord problem for arbitrary distributions, On the probabilistic degree of OR over the reals, Poset Ramsey numbers: large Boolean lattice versus a fixed poset, Anticoncentration and Berry-Esseen bounds for random tensors, Quantitative invertibility of non-Hermitian random matrices, Solution to a problem of Katona on counting cliques of weighted graphs, On the sizes of \(t\)-intersecting \(k\)-chain-free families, A discrete variation of the Littlewood-Offord problem, Multiplicative structures and random walks in o-minimal groups, Antichain codes, The structure of Sperner k-families, Semiantichains and Unichain Coverings in Direct Products of Partial Orders, Sparse recovery properties of discrete random matrices, Singularity of sparse random matrices: simple proofs, Intersecting \(P\)-free families, On the number of Hadamard matrices via anti-concentration, On the smallest singular value of symmetric random matrices, Smooth analysis of the condition number and the least singular value, Probability Mass of Rademacher Sums Beyond One Standard Deviation, Near invariance of the hypercube, Arak's inequalities for concentration functions and the Littlewood-Offord problem, Three layer \(Q _{2}\)-free families in the Boolean lattice, Set Families With a Forbidden Induced Subposet, A Note on Infinite Antichain Density, Chain intersecting families, Fooling Polytopes, Polynomial Data Structure Lower Bounds in the Group Model, The Littlewood-Offord problem in high dimensions and a conjecture of Frankl and Füredi, Anticoncentration and the Exact Gap-Hamming Problem, Symmetric decompositions and the strong Sperner property for noncrossing partition lattices, From the Littlewood-Offord problem to the Circular Law: Universality of the spectral distribution of random matrices, Supersaturation, counting, and randomness in forbidden subposet problems, On Generalized Turán Results in Height Two Posets, Quantitative invertibility of random matrices: a combinatorial perspective, Number of Fixed Points and Disjoint Cycles in Monotone Boolean Networks, Distinct degrees and homogeneous sets, Unnamed Item, Forbidden Intersection Patterns in the Families of Subsets (Introducing a Method), No four subsets forming an \(N\), Reconstructing weighted graphs with minimal query complexity, Sperner's Theorem and a Problem of Erdős, Katona and Kleitman, Siegel’s Lemma Is Sharp, Anti-concentration Inequalities for Polynomials, Bernoulli sums and Rényi entropy inequalities, Local Maxima of Quadratic Boolean Functions, Forbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet Problems, RANDOM MATRICES: THE CIRCULAR LAW, Anti-concentration for polynomials of independent random variables, Random doubly stochastic matrices: the circular law, On crown-free families of subsets, AZ-identities and strict 2-part Sperner properties of product posets, A note on the largest size of families of sets with a forbidden poset, Classroom Notes, Classroom Notes, Classroom Notes, Distinct degrees in induced subgraphs, On polynomial approximations to AC, Subsets of posets minimising the number of chains, On Families of Subsets With a Forbidden Subposet, Largest families without an \(r\)-fork, The distribution of the values of a random power series in the unit disk, Mixed Orthogonal Arrays, k-Dimensional M-Part Sperner Multifamilies, and Full Multitransversals, Induced and non-induced forbidden subposet problems, The Littlewood-Offord problem and invertibility of random matrices, Spheres tangent to all the faces of a simplex, The structure of Sperner k-families, Unnamed Item, A classification of the structures of some Sperner families and superimposed codes, Unnamed Item, Resilience for the Littlewood-Offord problem, On the Rank of Random Sparse Matrices, Proof of a conjecture of Offord, Forbidding rank-preserving copies of a poset, Resilience for the Littlewood-Offord problem, An algebraic inverse theorem for the quadratic Littlewood-Offord problem, and an application to Ramsey graphs, A continuous analogue of Erdős' \(k\)-Sperner theorem, On the number of containments in \(P\)-free families, On the distribution of sums of residues, A simple proof for a forbidden subposet problem, Unnamed Item, Combinatorial anti-concentration inequalities, with applications, Unnamed Item, On the permanent of random Bernoulli matrices, On a lemma of Littlewood and Offord on the distribution of certain sums, On‐line balancing of random inputs, Erdös Conjecture on Sums of Distinct Numbers, Maximum-size antichains in random set-systems, 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, Maximal sized antichains in partial orders, XIV Latin American Symposium on Mathematical Logic (SLALM), A generalization of results of P. Erdős, G. Katona, and D. J. Kleitman concerning Sperner's theorem, Reconstructing Weighted Graphs with Minimal Query Complexity, Majorization and Rényi entropy inequalities via Sperner theory, How many sums of vectors can lie in a circle of diameter \(\sqrt 2?\), The symmetric group, ordered by refinement of cycles, is strongly Sperner, A generalization of some generalizations of Sperner's theorem, The largest projective cube-free subsets of \(\mathbb{Z}_{2^n}\), Edge-statistics on large graphs, Arak Inequalities for Concentration Functions and the Littlewood--Offord Problem, Colouring set families without monochromatic \(k\)-chains, Largest family without \(A \cup B \subseteq C \cap D\), Entropy Inequalities for Sums in Prime Cyclic Groups, Randomized algorithms for the majority problem, On Parity Check (0,1)-Matrix over $\mathbb{Z}_p$, On the counting problem in inverse Littlewood–Offord theory, On the singularity probability of random Bernoulli matrices, Poset-free families and Lubell-boundedness, On the concentration of random multilinear forms and the universality of random block matrices, Polynomial Threshold Functions, Hyperplane Arrangements, and Random Tensors, Abelian groups yield many large families for the diamond problem
