English
Related papers

Related papers: On MPS construction of blocking sets in projective…

200 papers

The equations underlying all supersymmetric solutions of six-dimensional minimal ungauged supergravity coupled to an anti-self-dual tensor multiplet have been known for quite a while, and their complicated non-linear form has hindered all…

High Energy Physics - Theory · Physics 2012-03-30 Iosif Bena , Stefano Giusto , Masaki Shigemori , Nicholas P. Warner

In this paper we consider two pointsets in $\mathrm{PG}(2,q^n)$ arising from a linear set $L$ of rank $n$ contained in a line of $\mathrm{PG}(2,q^n)$: the first one is a linear blocking set of R\'edei type, the second one extends the…

Combinatorics · Mathematics 2021-12-23 Vito Napolitano , Olga Polverino , Paolo Santonastaso , Ferdinando Zullo

In these notes we show that any projective subspace arrangement can be realized as a generalized star configuration variety. This type of interpolation result may be useful in designing linear codes with prescribed codewords of minimum…

Algebraic Geometry · Mathematics 2017-06-01 Stefan Tohaneanu

An $(r,M,2\delta;k)_q$ constant--dimension subspace code, $\delta >1$, is a collection $\cal C$ of $(k-1)$--dimensional projective subspaces of ${\rm PG(r-1,q)}$ such that every $(k-\delta)$--dimensional projective subspace of ${\rm…

Combinatorics · Mathematics 2014-11-14 Antonio Cossidente , Francesco Pavese

One of the main problems of the research area of network coding is to compute good lower and upper bounds of the achievable cardinality of so-called subspace codes in $\operatorname{PG}(n,q)$, i.e., the set of subspaces of $\mathbb{F}_q^n$,…

Combinatorics · Mathematics 2017-09-27 Daniel Heinlein , Sascha Kurz

We define a triangle design as a partition of the set of lines of a projective space into triangles, where a triangle consists of three pairwise intersecting lines with no common point. A triangle design is balanced if all points are…

Combinatorics · Mathematics 2025-07-10 Minjia Shi , Xiaoxiao Li , Denis S. Krotov

Let $\mathrm{PG}(3,q)$ be the projective space of dimension three over the finite field with $q$ elements. Consider a twisted cubic in $\mathrm{PG}(3,q)$. The structure of the point-plane incidence matrix in $\mathrm{PG}(3,q)$ with respect…

Combinatorics · Mathematics 2020-03-03 Daniele Bartoli , Alexander A. Davydov , Stefano Marcugini , Fernanda Pambianco

This article gives the structure of all projective indecomposable modules in blocks with non-cyclic defect group for $n\leq 11$, and almost all in the case of $n=12$, leaving four simple modules for $p=2$ and one simple module for $p=3$.

Representation Theory · Mathematics 2016-05-18 David A. Craven

Intersection numbers for subspace designs are introduced and $q$-analogs of the Mendelsohn and K\"ohler equations are given. As an application, we are able to determine the intersection structure of a putative $q$-analog of the Fano plane…

Combinatorics · Mathematics 2015-10-16 Michael Kiermaier , Mario Osvin Pavčević

Let $\mathbb{M}_n$ denote the structure obtained from Hrushovski's (non collapsed) construction with an n-ary relation and $PG(\mathbb{M}_n)$ its associated pre-geometry. It was shown by Evans and Ferreira that $PG(\mathbb{M}_3)\not\cong…

Logic · Mathematics 2019-06-18 Assaf Hasson , Omer Mermelstein

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

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 $\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

The supersymmetric Poisson Sigma model is studied as a possible worldsheet realization of generalized complex geometry. Generalized complex structures alone do not guarantee non-manifest N=(2,1) or N=(2,2) supersymmetry, but a certain…

High Energy Physics - Theory · Physics 2009-11-10 L. Bergamin

We introduce generator blocking sets of finite classical polar spaces. These sets are a generalisation of maximal partial spreads. We prove a characterization of these minimal sets of the polar spaces Q(2n,q), Q-(2n+1,q) and H(2n,q^2), in…

Combinatorics · Mathematics 2012-02-21 Jan De Beule , Anja Hallez , Klaus Metsch , Leo Storme

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 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

We propose reducible algebraic curves as a mechanism to construct Partial MDS (PMDS) codes geometrically. We obtain new general existence results, new explicit constructions and improved estimates on the smallest field sizes over which such…

Information Theory · Computer Science 2020-07-30 Tristram Bogart , Anna-Lena Horlemann-Trautmann , David Karpuk , Alessandro Neri , Mauricio Velasco

We generalize Block-G\"ottsche polynomials, originally defined for toric del Pezzo surfaces, to arbitrary surfaces. To do this, we show that these polynomials arise as special cases of BPS polynomials, defined for any surface $S$ as Laurent…

Algebraic Geometry · Mathematics 2025-06-04 Hülya Argüz , Pierrick Bousseau

We construct Bing houses in all dimensions $n \geq 3$, obtaining non-separating PL immersions of $\mathbb{S}^n \rightarrow\mathbb{R}^{n+1}$.

Geometric Topology · Mathematics 2020-01-22 Michael Freedman , T. Tam Nguyen Phan