English

Distance-regular graphs with classical parameters that support a uniform structure: case $q \ge 2$

Combinatorics 2023-09-01 v1

Abstract

Let Γ=(X,R)\Gamma=(X,\mathcal{R}) denote a finite, simple, connected, and undirected non-bipartite graph with vertex set XX and edge set R\mathcal{R}. Fix a vertex xXx \in X, and define Rf=R{yz(x,y)=(x,z)}\mathcal{R}_f = \mathcal{R} \setminus \{yz \mid \partial(x,y) = \partial(x,z)\}, where \partial denotes the path-length distance in Γ\Gamma. Observe that the graph Γf=(X,Rf)\Gamma_f=(X,\mathcal{R}_f) is bipartite. We say that Γ\Gamma supports a uniform structure with respect to xx whenever Γf\Gamma_f has a uniform structure with respect to xx in the sense of Miklavi\v{c} and Terwilliger \cite{MikTer}. Assume that Γ\Gamma is a distance-regular graph with classical parameters (D,q,α,β)(D,q,\alpha,\beta) and diameter D4D\geq 4. Recall that qq is an integer such that q∉{1,0}q \not \in \{-1,0\}. The purpose of this paper is to study when Γ\Gamma supports a uniform structure with respect to xx. We studied the case q1q \le 1 in \cite{FMMM}, and so in this paper we assume q2q \geq 2. Let T=T(x)T=T(x) denote the Terwilliger algebra of Γ\Gamma with respect to xx. Under an additional assumption that every irreducible TT-module with endpoint 11 is thin, we show that if Γ\Gamma supports a uniform structure with respect to xx, then either α=0\alpha = 0 or α=q\alpha=q, β=q2(qD1)/(q1)\beta=q^2(q^D-1)/(q-1), and D0(mod6)D \equiv 0 \pmod{6}.

Keywords

Cite

@article{arxiv.2308.16679,
  title  = {Distance-regular graphs with classical parameters that support a uniform structure: case $q \ge 2$},
  author = {Blas Fernández and Roghayeh Maleki and Štefko Miklavič and Giusy Monzillo},
  journal= {arXiv preprint arXiv:2308.16679},
  year   = {2023}
}

Comments

arXiv admin note: substantial text overlap with arXiv:2305.08937

R2 v1 2026-06-28T12:09:18.328Z