Maximal caps in AG(6,3).
From MaRDI portal
Publication:1008982
Recommendations
Cites work
- 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?)
- 41 is the largest size of a cap in \(PG(4, 4)\)
- Bounds on affine caps
- Caps and codes
- 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)
Cited in
(22)- Partitions of \(\mathrm{AG}(4, 3)\) into maximal caps
- An application of coding theory to estimating Davenport constants
- 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\)
- Demicaps in \(\mathrm{AG}(4,3)\) and maximal cap partitions
- The classification of the largest caps in AG(5, 3)
- Caps and progression-free sets in \(\mathbb{Z}_m^n\)
- On the Erdős-Ginzburg-Ziv constant of finite abelian groups of high rank
- Some exact values of the Harborth constant and its plus-minus weighted analogue
- The largest cap in \(AG\)(4, 4) and its uniqueness
- The catenary degree of Krull monoids. I
- On the Harborth constant of \(C_3 \oplus C_{3p}\)
- The cap set problem and standard diagrams
- Two zero-sum invariants on finite abelian groups
- \textsc{Superset}: A (super)natural variant of the card game \textsc{Set}
- How many cards should you lay out in a game of \textit{EvenQuads}: a detailed study of caps in \(\mathrm{AG}(n, 2)\)
- An asymptotically tight bound for the Davenport constant
- Occurrence of right angles in vector spaces over finite fields
- Extremal problems on the hypercube and the codegree Turán density of complete \(r\)-graphs
- Improved bounds on sizes of generalized caps in \(AG(n,q)\)
- New applications of the polynomial method: the cap set conjecture and beyond
- Bounds on the size of progression-free sets in \(\mathbb{Z}_m^n\)
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)