English
Related papers

Related papers: $(r,s)$-sets from Desarguesian ovoids

200 papers

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 1974, J. Thas constructed a new class of maximal arcs for the Desarguesian plane of order $q^2$. The construction relied upon the existence of a regular spread of tangent lines to an ovoid in $\PG(3,q)$ and, in particular, it does apply…

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

We use techniques from algebraic and extremal combinatorics to derive upper bounds on the number of independent sets in several (hyper)graphs arising from finite geometry. In this way, we obtain asymptotically sharp upper bounds for partial…

Combinatorics · Mathematics 2024-04-09 Sam Mattheus , Geertrui Van de Voorde

A $q$-covering design $\mathbb{C}_q(n, k, r)$, $k \ge r$, is a collection $\mathcal X$ of $(k-1)$-spaces of $\mathrm{PG}(n-1, q)$ such that every $(r-1)$-space of $\mathrm{PG}(n-1, q)$ is contained in at least one element of $\mathcal X$ .…

Combinatorics · Mathematics 2019-04-30 Francesco Pavese

In this paper we prove the existence of a complete cap of ${\rm PG}(4n+1, q)$ of size $2(q^{2n+1}-1)/(q-1)$, for each prime power $q>2$. It is obtained by projecting two disjoint Veronese varieties of ${\rm PG}(2n^2+3n, q)$ from a suitable…

Combinatorics · Mathematics 2021-06-01 Antonio Cossidente , Bence Csajbók , Giuseppe Marino , Francesco Pavese

Let $q,d\geq 2$ be integers. Define $$ J(q,d):=\frac 1q \Big( \min_{0<x<1} \frac{1-x^q}{1-x} x^{-\frac{q-1}{d}}\Big). $$ Let $\mbox{$\cal G$}\subseteq {\mathbb R}^n$ be an arbitrary subset. We denote by $d(\mbox{$\cal G$})$ the set of…

Combinatorics · Mathematics 2018-12-31 Gábor Hegedüs

An $m$-general set in $AG(n,q)$ is a set of points such that any subset of size $m$ is in general position. A $3$-general set is often called a capset. In this paper, we study the maximum size of an $m$-general set in $AG(n,q)$,…

Combinatorics · Mathematics 2022-10-04 Michael Tait , Robert Won

Several classes of near-MDS codes of ${\rm PG}(3,q)$ are described. They are obtained either by considering the intersection of an elliptic quadric ovoid and a Suzuki-Tits ovoid of a symplectic polar space ${\cal W}(3, q)$ or starting from…

Combinatorics · Mathematics 2021-06-08 Michela Ceria , Antonio Cossidente , Giuseppe Marino , Francesco Pavese

Let $\mathcal W$ be a non-empty set of points of a finite Desarguesian projective space $\mathrm{PG}(n,q)$. A collection of varieties of $\mathrm{PG}(n,q)$ is \emph{mutually $\mu$-intersecting (relatively to $\mathcal W$)} if its elements…

Combinatorics · Mathematics 2025-08-26 Angela Aguglia , Luca Giuzzi , Viola Siconolfi

Minimal 1-saturating sets in the projective plane $PG(2,q)$ are considered. They correspond to covering codes which can be applied to many branches of combinatorics and information theory, as data compression, compression with distortion,…

Combinatorics · Mathematics 2012-03-07 Daniele Bartoli , Stefano Marcugini , Fernanda Pambianco

A double-normal pair of a finite set $S$ of points from Euclidean space is a pair of points $\{p,q\}$ from $S$ such that $S$ lies in the closed strip bounded by the hyperplanes through $p$ and $q$ that are perpendicular to $pq$. A…

Combinatorics · Mathematics 2015-09-07 János Pach , Konrad J. Swanepoel

A {\em maximal partial ovoid} of a generalized quadrangle is a maximal set of points no two of which are collinear. The problem of determining the smallest size of a maximal partial ovoid in quadrangles has been extensively studied in the…

Metric Geometry · Mathematics 2013-08-09 Jeroen Schillewaert , Jacques Verstraete

The main purpose of this paper is to find double blocking sets in $\mathrm{PG}(2,q)$ of size less than $3q$, in particular when $q$ is prime. To this end, we study double blocking sets in $\mathrm{PG}(2,q)$ of size $3q-1$ admitting at least…

Combinatorics · Mathematics 2019-02-20 Bence Csajbók , Tamás Héger

Let $\mathcal S$ be a Desarguesian $(t-1)$--spread of $PG(rt-1,q)$, $\Pi$ a $m$-dimensional subspace of $PG(rt-1,q)$ and $\Lambda$ the linear set consisting of the elements of $\mathcal S$ with non-empty intersection with $\Pi$. It is known…

Combinatorics · Mathematics 2015-09-28 Luca Giuzzi , Valentina Pepe

We prove that a non-empty set L of at most q^5+q^4+q^3+q^2+q+1 lines of PG(n, q) with the properties that (1) every point of PG(n,q) is incident with either 0 or q+1 elements of L, (2) every plane plane of PG(n, q) is incident with either…

Combinatorics · Mathematics 2014-05-06 Ferdinand Ihringer

We consider a non-degenerate conic in $\PG(2,q^2)$, $q$ odd, that is tangent to $\ell_\infty$ and look at its structure in the Bruck-Bose representation in $\PG(4,q)$. We determine which combinatorial properties of this set of points in…

Combinatorics · Mathematics 2013-08-22 S. G. Barwick , Wen-Ai Jackson

Given integers r>1, n>1 and q> n-2, we consider projective varieties X of dimension r+1 such that through n generic points of X passes a rational curve of degree q, contained in X. More precisely, we study the class X_{r+1,n}(q) of such…

Algebraic Geometry · Mathematics 2010-12-16 Luc Pirio , Jean-Marie Trepreau

We classify nets of conics in Desarguesian projective planes over finite fields of odd order, namely, two-dimensional linear systems of conics containing a repeated line. Our proof is geometric in the sense that we solve the equivalent…

Combinatorics · Mathematics 2020-03-16 Michel Lavrauw , Tomasz Popiel , John Sheekey

This work focuses on higgledy-piggledy sets of $k$-subspaces in $\text{PG}(N,q)$, i.e. sets of projective subspaces that are 'well-spread-out'. More precisely, the set of intersection points of these $k$-subspaces with any $(N-k)$-subspace…

Combinatorics · Mathematics 2022-08-03 Lins Denaux

We show that the metric dimension of a finite projective plane of order $q\geq 23$ is $4q-4$, and describe all resolving sets of that size. Let $\tau_2$ denote the size of the smallest double blocking set in $\mathrm{PG}(2,q)$, the…

Combinatorics · Mathematics 2017-01-31 Tamás Héger , Marcella Takáts