Search arXivSearch

arXiv · 2512.12125

An equitable partition for the distance-regular graph of the bilinear forms

Abstract

We consider a type of distance-regular graph $Γ=(X, \mathcal R)$ called a bilinear forms graph. We assume that the diameter $D$ of $Γ$ is at least $3$. Fix adjacent vertices $x,y \in X$. In our first main result, we introduce an equitable partition of $X$ that has $6D-2$ subsets and the following feature: for every subset in the equitable partition, the vertices in the subset are equidistant to $x$ and equidistant to $y$. This equitable partition is called the $(x,y)$-partition of $X$. By definition, the subconstituent algebra $T=T(x)$ is generated by the Bose-Mesner algebra of $Γ$ and the dual Bose-Mesner algebra of $Γ$ with respect to $x$. As we will see, for the $(x,y)$-partition of $X$ the characteristic vectors of the subsets form a basis for a $T$-module $U=U(x,y)$. In our second main result, we decompose $U$ into an orthogonal direct sum of irreducible $T$-modules. This sum has five summands: the primary $T$-module and four irreducible $T$-modules that have endpoint one. We show that every irreducible $T$-module with endpoint one is isomorphic to exactly one of the nonprimary summands.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Paul Terwilliger, Jason Williford. 2025-12-13. An equitable partition for the distance-regular graph of the bilinear forms. https://doi.org/10.1007/s00373-026-03033-9

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Random algebraic constructions for extremal and Ramsey problems

Building on Bukh's random algebraic method, we develop a framework for extremal and Ramsey problems involving apex hypergraphs. If $\mathcal{H}$ is a $(d-1)$-partite $(d-1)$-uniform hypergraph with $S$ edges and $\mathcal{H}(t)$ is obtained by adjoining $t$ vertices with common link $\mathcal{H}$, we prove that $\operatorname{ex}(n,\mathcal{H}(t))=Ω_{\mathcal{H}}(n^{d-1/S})$ for $t>9^{S+o_d(S)}$, which is best possible when $\mathcal{H}$ is Sidorenko. Our framework also yields sharper sided Zarankiewicz bounds, quantitative generalized Tur'an bounds, and diagonal multicolor Ramsey constructions. For each fixed $s\geq 2$ and $K\geq 3$, we further prove $\operatorname{r}_K(\mathcal K_{s,t};\mathcal K_n) =Θ_{s,t,K}((n/\log n)^s)$ for $t>9^{s+o(s)}$, extending a theorem of Alon and Rödl from factorial to exponential $t$. The main ingredients are interpolation on $m$-independent varieties, control of the dependencies imposed by symmetry, and linear spaces of forms whose nonzero members remain regular after a common algebraic slice. Limited edge independence then gives the spectral and local-density estimates needed for the Ramsey application.

math.CO

A note on vertex-critical induced subgraphs of shift graphs

Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In this note, we identify a surprising property: for each integer $k \geq 1$, the smallest $k$-chromatic shift graph contains a \emph{unique} induced $k$-vertex-critical subgraph. We give an explicit description of this subgraph and prove its uniqueness. This provides a new family of vertex-critical triangle-free graphs of arbitrarily large chromatic number.

math.CO