English
Related papers

Related papers: Classification of large partial plane spreads in $…

200 papers

The classification of all semiovals and blocking semiovals in $\mathrm{PG}(2,8)$ and in $\mathrm{PG}(2,9)$ of size less than $17$ is determined. Also, some information on the stabilizer groups and the intersection sizes with lines is given.

Combinatorics · Mathematics 2013-12-10 Daniele Bartoli , Stefano Marcugini , Fernanda Pambianco

It is shown that the maximum size of a binary subspace code of packet length $v=6$, minimum subspace distance $d=4$, and constant dimension $k=3$ is $M=77$; in Finite Geometry terms, the maximum number of planes in $\operatorname{PG}(5,2)$…

Combinatorics · Mathematics 2015-10-16 Thomas Honold , Michael Kiermaier , Sascha Kurz

The maximum size $A_2(8,6;4)$ of a binary subspace code of packet length $v=8$, minimum subspace distance $d=6$, and constant dimension $k=4$ is $257$, where the $2$ isomorphism types are extended lifted maximum rank distance codes. In…

Combinatorics · Mathematics 2018-10-23 Daniel Heinlein , Thomas Honold , Michael Kiermaier , Sascha Kurz , Alfred Wassermann

It is shown that the maximum size $A_2(8,6;4)$ of a binary subspace code of packet length $v=8$, minimum subspace distance $d=4$, and constant dimension $k=4$ is at most $272$. In Finite Geometry terms, the maximum number of solids in…

Combinatorics · Mathematics 2017-03-28 Daniel Heinlein , Sascha Kurz

Subspace codes are collections of subspaces of a projective space such that any two subspaces satisfy a pairwise minimum distance criterion. Recent results have shown that it is possible to construct optimal $(5,3)$ subspace codes from…

Information Theory · Computer Science 2021-05-05 Anirban Ghatak , Sumanta Mukherjee

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

In this work we find new minimum sizes for the maximal partial spreads of PG$(3,q)$, for $q=8,9,16$ and for every $q$ such that $25\leq q\leq 101$. Furthermore, for $q=8,9,16,25$ and 27 we find all the unknown sizes between our minimums and…

Combinatorics · Mathematics 2011-11-15 Maurizio Iurlo , Sandro Rajola

A vector space partition $\mathcal{P}$ of the projective space $\operatorname{PG}(v-1,q)$ is a set of subspaces in $\operatorname{PG}(v-1,q)$ which partitions the set of points. We say that a vector space partition $\mathcal{P}$ has type…

Combinatorics · Mathematics 2023-02-20 Sascha Kurz

A spread of a Hermitian unital in PG(2,q^2) is a set of q^2+q+1 pairwise disjoint blocks that partition the points of the unital. In this paper, we discuss the results of an exhaustive computer search for spreads of Hermitian unitals of…

Combinatorics · Mathematics 2017-02-07 Jeremy M. Dover

In this paper, we prove that the largest pure partial plane of order 6 has size 25. At the same time, we classify all pure partial planes of order 6 and size 25 up to isomorphism. Our major approach is computer search. The search space is…

Combinatorics · Mathematics 2016-11-02 Yibo Gao

In this work we construct a new class of maximal partial spreads in $PG(4,q)$, that we call $q$-added maximal partial spreads. We obtain them by depriving a spread of a hyperplane of some lines and adding $q+1$ lines not of the hyperplane…

Combinatorics · Mathematics 2013-01-24 Sandro Rajola , Maurizio Iurlo

A partial $(k-1)$-spread in $\operatorname{PG}(n-1,q)$ is a collection of $(k-1)$-dimensional subspaces with trivial intersection, i.e., each point is covered at most once. So far the maximum size of a partial $(k-1)$-spread in…

Combinatorics · Mathematics 2016-11-03 Sascha Kurz

In this work, we prove the existence of maximal partial line spreads in PG(5,q) of size q^3+q^2+kq+1, with 1 \leq k \leq (q^3-q^2)/(q+1), k an integer. Moreover, by a computer search, we do this for larger values of k, for q \leq 7. Again…

Combinatorics · Mathematics 2015-11-24 Maurizio Iurlo

In [2] and [19] are presented the first two families of maximum scattered $\mathbb{F}_q$-linear sets of the projective line $\mathrm{PG}(1,q^n)$. More recently in [23] and in [5], new examples of maximum scattered $\mathbb{F}_q$-subspaces…

Combinatorics · Mathematics 2017-09-05 Bence Csajbók , Giuseppe Marino , Ferdinando Zullo

Recently a construction of optimal non-constant dimension subspace codes, also termed projective space codes, has been reported in a paper of Honold-Kiermaier-Kurz. Restricted to binary codes in a 5-dimensional ambient space with minimum…

Information Theory · Computer Science 2017-01-26 Anirban Ghatak

The aim of this survey is to outline the state of the art in research on a class of linearized polynomials with coefficients over finite fields, known as scattered polynomials. These have been studied in several contexts, such as in [A.…

History and Overview · Mathematics 2025-10-08 Giovanni Longobardi

Constant-dimension codes with the maximum possible minimum distance have been studied under the name of partial spreads in Finite Geometry for several decades. Not surprisingly, for this subclass typically the sharpest bounds on the maximal…

Combinatorics · Mathematics 2018-02-01 Thomas Honold , Michael Kiermaier , Sascha Kurz

We provide classification results for translation generalized quadrangles of order less or equal to $64$, and hence, for all incidence geometries related to them. The results consist of the classification of all pseudo-ovals in…

Combinatorics · Mathematics 2024-03-01 Giusy Monzillo , Tim Penttila , Alessandro Siciliano

We generalize the example of linear set presented by the last two authors in "Vertex properties of maximum scattered linear sets of $\mathrm{PG}(1,q^n)$" (2019) to a more general family, proving that such linear sets are maximum scattered…

Combinatorics · Mathematics 2020-02-14 Daniele Bartoli , Corrado Zanella , Ferdinando Zullo

We study how to formalize in the Coq proof assistant the smallest projective space PG(3,2). We then describe formally the spreads and packings of PG(3,2), as well as some of their properties. The formalization is rather straightforward,…

Logic in Computer Science · Computer Science 2022-01-04 Nicolas Magaud
‹ Prev 1 2 3 10 Next ›