Author:
Kovács Benedek,Nagy Zoltán
Abstract
We study the set of intersection sizes of a $k$-dimensional affine subspace and a point set of size $m \in [0, 2^n]$ of the $n$ dimensional binary affine space $\mathrm{AG}(n,2)$.
Reference13 articles.
1. Axenovich, M., Weber, L. (2021). Absolutely avoidable order-size pairs for induced subgraphs. arXiv preprint arXiv:2106.14908.
2. Bennett, M. (2018). Bounds on sizes of general caps in AG (n, q) via the Croot-Lev-Pach polynomial method. arXiv preprint arXiv:1806.05303.
3. Bose, R. C., Ray-Chaudhuri, D.K. (1960). On a Class of Error Correcting Binary
4. Group Codes. Information and Control 3, pp. 68-79
5. Caro, Y., Lauri, J., Zarb, C. (2021). The feasibility problem for line graphs. arXiv preprint arXiv:2107.13806.