English
Related papers

Related papers: Algebraic constructions of complete $m$-arcs

200 papers

Let $m$ be a positive integer and $q$ be a prime power. For large finite base fields $\mathbb F_q$, we show that any curve can be used to produce a complete $m$-arc as long as some generic explicit geometric conditions on the curve are…

Combinatorics · Mathematics 2023-03-27 Luca Bastioni , Giacomo Micheli

Small complete arcs and caps in Galois spaces over finite fields $\fq$ with characteristic greater than 3 are constructed from cubic curves with an isolated double point. For $m$ a divisor of $q+1$, complete plane arcs of size approximately…

Combinatorics · Mathematics 2013-05-16 Nurdagul Anbar , Daniele Bartoli , Massimo Giulietti , Irene Platoni

New upper bounds on the smallest size t_{2}(2,q) of a complete arc in the projective plane PG(2,q) are obtained for 853<= q<= 2879 and q=3511,4096, 4523,5003,5347,5641,5843,6011. For q<= 2377 and q=2401,2417,2437, the relation…

Combinatorics · Mathematics 2010-08-31 Alexander A. Davydov , Giorgio Faina , Stefano Marcugini , Fernanda Pambianco

Some new families of small complete caps in $PG(N,q)$, $q$ even, are described. By using inductive arguments, the problem of the construction of small complete caps in projective spaces of arbitrary dimensions is reduced to the same problem…

Combinatorics · Mathematics 2009-01-06 Alexander A. Davydov , Massimo Giulietti , Stefano Marcugini , Fernanda Pambianco

The subject of this paper is the study of small complete arcs in $\mathrm{PG}(2,q)$, for $q$ odd, with at least $(q+1)/2$ points on a conic. We give a short comprehensive proof of the completeness problem left open by Segre in his seminal…

Combinatorics · Mathematics 2021-05-25 Gülizar Günay , Michel Lavrauw

In a projective plane over a finite field, complete $(k,n)$-arcs with few characters are rare but interesting objects with several applications to finite geometry and coding theory. Since almost all known examples are large, the…

Combinatorics · Mathematics 2023-02-21 Gábor Korchmáros , Gábor Péter Nagy , Tamás Szőnyi

An $(n,r)$-arc in $PG(2,q)$ is a set $B$ of points in $PG(2,q)$ such that each line in $PG(2,q)$ contains at most $r$ elements of $B$ and such that there is at least one line containing exactly $r$ elements of $B$. The value $m_r(2,q)$…

Combinatorics · Mathematics 2021-06-11 Michael Braun

In this paper it has been verified, by a computer-based proof, that the smallest size of a complete arc is 14 in PG(2,31) and in PG(2,32). Some examples of such arcs are also described.

Combinatorics · Mathematics 2010-05-20 Stefano Marcugini , Alfredo Milani , Fernanda Pambianco

An (n,r)-arc in PG(2,q) is a set of n points such that each line contains at most r of the selected points. It is well-known that (n,r)-arcs in PG(2,q) correspond to projective linear codes. Let m_r(2,q) denote the maximal number n of…

Combinatorics · Mathematics 2019-07-19 Michael Braun

In the projective planes $\mathrm{PG}(2,q)$, we collect the smallest known sizes of complete arcs for the regions \begin{align*} &\mbox{all } q\le160001,~~ q \mbox{ prime power};\\ &Q_{4}=\{34 \mbox{ sporadic }q'\mbox{s in the interval…

Tables of sizes of random complete arcs in the plane $PG(2,q)$ are given. The sizes are close to the smallest known sizes of complete arcs in $PG(2,q)$, in particular, to ones constructed by Algorithm FOP (fixed order of points). The random…

New upper bounds on the smallest size t_{2}(2,q) of a complete arc in the projective plane PG(2,q) are obtained for q <= 9109. From these new bounds it follows that for q <= 2621 and q = 2659,2663,2683,2693,2753,2801, the relation…

In this work complete caps in $PG(N,q)$ of size $O(q^{\frac{N-1}{2}}\log^{300} q)$ are obtained by probabilistic methods. This gives an upper bound asymptotically very close to the trivial lower bound $\sqrt{2}q^{\frac{N-1}{2}}$ and it…

Combinatorics · Mathematics 2014-06-20 Daniele Bartoli , Stefano Marcugini , Fernanda Pambianco

In the previous works of the authors, a step-by-step algorithm FOP which uses any fixed order of points in the projective plane $\mathrm{PG}(2,q)$ is proposed to construct small complete arcs. In each step, the algorithm adds to a current…

New upper bounds on the smallest size t_{2}(2,q) of a complete arc in the projective plane PG(2,q) are obtained for 853 <= q <= 4561 and q\in T1\cup T2 where T1={173,181,193,229,243,257,271,277,293,343,373,409,443,449,457,…

We establish that the minimum number of arcs required to partition the Galois projective plane $\text{PG}(2,q)$ is $q+1$. Furthermore, we determine the exact value for a fractional variant of this problem. We extend our analysis to affine…

Combinatorics · Mathematics 2026-01-28 Gabriela Araujo-Pardo , Leonardo Martínez-Sandoval

Bicovering arcs in Galois affine planes of odd order are a powerful tool for constructing complete caps in spaces of higher dimensions. In this paper we investigate whether some arcs contained in nodal cubic curves are bicovering. For…

Combinatorics · Mathematics 2013-05-15 Nurdagul Anbar , Daniele Bartoli , Massimo Giulietti , Irene Platoni

Let $q$ be a prime power; $(q+1,8)$-cages have been constructed as incidence graphs of a non-degenerate quadric surface in projective 4-space $P(4, q)$. The first contribution of this paper is a construction of these graphs in an…

Combinatorics · Mathematics 2011-11-15 M. Abreu , G. Araujo-Pardo , C. Balbuena , D. Labbate

Let $\mathbb{F}_q$ be a field with $q$ elements. In this note, we study some generalized arcs, that is, sets of $\mathbb{F}_q$-points in the projective plane $\mathbb{P}^2(\mathbb{F}_q)$ such that no six of them are on a conic. First, we…

Algebraic Geometry · Mathematics 2019-12-13 Alexis E. Almendras Valdebenito , Andrea Luigi Tironi

For a set $G$ of points in $\PG(m-1,q)$, let $\ex_q(G;n)$, denote the maximum size of a collection of points in $\PG(n-1,q)$ not containing a copy of $G$, up to projective equivalence. We show that \[\lim_{n\rightarrow \infty}…

Combinatorics · Mathematics 2012-03-09 Jim Geelen , Peter Nelson
‹ Prev 1 2 3 10 Next ›