2020/04/22 by Semin Yoo, Yoo, Semin
Computer Science · Mathematics · #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #Limits and Structures in Graph Theory
paper · pdf · doi:10.48550/arxiv.2004.10742
openalex publication_date 2020/04/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We study graphs coming from quadratic spaces over finite fields via\northogonality which generalize a recent result given by Bishnoi, Ihringer, and\nPepe (2019). More precisely, we study the graph \Γ square(n,k,q) as\nfollows: the vertex set is the set of k-dimensional quadratic subspaces of a\nfixed Lorentzian quadratic space\n( mathbbFqn,x12+\⋯+xn-12+\λ xn2) which are\nisometrically isomorphic to x12+\⋯+xk2. Here \λ is a\nnonsquare in mathbbFq, and two vertices x,y are adjacent if x\n\⊆ y\⊥.\n