The existence of subspace designs
Combinatorics
2023-02-15 v2
Abstract
We prove the existence of subspace designs with any given parameters, provided that the dimension of the underlying space is sufficiently large in terms of the other parameters of the design and satisfies the obvious necessary divisibility conditions. This settles an open problem from the 1970s. Moreover, we also obtain an approximate formula for the number of such designs.
Cite
@article{arxiv.2212.00870,
title = {The existence of subspace designs},
author = {Peter Keevash and Ashwin Sah and Mehtaab Sawhney},
journal= {arXiv preprint arXiv:2212.00870},
year = {2023}
}
Comments
61 pages