Graphs associated with orthogonal collections of k-planes over finite fields
Abstract
We study graphs coming from quadratic spaces over finite fields via orthogonality which generalize a recent result given by Bishnoi, Ihringer, and Pepe (2019). More precisely, we study the graph (n,k,q) as follows: the vertex set is the set of k-dimensional quadratic subspaces of a fixed Lorentzian quadratic space (Fqn,x12+·s+xn-12+λ xn2) which are isometrically isomorphic to x12+·s+xk2. Here λ is a nonsquare in Fq, and two vertices x,y are adjacent if x ⊂eq y.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.