Counting edges of different types in a local graph of a Grassmann graph
Ian Seong

TL;DR
This paper classifies and counts different types of edges in the local graph of a Grassmann graph, using projective geometry and group actions to understand their structure.
Contribution
It introduces a new classification of edges in Grassmann graphs based on subspace intersections and provides formulas for counting each type within local graphs.
Findings
Counts of each edge type in local graphs are derived.
The action of the stabilizer group partitions the local graph into five orbits.
Results connect subspace intersections with edge classifications in Grassmann graphs.
Abstract
Let denote a finite field with elements. Let denote integers with . Let denote a vector space over that has dimension . The vertex set of the Grassmann graph consists of the -dimensional subspaces of . Two vertices of are adjacent whenever their intersection has dimension . Let denote the path-length distance function of . Pick a vertex . In this paper we define three types of edges in , namely type , type , and type ; for adjacent vertices such that , the type of the edge depends on the subspaces and their intersections with . Pick a vertex such that . Let denote the local graph of in . Our general goal is to count the number of edges in …
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
