2000 character limit reached
Graphs associated with orthogonal collections of k-planes over finite fields
Published 22 Apr 2020 in math.CO | (2004.10742v2)
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 as follows: the vertex set is the set of -dimensional quadratic subspaces of a fixed Lorentzian quadratic space which are isometrically isomorphic to . Here is a nonsquare in , and two vertices are adjacent if .
Paper Prompts
Sign up for free to create and run prompts on this paper.