Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2306.17081

Saturating linear sets of minimal rank

Daniele Bartoli·Martino Borello·Giuseppe Marino
View original source ↗Read source document ↗Export metadata ↓

Abstract

Saturating sets are combinatorial objects in projective spaces over finite fields that have been intensively investigated in the last three decades. They are related to the so-called covering problem of codes in the Hamming metric. In this paper, we consider the recently introduced linear version of such sets, which is, in turn, related to the covering problem in the rank metric. The main questions in this context are how small the rank of a saturating linear set can be and how to construct saturating linear sets of small rank. Recently, Bonini, Borello, and Byrne provided a lower bound on the rank of saturating linear sets in a given projective space, which is shown to be tight in some cases. In this paper, we provide construction of saturating linear sets meeting the lower bound and we develop a link between the saturating property and the scatteredness of linear sets. The last part of the paper is devoted to show some parameters for which the bound is not tight.

Explore related subjects

math.COcs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Daniele Bartoli, Martino Borello, Giuseppe Marino. 2023-09-21. Saturating linear sets of minimal rank. https://arxiv.org/abs/2306.17081

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗
arXiv2026

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗