English
Related papers

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

200 papers

A $(k; r, s; n, q)$-set (short: $(r,s)$-set) of $\mathrm{PG}(n, q)$ is a set of points $X$ with $|X| = k$ such that no $s$-space contains more than $r$ points of $X$. We investigate the asymptotic size of $(r, s)$-sets for $n$ fixed and $q…

Combinatorics · Mathematics 2022-11-14 Ferdinand Ihringer , Jacques Verstraëte

A $4$-general set in ${\rm PG}(n,q)$ is a set of points of ${\rm PG}(n,q)$ spanning the whole ${\rm PG}(n,q)$ and such that no four of them are on a plane. Such a pointset is said to be complete if it is not contained in a larger…

Combinatorics · Mathematics 2023-05-24 Francesco Pavese

This paper studies {\em strong blocking sets} in the $N$-dimensional finite projective space $\mathrm{PG}(N,q)$. We first show that certain unions of blocking sets cannot form strong blocking sets, which leads to a new lower bound on the…

Combinatorics · Mathematics 2024-02-13 Stefano Lia , Geertrui Van de Voorde

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 a projective plane $\Pi_{q}$ (not necessarily Desarguesian) of order $q$, a point subset $\mathcal{S}$ is saturating (or dense) if any point of $\Pi_{q}\setminus \mathcal{S}$ is collinear with two points in $\mathcal{S}$. Modifying an…

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

A $\varrho$-saturating set of $\text{PG}(N,q)$ is a point set $\mathcal{S}$ such that any point of $\text{PG}(N,q)$ lies in a subspace of dimension at most $\varrho$ spanned by points of $\mathcal{S}$. It is generally known that a…

Combinatorics · Mathematics 2022-09-07 Lins Denaux

Let PG$(r, q)$ be the $r$-dimensional projective space over the finite field ${\rm GF}(q)$. A set $\cal X$ of points of PG$(r, q)$ is a cutting blocking set if for each hyperplane $\Pi$ of PG$(r, q)$ the set $\Pi \cap \cal X$ spans $\Pi$.…

Combinatorics · Mathematics 2020-11-24 Daniele Bartoli , Antonio Cossidente , Giuseppe Marino , Francesco Pavese

We provide a characterisation of $(n-1)$-spreads in $\mathrm{PG}(rn-1,q)$ that have $r$ normal elements in general position. In the same way, we obtain a geometric characterisation of Desarguesian $(n-1)$-spreads in $\mathrm{PG}(rn-1,q)$,…

Combinatorics · Mathematics 2017-03-09 Sara Rottey , John Sheekey

Let $n$ be a positive integer. Denote by $\mathrm{PG}(n,q)$ the $n$-dimensional projective space over the finite field $\mathbb{F}_q$ of order $q$. A blocking set in $\mathrm{PG}(n,q)$ is a set of points that has non-empty intersection with…

Group Theory · Mathematics 2009-01-14 Alireza Abdollahi

Let $\mathrm{PG}(n-1,q)$ denote the $(n-1)$-dimensional projective space over $\mathbb{F}_q$. We investigate the intersection of two Desarguesian $(h-1)$-spreads of $\mathrm{PG}(kh-1,q)$ and show that it is determined by a subgeometry over…

Combinatorics · Mathematics 2026-05-22 Antonio Cossidente , Giuseppe Marino , Francesco Pavese , Paolo Santonastaso , John Sheekey

In this paper, we show that a set of q+a hyperplanes, q>13, a<(q-10)/4, that does not cover PG(n,q), does not cover at least q^(n-1)-aq^(n-2) points, and show that this lower bound is sharp. If the number of non- covered points is at most…

Combinatorics · Mathematics 2012-10-04 Stefan Dodunekov , Leo Storme , Geertrui Van de Voorde

We construct two-weight sets in PG$(3n-1,q)$, $n\geq2$ with the same weights as those that would arise from the blow-up of a maximal $q$-arc in PG$(2,q^n)$. The construction is of particular interest when $q$ is odd, as it is well known…

Combinatorics · Mathematics 2023-11-03 Stefaan De Winter

A $t$-fold blocking set of the finite Desarguesian plane $\mathrm{PG}(2,p^n)$, $p$ prime, is a set of points meeting each line of the plane in at least $t$ points. The minimum size of such sets is of interest for numerous reasons; however,…

Combinatorics · Mathematics 2026-01-01 Bence Csajbók , Máté Róbert Kepes , Eszter Robin , Bence Sógor , Sherry Wang , Elias Williams

An untouchable set in a projective plane is a set of points such that no line of the plane meets the set in exactly one point. Recently, H\'eger and Nagy (Avoiding Secants of Given Size in Finite Projective Planes, J. Combin. Des.…

Combinatorics · Mathematics 2025-05-14 Jeremy M. Dover

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 a projective plane $\Pi _{q}$ (not necessarily Desarguesian) of order $q,$ a point subset $S$ is saturating (or dense) if any point of $\Pi _{q}\setminus S$ is collinear with two points in$~S$. Using probabilistic methods, the following…

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

In this paper, we analyze the structure of maximal sets of $k$-dimensional spaces in $\mathrm{PG}(n,q)$ pairwise intersecting in at least a $(k-2)$-dimensional space, for $3 \leq k\leq n-2$. We give an overview of the largest examples of…

Combinatorics · Mathematics 2020-05-13 Jozefien D'haeseleer , Giovanni Longobardi , Ago-Erik Riet , Leo Storme

Given a large finite point set, $P\subset \mathbb R^2$, we obtain upper bounds on the number of triples of points that determine a given pair of dot products. That is, for any pair of positive real numbers, $(\alpha, \beta)$, we bound the…

Combinatorics · Mathematics 2015-02-09 Daniel Barker , Steven Senger
‹ Prev 1 2 3 10 Next ›