Search arXivSearch

arXiv · 2508.00502

Clubs in projective spaces and three-weight rank-metric codes

Abstract

Linear sets over finite fields are central objects in finite geometry and coding theory, with deep connections to structures such as semifields, blocking sets, KM-arcs, and rank-metric codes. Among them, $i$-clubs, a class of linear sets where all but one point (which has weight $i$) have weight one, have been extensively studied in the projective line but remain poorly understood in higher-dimensional projective spaces. In this paper, we investigate the geometry and algebraic structure of $i$-clubs in projective spaces. We establish upper bounds on their rank by associating them with rank-metric codes and analyzing their parameters via MacWilliams identities. We also provide explicit constructions of $i$-clubs that attain the maximum rank for $i \geq m/2$, and we demonstrate the existence of non-equivalent constructions when $i \leq m-2$. The special case $i = m-1$ is fully classified. Furthermore, we explore the rich geometry of three-weight rank-metric codes, offering new constructions from clubs and partial classification results.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jonathan Mannaert, Paolo Santonastaso, Ferdinando Zullo. 2025-08-01. Clubs in projective spaces and three-weight rank-metric codes. https://arxiv.org/abs/2508.00502

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO