Indexed metadata

Some Orbits of a Two-Vertex Stabilizer in a Grassmann Graph

Ian Seong

Source record

Source: Crossref

Published: Nov 14, 2025

DOI: 10.37236/13188

Open original source ↗

Source abstract

Let Fq\mathbb{F}_q denote a finite field with qq elements. Let n,kn,k denote integers with n>2k≥6n>2k\geq 6. Let VV denote a vector space over Fq\mathbb{F}_{q} that has dimension nn. The vertex set of the Grassmann graph Jq(n,k)J_q(n,k) consists of the kk-dimensional subspaces of VV. Two vertices of Jq(n,k)J_q(n,k) are adjacent whenever their intersection has dimension k−1k-1. Let ∂\partial denote the path-length distance function of Jq(n,k)J_q(n,k). Pick vertices x,yx,y of Jq(n,k)J_q(n,k) such that 1<∂(x,y)<k1<\partial(x,y)<k. Let Stab(x,y)\text{Stab}(x,y) denote the subgroup of GL(V)GL(V) that stabilizes both xx and yy. In this paper, we investigate the orbits of Stab(x,y)\text{Stab}(x,y) acting on the local graph Γ(x)\Gamma(x). We show that there are five orbits. By construction, these five orbits give an equitable partition of Γ(x)\Gamma(x); we find the corresponding structure constants. In order to describe the five orbits more deeply, we bring in a Euclidean representation of Jq(n,k)J_q(n,k) associated with the second largest eigenvalue of Jq(n,k)J_q(n,k). By construction, for each orbit its characteristic vector is represented by a vector in the associated Euclidean space. We compute many inner products and linear dependencies involving the five representing vectors.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.