Probabilistic existence of rigid combinatorial structures

DOI10.1145/2213977.2214075zbMath1286.60027arXiv1111.0492OpenAlexW2962937204MaRDI QIDQ5415537

Ron Peled, Shachar Lovett, Greg Kuperberg

Publication date: 13 May 2014

Published in: Proceedings of the forty-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

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

zbMATH Keywords

permutationsdesignsprobabilistic methodorthogonal arrayslocal central limit theorem

Mathematics Subject Classification ID

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

Related Items

Counting Steiner triple systems ⋮ Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees ⋮ Double roots of random Littlewood polynomials ⋮ Probabilistic existence of regular combinatorial structures ⋮ Counting \(r\)-graphs without forbidden configurations ⋮ Nontrivial \(t\)-designs over finite fields exist for all \(t\) ⋮ Probabilistic existence of large sets of designs ⋮ On the discrepancy of random matrices with many columns

This page was built for publication: Probabilistic existence of rigid combinatorial structures