Almost covers of finite sets of points (2405.16231v1)
Abstract: Let $\mbox{$\cal V$} \subseteq {\mathbb F}n$ be a finite set of points in an affine space. A finite set of affine hyperplanes ${H_1, \ldots ,H_m}$ is said to be an almost cover of $\mbox{$\cal V$}$ and $\mathbf{v}$, if their union $\cup_{j=1}m H_j$ contains $\mbox{$\cal V$}\setminus {\mathbf{v}}$ but does not contain $\mathbf{v}$. We give here a lower bound for the size of a minimal almost cover of $\mbox{$\cal V$}$ and $\mathbf{v}$ in terms of the size of $\mbox{$\cal V$}$ and the dimension $n$. We prove a generalization of Sziklai and Weiner's Theorem. Our simple proof is based on Gr\"obner basis theory.
- Covering all points except one, Journal of Algebraic Combinatorics 32, 59–66, (2010)
- G. Hegedüs and L. Rónyai. Gröbner Bases for Increasing Sequences.” arXiv preprint arXiv:2208.00432 (2022).
- R.E. Jamison, Covering finite fields with cosets of subspaces, Journal of Combinatorial Theory, Series A 22 (1977) 253–266.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.