Isometric embeddings of dual polar graphs in Grassmann graphs over finite fields
Mark Pankov

TL;DR
This paper proves that each dual polar graph can be uniquely embedded in a corresponding Grassmann graph over the same finite field, up to automorphism, highlighting a fundamental geometric relationship.
Contribution
It establishes the uniqueness of isometric embeddings of dual polar graphs into Grassmann graphs over finite fields, up to automorphism.
Findings
Each dual polar graph has a unique isometric embedding in the corresponding Grassmann graph.
The embedding is unique up to graph automorphism.
The result applies to graphs over the same finite field.
Abstract
We consider the Grassmann graphs and dual polar graphs over the same finite field and show that, up to graph automorphism, for every dual polar graph there is the unique isometric embedding in the corresponding Grassmann graph.
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.
Taxonomy
TopicsCooperative Communication and Network Coding
