Large $(k; r, s; n, q)$-sets in Projective Spaces
Combinatorics
2022-11-14 v2
Abstract
A -set (short: -set) of is a set of points with such that no -space contains more than points of . We investigate the asymptotic size of -sets for fixed and . In particular, we show the existence of -sets of size for , -sets of size , and -sets of size for . We also generalize a bound by Rao from 1947 and show that an -set has size at most if there exist integers such that and .
Cite
@article{arxiv.2211.04329,
title = {Large $(k; r, s; n, q)$-sets in Projective Spaces},
author = {Ferdinand Ihringer and Jacques Verstraëte},
journal= {arXiv preprint arXiv:2211.04329},
year = {2022}
}
Comments
10 pages, removed the part on random polynomials which duplicated recent work by Sudakov and Tomon