Maximal caps in AG(6,3).
One of the main problems in studying caps in geometry is the investigation of their maximal size in finite affine and projective planes. While quite some of these numbers are known for planes and 3-dimensional spaces, only sporadic results are available in higher dimensions, see for example [\textit{R. C. Bose}, Sankhyā 8, 107--166 (1947; Zbl 0038.09601)], [\textit{Y. Edel} and \textit{J. Bierbrauer}, Des. Codes Cryptography 16, No. 2, 151--160 (1999; Zbl 0935.51008)], [\textit{R. Hill}, Discrete Math. 22, 111--137 (1978; Zbl 0391.51005), Ann. Discrete Math. 18, 433--447 (1983; Zbl 0505.51013)] and [\textit{B. Qvist}, Ann. Acad. Sci. Fenn., Ser. A I 134, 27 S. (1952; Zbl 0049.10801)]. In the paper under review the author proves that there are no complete 44-caps in AG(5,3). This result is used in showing that the maximal size of a cap in \(\mathrm{AG}(6,3)\) is 112 and that such caps are uniquely determined up to affine equivalence.
- 41 is the largest size of a cap in PG(4, 4)
- Bounds on affine caps
- Caps and codes
- scientific article; zbMATH DE number 3113219 (Why is no real title available?)
- scientific article; zbMATH DE number 3532973 (Why is no real title available?)
- scientific article; zbMATH DE number 3057679 (Why is no real title available?)
- scientific article; zbMATH DE number 3076999 (Why is no real title available?)
- scientific article; zbMATH DE number 3092212 (Why is no real title available?)
- scientific article; zbMATH DE number 3109939 (Why is no real title available?)
- Le geometrie di Galois
- Ovals In a Finite Projective Plane
- Ovoides et groupes de Suzuki
- The card game SET.
- The classification of the largest caps in AG(5, 3)
- The largest cap in AG(4, 4) and its uniqueness
- Occurrence of right angles in vector spaces over finite fields
- The classification of the largest caps in AG(5, 3)
- The cap set problem and standard diagrams
- Caps and progression-free sets in \(\mathbb{Z}_m^n\)
- Demicaps in \(\mathrm{AG}(4,3)\) and maximal cap partitions
- Bounds on the size of progression-free sets in \(\mathbb{Z}_m^n\)
- On the Harborth constant of \(C_3 \oplus C_{3p}\)
- Bounds on sizes of generalized caps in \(\mathrm{AG} (n,q)\) via the Croot-Lev-Pach polynomial method
- Sidon sets and 2-caps in \(\mathbb{F}_3^n\)
- Two zero-sum invariants on finite abelian groups
- Some exact values of the Harborth constant and its plus-minus weighted analogue
- \textsc{Superset}: A (super)natural variant of the card game \textsc{Set}
- The catenary degree of Krull monoids. I
- Extremal problems on the hypercube and the codegree Turán density of complete r-graphs
- An asymptotically tight bound for the Davenport constant
- New applications of the polynomial method: the cap set conjecture and beyond
- Partitions of \(\mathrm{AG}(4, 3)\) into maximal caps
- On the Erdős-Ginzburg-Ziv constant of finite abelian groups of high rank
- Improved bounds on sizes of generalized caps in \(AG(n,q)\)
- How many cards should you lay out in a game of \textit{EvenQuads}: a detailed study of caps in \(\mathrm{AG}(n, 2)\)
- An application of coding theory to estimating Davenport constants
- Maximal line-free sets in \(\mathbb{F}_p^n\)
- How many cards should you lay out in Quad-128: a classification of caps in \(\mathrm{AG}(7,2)\)
- Algebraic capsets
This page was built for publication: Maximal caps in \(\mathrm{AG}(6,3)\).
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1008982)
