An equitable partition for the distance-regular graph of the bilinear forms
Paul Terwilliger, Jason Williford

TL;DR
This paper introduces an equitable partition called the $(x,y)$-partition for bilinear forms graphs with diameter at least 3, and decomposes the associated $T$-module into orthogonal irreducible components, revealing new algebraic structure.
Contribution
It provides a novel equitable partition for bilinear forms graphs and decomposes the related $T$-module into irreducible modules, advancing understanding of their algebraic properties.
Findings
The $(x,y)$-partition has $6D-2$ subsets with vertices equidistant to fixed vertices.
The $T$-module $U(x,y)$ decomposes into five orthogonal irreducible modules.
Every nonprimary irreducible $T$-module with endpoint one is uniquely characterized.
Abstract
We consider a type of distance-regular graph called a bilinear forms graph. We assume that the diameter of is at least . Fix adjacent vertices . In our first main result, we introduce an equitable partition of that has subsets and the following feature: for every subset in the equitable partition, the vertices in the subset are equidistant to and equidistant to . This equitable partition is called the -partition of . By definition, the subconstituent algebra is generated by the Bose-Mesner algebra of and the dual Bose-Mesner algebra of with respect to . As we will see, for the -partition of the characteristic vectors of the subsets form a basis for a -module . In our second main result, we decompose into an orthogonal direct sum of irreducible…
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.
