Search arXivSearch

arXiv · 2507.23409

Towards the classification of maximum scattered linear sets of $\mathrm{PG}(1,q^5)$

Abstract

Every maximum scattered linear set in $\mathrm{PG}(1,q^5)$ is the projection of an $\mathbb{F}_q$-subgeometry $Σ$ of $\mathrm{PG}(4,q^5)$ from a plane $Γ$ external to the secant variety to $Σ$. The pair $(Γ,Σ)$ will be called a projecting configuration for the linear set. The projecting configurations for the only known maximum scattered linear sets in $\mathrm{PG}(1,q^5)$, namely those of pseudoregulus and LP type, have been characterized in the literature by B. Csajbók, C. Zanella in 2016 and by C. Zanella, F. Zullo in 2020. Let $(Γ,Σ)$ be a projecting configuration for a maximum scattered linear set in $\mathrm{PG}(1,q^5)$, let $σ$ be a generator of $\mathbb{G}=\mathrm{P}Γ\mathrm{L}(5,q^5)_Σ$, and $A=Γ\capΓ^{σ^4}$, $B=Γ\capΓ^{σ^3}$. If $A$ and $B$ are not both points, then the projected linear set is of pseudoregulus type. Then, suppose that they are points. The rank of a point $X$ is the vectorial dimension of the span of the orbit of $X$ under the action of $\mathbb{G}$. In this paper, by investigating the geometric properties of projecting configurations, it is proved that if at least one of the points $A$ and $B$ has rank 5, the associated maximum scattered linear set must be of LP type. Then, if a maximum scattered linear set of a new type exists, it must be such that $\mathrm{rk} A=\mathrm{rk} B=4$. In this paper we derive two possible polynomial forms that such a linear set must have. An exhaustive analysis by computer shows that for $q\leq 25$, no new maximum scattered linear set exists.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Stefano Lia, Giovanni Longobardi, Corrado Zanella. 2026-01-15. Towards the classification of maximum scattered linear sets of $\mathrm{PG}(1,q^5)$. https://arxiv.org/abs/2507.23409

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

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO