English
Related papers

Related papers: Blocking Planes by Lines in $\operatorname{PG}(n,q…

200 papers

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

It is well know that the theory of minimal blocking sets is studied by several author. Another theory which is also studied by a large number of researchers is the theory of hyperplane arrangements. We can remark that the affine space…

Information Theory · Computer Science 2008-02-15 Simona Settepanella

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

A small minimal k-blocking set B in PG(n, q), q = pt, p prime, is a set of less than 3(qk + 1)/2 points in PG(n, q), such that every (n - k)-dimensional space contains at least one point of B and such that no proper subset of B satisfies…

Combinatorics · Mathematics 2012-01-17 Geertrui Van de Voorde

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

A blocking semioval is a set of points in a projective plane that is both a blocking set (i.e., every line meets the set, but the set contains no line) and a semioval (i.e., there is a unique tangent line at each point). The smallest size…

Combinatorics · Mathematics 2023-05-09 Jeremy M. Dover

In this paper, we show that a small minimal k-blocking set in PG(n, q3), q = p^h, h >= 1, p prime, p >=7, intersecting every (n-k)-space in 1 (mod q) points, is linear. As a corollary, this result shows that all small minimal k-blocking…

Combinatorics · Mathematics 2012-01-17 Michel Lavrauw , Leo Storme , Geertrui Van de Voorde

We prove that a minimal $t$-fold blocking set in a finite projective plane of order $n$ has cardinality at most \[\frac{1}{2} n\sqrt{4tn - (3t + 1)(t - 1)} + \frac{1}{2} (t - 1)n + t.\] This is the first general upper bound on the size of…

Combinatorics · Mathematics 2018-12-14 Anurag Bishnoi , Sam Mattheus , Jeroen Schillewaert

In this paper, we characterise the smallest sets $B$ consisting of points and hyperplanes in $\text{PG}(n,q)$, such that each $k$-space is incident with at least one element of $B$. If $k > \frac {n-1} 2$, then the smallest construction…

Combinatorics · Mathematics 2023-12-05 Sam Adriaensen , Maarten De Boeck , Lins Denaux

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

In this paper, we show that a small minimal blocking set with exponent e in PG(n,p^t), p prime, spanning a (t/e-1)-dimensional space, is an F_p^e-linear set, provided that p>5(t/e)-11. As a corollary, we get that all small minimal blocking…

Combinatorics · Mathematics 2012-10-04 Peter Sziklai , Geertrui Van de Voorde

We describe small dominating sets of the incidence graphs of finite projective planes by establishing a stability result which shows that dominating sets are strongly related to blocking and covering sets. Our main result states that if a…

Combinatorics · Mathematics 2016-12-19 Tamás Héger , Zoltán Lóránt Nagy

In a 2022, Bartoli, Cossidente, Marino, and Pavese proved that in the projective space ${\rm PG}(3,q^3)$, one can find three $\mathbb F_q$-subgeometries such that the union of their point sets is a strong blocking set. This proves the…

Combinatorics · Mathematics 2025-11-20 Sam Adriaensen , Peter Sziklai , Zsuzsa Weiner

A blocking set in an affine plane is a set of points $B$ such that every line contains at least one point of $B$. The best known lower bound for blocking sets in arbitrary (non-desarguesian) affine planes was derived in the 1980's by Bruen…

Combinatorics · Mathematics 2018-04-26 Maarten De Boeck , Geertrui Van de Voorde

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

We present a construction for minimal blocking sets with respect to $(k-1)$-spaces in $\mathrm{PG}(n-1,q^t)$, the $(n-1)$-dimensional projective space over the finite field $\mathbb{F}_{q^t}$ of order $q^t$. The construction relies on the…

Combinatorics · Mathematics 2015-12-16 Geertrui Van de Voorde

We improve on the lower bound of the maximum number of planes in $\operatorname{PG}(8,q)\cong\F_q^{9}$ pairwise intersecting in at most a point. In terms of constant dimension codes this leads to $A_q(9,4;3)\ge q^{12}+…

Combinatorics · Mathematics 2019-12-02 Sascha Kurz

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

We consider the orbits of the group $G=PGL_2(q)$ on the points, lines and planes of the projective space $PG(3,q)$ over a finite field $\mathbb F_q$ of characteristic different from $2$ and $3$. The points of $PG(3,q)$ can be identified…

Combinatorics · Mathematics 2025-09-22 Krishna Kaipa , Puspendu Pradhan

Recently, a lower bound was established on the size of linear sets in projective spaces, that intersect a hyperplane in a canonical subgeometry. There are several constructions showing that this bound is tight. In this paper, we generalize…

Combinatorics · Mathematics 2026-01-28 Sam Adriaensen , Paolo Santonastaso
‹ Prev 1 2 3 10 Next ›