Small complete arcs in projective planes
From MaRDI portal
Publication:1416167
DOI10.1007/s00493-003-0024-1zbMath1027.05015OpenAlexW2158815455MaRDI QIDQ1416167
Publication date: 14 December 2003
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-003-0024-1
Related Items
Upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane based on computer search, On maximal sum-free sets in abelian groups, A construction of small complete caps in projective spaces, Small Complete Caps from Singular Cubics, On Small Complete Arcs and Transitive A5-Invariant Arcs in the Projective Plane PG(2,q), Probabilistic constructions in generalized quadrangles, The extensible no-three-in-line problem, On complete \(m\)-arcs, Algebraic constructions of complete \(m\)-arcs, Small complete caps in PG(4n+1,q)${\rm PG}(4n+1, q)$, Saturating sets in projective planes and hypergraph covers, New upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane, On sizes of complete arcs in \(PG(2,q)\), Minimal multiple blocking sets, Conjectural upper bounds on the smallest size of a complete cap in \(\mathrm{PG}(N,q)\), \(N\geq 3\), Upper bounds on the smallest size of a complete cap in \(\mathrm{PG}(3, q)\) and \(\mathrm{PG}(4, q)\), New inductive constructions of complete caps inPG(N, q),qeven, New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help, Maximum scattered linear sets and complete caps in Galois spaces, Random constructions and density results, Upper bounds on the smallest size of a complete cap in $\mathrm{PG}(N,q)$, $N\ge3$, under a certain probabilistic conjecture, On the maximality of linear codes, On a refinement of Waring's problem, New types of estimates for the smallest size of complete arcs in a finite Desarguesian projective plane, Upper bounds on the smallest size of a complete arc in \(\mathrm{PG}(2, {q})\) under a certain probabilistic conjecture
