Probabilistic existence of large sets of designs

DOI10.1016/j.jcta.2020.105286zbMath1447.05044arXiv1704.07964OpenAlexW2964090305MaRDI QIDQ2194761

Shachar Lovett, Alexander Vardy, Sankeerth Rao

Publication date: 7 September 2020

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1704.07964

zbMATH Keywords

permutationsrandom walkslarge setslatticesprobabilistic methodorthogonal arrayscombinatorial designslocal central limit theorem

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Other designs, configurations (05B30) Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items (3)

The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 ⋮ Large sets of \(t\)-designs over finite fields exist for all \(t\) ⋮ Coloured and Directed Designs

Cites Work

• Unnamed Item
• Unnamed Item
• Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
• On large sets of disjoint Steiner triple systems. IV
• Large sets of \(t\)-designs through partitionable sets: a survey
• On large sets of disjoint Steiner triple systems. I
• A completion of Lu's determination of the spectrum for large sets of disjoint Steiner triple systems
• Locally trivial t-designs and t-designs without repeated blocks
• Constructions for $q$-Ary Constant-Weight Codes
• A constructive proof of the general lovász local lemma
• One-factorizations of the complete graph—A survey
• A Combinatorial Approach to Threshold Schemes
• On threshold schemes from large sets
• A constructive proof of the Lovász local lemma
• Probabilistic existence of rigid combinatorial structures

This page was built for publication: Probabilistic existence of large sets of designs