Non-trivial t-designs without repeated blocks exist for all t
Discrete Mathematics
Constructing Small Sample Spaces Satisfying Given Constants
SIAM Journal on Discrete Mathematics
Handbook of combinatorics (vol. 1)
Anti-Hadamard matrices, coin weighing, threshold gates, and indecomposable hypergraphs
Journal of Combinatorial Theory Series A
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
A constructive proof of the Lovász local lemma
Proceedings of the forty-first annual ACM symposium on Theory of computing
A constructive proof of the general lovász local lemma
Journal of the ACM (JACM)
Constructive Algorithms for Discrepancy Minimization
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Derandomized constructions of k-wise (almost) independent permutations
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
On the power of correlated randomness in secure computation
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
| Hi-index | 0.00 |
We show the existence of rigid combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, t-designs, and t-wise permutations. In all cases, the sizes of the objects are optimal up to polynomial overhead. The proof of existence is probabilistic. We show that a randomly chosen such object has the required properties with positive yet tiny probability. The main technical ingredient is a special local central limit theorem for suitable lattice random walks with finitely many steps.