Papers
Topics
Authors
Recent
Search
2000 character limit reached

Some orbits of a two-vertex stabilizer in a Grassmann graph

Published 7 Jul 2024 in math.CO | (2407.06239v1)

Abstract: Let $\mathbb{F}q$ denote a finite field with $q$ elements. Let $n,k$ denote integers with $n>2k\geq 6$. Let $V$ denote a vector space over $\mathbb{F}{q}$ that has dimension $n$. The vertex set of the Grassmann graph $J_q(n,k)$ consists of the $k$-dimensional subspaces of $V$. Two vertices of $J_q(n,k)$ are adjacent whenever their intersection has dimension $k-1$. Let $\partial$ denote the path-length distance function of $J_q(n,k)$. Pick vertices $x,y$ of $J_q(n,k)$ such that $1<\partial(x,y)<k$. Let $\text{Stab}(x,y)$ denote the subgroup of $GL(V)$ that stabilizes both $x$ and $y$. In this paper, we investigate the orbits of $\text{Stab}(x,y)$ acting on the local graph $\Gamma(x)$. We show that there are five orbits. By construction, these five orbits give an equitable partition of $\Gamma(x)$; we find the corresponding structure constants. In order to describe the five orbits more deeply, we bring in a Euclidean representation of $J_q(n,k)$ associated with the second largest eigenvalue of $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.

Authors (1)
Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.