English
Related papers

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

200 papers

Theoretical results are known about the completeness of a planar algebraic cubic curve as a (n,3)-arc in PG(2,q). They hold for q big enough and sometimes have restriction on the characteristic and on the value of the j-invariant. We…

Combinatorics · Mathematics 2015-10-29 Daniele Bartoli , Stefano Marcugini , Fernanda Pambianco

A subset of $\mathbb{F}_q^2$ is called an arc if it does not contain three collinear points. We show that there are at most $\binom{(1 + o(1))q}{m}$ arcs of size $m \gg q^{1/2} (\log q)^{3/2}$, nearly matching a trivial lower bound…

Combinatorics · Mathematics 2024-10-30 Rajko Nenadov

A lower bound on the minimum degree of the plane algebraic curves containing every point in a large point-set $K$ of the Desarguesian plane $PG(2,q)$ is obtained. The case where $K$ is a maximal $(k,n)$-arc is considered to greater extent.

Combinatorics · Mathematics 2009-07-18 A. Aguglia , L. Giuzzi , G. Korchmaros

In this paper, we study KM-arcs in $PG(2, q)$, the Desarguesian projective plane of order $q$. A KM-arc A of type $t$ is a natural generalisation of a hyperoval: it is a set of $q + t$ points in $PG(2, q)$ such that every line of $PG(2,q)$…

Combinatorics · Mathematics 2017-05-19 Maarten De Boeck , Geertrui Van de Voorde

We prove that, if $q$ is large enough, the set of the $\mathbb{F}_{q^6}$-rational points of the Hermitian curve is a complete $(q+1)$-arc in $\mathrm{PG}(2,\mathbb{F}_{q^6})$, addressing an open case from a recent paper by Korchm\'aros,…

Combinatorics · Mathematics 2023-06-05 Daniele Bartoli , Marco Timpanella

For $q=p^r$ with a prime $p\ge 7$ such that $q \equiv 1$ or $19\pmod {30},$ the desarguesian projective plane $PG(2,q)$ of order $q$ has a unique conjugacy class of projectivity groups isomorphic to the alternating group $A_6$ of degree 6.…

Combinatorics · Mathematics 2011-09-01 Massimo Giulietti , Gabor Korchmaros , Stefano Marcugini , Fernanda Pambianco

An $n$-arc in a projective plane is a collection of $n$ distinct points in the plane, no three of which lie on a line. Formulas counting the number of $n$-arcs in any finite projective plane of order $q$ are known for $n \le 8$. In 1995,…

Combinatorics · Mathematics 2017-06-13 Nathan Kaplan , Susie Kimport , Rachel Lawrence , Luke Peilen , Max Weinreich

Explicit constructions of infinite families of scattered ${\mathbb F}_q$--linear sets in $PG(r-1,q^t)$ of maximal rank $\frac{rt}2$, for $t$ even, are provided. When $q=2$ and $r$ is odd, these linear sets correspond to complete caps in…

Combinatorics · Mathematics 2015-12-24 Daniele Bartoli , Massimo Giulietti , Giuseppe Marino , Olga Polverino

The structure of all graphs having minimum rank at most k over a finite field with q elements is characterized for any possible k and q. A strong connection between this characterization and polarities of projective geometries is explained.…

Combinatorics · Mathematics 2008-01-22 Jason Grout

To construct a Paley graph, we fix a finite field and consider its elements as vertices of the Paley graph. Two vertices are connected by an edge if their difference is a square in the field. We will study some important properties of the…

Combinatorics · Mathematics 2012-03-09 Ahmed Noubi Elsawy

A {\em generalized hyperfocused arc} $\mathcal H $ in $PG(2,q)$ is an arc of size $k$ with the property that the $k(k-1)/2$ secants can be blocked by a set of $k-1$ points not belonging to the arc. We show that if $q$ is a prime and…

Combinatorics · Mathematics 2013-04-15 A. Blokhuis , G. Marino , F. Mazzocca

A subset $\mathcal{S}$ of a conic $\mathcal{C}$ in the projective plane $\mathrm{PG}(2,q)$ is called almost complete (AC-subset for short) if it can be extended to a larger arc in $\mathrm{PG}(2,q)$ only by the points of…

Combinatorics · Mathematics 2017-12-29 Daniele Bartoli , Alexander A. Davydov , Stefano Marcugini , Fernanda Pambianco

Blocking semiovals and the determination of their (minimum) sizes constitute one of the central research topics in finite projective geometry. In this article we introduce the concept of blocking set with the $r_\infty$-property in a finite…

Combinatorics · Mathematics 2025-07-31 Marilena Crupi , Antonino Ficarra

A $2$-semiarc is a pointset ${\mathcal S}_k$ with the property that the number of tangent lines to ${\mathcal S}_k$ at each of its points is two. Using some theoretical results and computer aided search, the complete classification of…

Combinatorics · Mathematics 2014-07-23 Daniele Bartoli , Giorgio Faina , György Kiss , Stefano Marcugini , Fernanda Pambianco

In 2018, Legrand and Paran proved a weaker form of the Inverse Galois Problem for all Hilbertian fields and all finite groups: that is, there exist possibly non-Galois extensions over given Hilbertian base field with given finite group as…

Number Theory · Mathematics 2025-04-01 M Krithika , P Vanchinathan

In this note we construct a new infinite family of $(q-1)$-regular graphs of girth $8$ and order $2q(q-1)^2$ for all prime powers $q\ge 16$, which are the smallest known so far whenever $q-1$ is not a prime power or a prime power plus one…

Combinatorics · Mathematics 2015-01-13 M. Abreu , G. Araujo-Pardo , C. Balbuena , D. Labbate

Let $\mathrm{PG}(k-1,q)$ be the $(k-1)$-dimensional projective space over the finite field $\mathbb{F}_q$. An arc in $\mathrm{PG}(k-1,q)$ is a set of points with the property that any $k$ of them span the entire space. The notion of…

Combinatorics · Mathematics 2026-02-27 Francesco Pavese , Paolo Santonastaso

In this paper, we give a geometric construction of the three strong non-lifted $(3\mod{5})$-arcs in $\operatorname{PG}(3,5)$ of respective sizes 128, 143, and 168, and construct an infinite family of non-lifted, strong $(t\mod{q})$-arcs in…

Combinatorics · Mathematics 2023-08-29 Sascha Kurz , Ivan Landjev , Francesco Pavese , Assia Rousseva

In the projective space $\mathrm{PG}(N,q)$ over the Galois field of order $q$, $N\ge3$, an iterative step-by-step construction of complete caps by adding a new point on every step is considered. It is proved that uncovered points are evenly…

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

Explicit construction of Ramsey graphs has remained a challenging open problem for a long time. Frankl--Wilson \cite{FW}, Alon \cite{A} and Grolmusz \cite{G2} gave the best explicit constructions of graphs on $m$ vertices with no clique or…

Combinatorics · Mathematics 2015-01-06 Gábor Hegedüs