Pages that link to "Item:Q5842843"
From MaRDI portal
The following pages link to On a lemma of Littlewood and Offord (Q5842843):
Displaying 50 items.
- Adjacency matrices of random digraphs: singularity and anti-concentration (Q313537) (← links)
- Non-abelian Littlewood-Offord inequalities (Q317353) (← links)
- On the singularity of random Bernoulli matrices -- novel integer partitions and lower bound expansions (Q360357) (← links)
- Saturating Sperner families (Q367051) (← links)
- Improved approximation of linear threshold functions (Q371200) (← links)
- Geometric relationship between parallel hyperplanes, quadrics, and vertices of a hypercube (Q375961) (← links)
- Sperner type theorems with excluded subposets (Q385154) (← links)
- On saturated \(k\)-Sperner systems (Q405311) (← links)
- Inverse Littlewood-Offord problems and the singularity of random symmetric matrices (Q410097) (← links)
- A new approach to an old problem of Erdős and Moser (Q412182) (← links)
- Diamond-free subsets in the linear lattices (Q466889) (← links)
- Turán problems on non-uniform hypergraphs (Q470944) (← links)
- Set families with forbidden subposets (Q490910) (← links)
- Supersaturation and stability for forbidden subposet problems. (Q490923) (← links)
- Comparable pairs in families of sets (Q490990) (← links)
- A bound for the maximal probability in the Littlewood-Offord problem (Q504000) (← links)
- On the singularity of adjacency matrices for random regular digraphs (Q510262) (← links)
- Inverse Littlewood-Offord problems for quasi-norms (Q512266) (← links)
- Anti-concentration property for random digraphs and invertibility of their adjacency matrices (Q512330) (← links)
- An improvement of the general bound on the largest family of subsets avoiding a subposet (Q523149) (← links)
- Random matrices: tail bounds for gaps between eigenvalues (Q525097) (← links)
- Strong properties in partially ordered sets. I (Q585230) (← links)
- On the tightest packing of sums of vectors (Q594101) (← links)
- A tour of \(M\)-part \(L\)-Sperner families (Q618322) (← links)
- Idempotent ultrafilters, multipleweak mixing and Szemerédi's theorem for generalized polynomials (Q628349) (← links)
- Optimal inverse Littlewood-Offord theorems (Q633617) (← links)
- Diamond-free families (Q654889) (← links)
- Families of subsets without a given poset in double chains and Boolean lattices (Q722595) (← links)
- New applications of Arak's inequalities to the Littlewood-Offord problem (Q723356) (← links)
- Balancing Gaussian vectors (Q731362) (← links)
- On cloud-antichains and related configurations (Q757448) (← links)
- \(Q _{2}\)-free families in the Boolean lattice (Q766139) (← links)
- Investigating posets via their maximal chains (Q781532) (← links)
- Generalized forbidden subposet problems (Q781542) (← links)
- Random symmetric matrices are almost surely nonsingular. (Q854582) (← links)
- Incomparable copies of a poset in the Boolean lattice. (Q890018) (← links)
- Multivariate estimates for the concentration functions of weighted sums of independent, identically distributed random variables (Q906008) (← links)
- Estimates for the concentration functions in the Littlewood-Offord problem (Q906766) (← links)
- Exact forbidden subposet results using chain decompositions of the cycle (Q907216) (← links)
- Bounds on maximal families of sets not containing three sets with \(A\cap B \subset C\), \(A \not\subset B\) (Q953271) (← links)
- On Bernoulli decompositions for random variables, concentration bounds, and spectral localization (Q957727) (← links)
- Uniformly cross intersecting families (Q987560) (← links)
- Optimal query complexity bounds for finding graphs (Q991004) (← links)
- On randomized algorithms for the majority problem (Q1028119) (← links)
- Stronger form of an M-part Sperner theorem (Q1052319) (← links)
- A class of matroids derived from saturated chain partitions of partially ordered sets (Q1054739) (← links)
- The Sperner property for posets: A probabilistic approach (Q1057860) (← links)
- Extremal hypergraph problems and convex hulls (Q1066910) (← links)
- Saturated chains of subsets and a random walk (Q1114686) (← links)
- On subspaces spanned by random selections of \(\pm 1\) vectors (Q1115445) (← links)
