English

Large $(k; r, s; n, q)$-sets in Projective Spaces

Combinatorics 2022-11-14 v2

Abstract

A (k;r,s;n,q)(k; r, s; n, q)-set (short: (r,s)(r,s)-set) of PG(n,q)\mathrm{PG}(n, q) is a set of points XX with X=k|X| = k such that no ss-space contains more than rr points of XX. We investigate the asymptotic size of (r,s)(r, s)-sets for nn fixed and qq \rightarrow \infty. In particular, we show the existence of (3,2)(3, 2)-sets of size (1+o(1))q3/2(1+o(1)) q^{3/2} for n=6n=6, (4,2)(4, 2)-sets of size (1+o(1))qn12(1+o(1)) q^{\frac{n-1}{2}}, and (9,2)(9, 2)-sets of size (1+o(1))q2(1+o(1)) q^2 for n=4n=4. We also generalize a bound by Rao from 1947 and show that an (r,s)(r,s)-set has size at most O(qne+1e)O(q^{\frac{n-e+1}{e}}) if there exist integers d,e2d,e \geq 2 such that s=d(e1)s=d(e-1) and r=de1r=de-1.

Keywords

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

R2 v1 2026-06-28T05:26:06.306Z