Probabilistic existence of regular combinatorial structures
From MaRDI portal
Publication:2400828
DOI10.1007/s00039-017-0416-9zbMath1369.05024arXiv1302.4295OpenAlexW2732711529MaRDI QIDQ2400828
Ron Peled, Greg Kuperberg, Shachar Lovett
Publication date: 30 August 2017
Published in: Geometric and Functional Analysis. GAFA (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1302.4295
Related Items (18)
Degree sequences of sufficiently dense random uniform hypergraphs ⋮ The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 ⋮ Large sets of \(t\)-designs over finite fields exist for all \(t\) ⋮ Unnamed Item ⋮ Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture ⋮ Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ Existence of small ordered orthogonal arrays ⋮ On perfect sequence covering arrays ⋮ A polynomial construction of perfect sequence covering arrays ⋮ Asymptotic Enumeration of Difference Matrices over Cyclic Groups ⋮ Graph and hypergraph packing ⋮ Enumerating sparse uniform hypergraphs with given degree sequence and forbidden edges ⋮ Coloured and Directed Designs ⋮ A survey on tight Euclidean \(t\)-designs and tight relative \(t\)-designs in certain association schemes ⋮ Asymptotic enumeration of sparse uniform hypergraphs with given degrees ⋮ Large sets with multiplicity ⋮ Chebyshev-type cubature formulas for doubling weighted spheres, balls, and simplexes ⋮ Asymptotic Enumeration of Hypergraphs by Degree Sequence
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a bound of Hoeffding in the complex case
- Optimal asymptotic bounds for spherical designs
- Combinatorics and complexity of partition functions
- Chebyshev-type quadratures for doubling weights
- Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
- A Fourier-analytic approach to counting partial Hadamard matrices
- Maximum entropy Gaussian approximations for the number of integer points and volumes of polytopes
- Averaging sets: A generalization of mean values and spherical designs
- On t-designs
- The representation theory of the symmetric groups
- Orthogonal arrays. Theory and applications
- Anti-Hadamard matrices, coin weighing, threshold gates, and indecomposable hypergraphs
- Moore-Penrose inverse of set inclusion matrices
- Asymptotic enumeration by degree sequence of graphs of high degree
- A diagonal form for the incidence matrices of \(t\)-subsets vs. \(k\)- subsets
- Asymptotic enumeration of correlation-immune Boolean functions
- The module structure of integral designs
- Asymptotic enumeration of dense 0-1 matrices with equal row sums and equal column sums
- An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums
- An Identity Involving the Least Common Multiple of Binomial Coefficients and Its Application
- Almost K-Wise vs. K-Wise Independent Permutations, and Uniformity for General Group Actions
- Longest Increasing and Decreasing Subsequences
- Constructive Discrepancy Minimization by Walking on the Edges
- A constructive proof of the general lovász local lemma
- Large sets of t-designs from groups
- Six Standard Deviations Suffice
- Constructing Small Sample Spaces Satisfying Given Constraints
- On Linear Characterizations of Combinatorial Optimization Problems
- The number of graphs and a random graph with a given degree sequence
- A constructive proof of the Lovász local lemma
- A recursive construction of t -wise uniform permutations
- Small designs for path-connected spaces and path-connected homogeneous spaces
- Probabilistic existence of rigid combinatorial structures
- On the Representations of the Symmetric Group
- Asymptotic Enumeration of Hypergraphs by Degree Sequence
- The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
- Locally Decodable Codes
This page was built for publication: Probabilistic existence of regular combinatorial structures
