Searcharxiv⌕ Search

arXiv · 2610.08237

Maximum $2$-scattered subspaces of $V(r,q^6)$

Abstract

For every prime power $q$ and every integer $r\geq5$ coprime to $6$, we construct a maximum $2$-scattered $\mathbb{F}_q$-subspace of $V(r,q^6)$. The construction is a two-dimensional $\mathbb{F}_{q^r}$-subspace of $\mathbb{F}_{q^{6r}}$, viewed as an $r$-dimensional vector space over $\mathbb{F}_{q^6}$. A trace argument reduces the proof to the complementarity of two $\mathbb{F}_{q^r}$-subspaces. We establish this complementarity by separating two cases, which lead to a cubic polynomial obstruction and a quadratic norm obstruction. The associated rank-metric code is a $[2r,r,4]_{q^6/q}$ MRD code equivalent to its dual. Taking the cases $r=5,7$ and direct sums with the standard dimension-three construction gives maximum $2$-scattered subspaces of $V(r,q^6)$ for every $q$ and every $r\geq3$ except $r=4$. When $q$ is an odd power of $2$, the known dimension-four construction also covers this remaining case.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Francesco Ghiandoni, Alessandro Giannoni. 2026-10-06. Maximum $2$-scattered subspaces of $V(r,q^6)$. https://arxiv.org/abs/2610.08237

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

KEEP EXPLORING

Related papers

Twin-star hypothesis and cycle-free $d$-partitions of $K_{2d}$

In this paper we study an equivalence relation defined on the set of cycle-free $d$-partitions of the complete graph $K_{2d}$. We discuss a conjecture which states that this equivalence relation has only one equivalence class, and show that the conjecture is equivalent with the so called twin-star hypothesis. We check the conjecture in the case $d=4$ and disuses how this relates to the determinant-like map $det^{S^2}$.

math.CO↗

Oriented trees in digraphs without short non-directed cycles

The girth of a graph $G$ is the length of a shortest cycle of $G$. Jiang (JCT-B, 2001) showed that every graph $G$ with girth at least $2\ell+1$ and minimum degree at least $k/\ell$ contains every tree with $k$ edges whose maximum degree does not exceed the minimum degree of $G$. In this paper, we extend Jiang's result to digraphs by proving that every digraph $D$ with no non-directed cycle of length between $3$ and $2\ell$ and minimum semidegree at least $k/\ell$ contains every oriented tree with $k$ edges whose maximum degree does not exceed the minimum semidegree of $D$. This answers a question raised by Stein and Trujillo-Negrete in the affirmative.

math.CO↗

The 3-state Potts model on planar triangulations: explicit algebraic solution

We consider the $3$-state Potts generating function $T(ν,w)$ of planar triangulations; that is, the bivariate series that counts planar triangulations with vertices coloured in $3$ colours, weighted by their size (number of vertices, recorded by the variable $w$) and by the number of monochromatic edges (variable $ν$). This series was proved to be algebraic 15 years ago by Bernardi and the first author: this follows from its link with the solution of a discrete differential equation (DDE), and from general algebraicity results on such equations. However, despite recent progresses on the effective solution of DDEs, the exact value of $T(ν,w)$ has remained unknown so far -- except in the case $ν=0$, corresponding to proper colourings and solved by Tutte in the sixties. We determine here this exact value, proving that $T(ν,w)$ satisfies a polynomial equation of degree $11$ in $T$ and genus $1$ in $w$ and $T$. We prove that the critical value of $ν$ is $ν_c=1+3/\sqrt{47}$, with a critical exponent $6/5$ in the series $T(ν_c, \cdot)$, while the other values of $ν$ yield the usual map exponent $3/2$. By duality of the planar Potts model, our results also characterize the 3-state Potts generating function of planar cubic maps, in which all vertices have degree $3$. In particular, the annihilating polynomial, still of degree $11$, that we obtain for properly 3-coloured cubic maps proves a conjecture by Bruno Salvy from 2009.

math.CO↗