相关论文: Some matrices associated with the split decomposit…

Let $\Gamma$ denote a $Q$-polynomial distance-regular graph with diameter at least three and standard module $V$. We introduce two direct sum decompositions of $V$. We call these the displacement decomposition for $\Gamma$ and the split…

Let $\Gamma$ denote a $Q$-polynomial distance-regular graph with diameter $D \geq 3$ and standard module $V$. Recently Ito and Terwilliger introduced four direct sum decompositions of $V$; we call these the $(\mu,\nu)$--{\it split…

We consider a 2-homogeneous bipartite distance-regular graph $\Gamma$ with diameter $D \geq 3$. We assume that $\Gamma$ is not a hypercube nor a cycle. We fix a $Q$-polynomial ordering of the primitive idempotents of $\Gamma$. This…

Let $\Gamma$ denote a distance-regular graph with classical parameters $(D,b,\alpha,\beta)$ and $b\not=1$, $\alpha=b-1$. The condition on $\alpha$ implies that $\Gamma$ is formally self-dual. For $b=q^2$ we use the adjacency matrix and dual…

Let $\Gamma$ denote a $Q$-polynomial distance-regular graph with diameter $D\geq 1$. For a vertex $x$ of $\Gamma$ the corresponding subconstituent algebra $T=T(x)$ is generated by the adjacency matrix $A$ of $\Gamma$ and the dual adjacency…

We consider a primitive distance-regular graph $\Gamma$ with diameter at least $3$. We use the intersection numbers of $\Gamma$ to find a positive semidefinite matrix $G$ with integer entries. We show that $G$ has determinant zero if and…

Let $\Gamma$ denote a distance-regular graph with diameter $D \geq 2$. Let $E$ denote a primitive idempotent of $\Gamma$ with respect to which $\Gamma$ is $Q$-polynomial. Assume that there exists a $3$-clique $\{x,y,z\}$ such that…

Let $\Gamma$ denote the Hamming graph $H(D,r)$ with $r \geq 3$. Consider the distance matrices $\{A_i\}_{i=0}^{D}$ of $\Gamma$. Fix a vertex $x$ of $\Gamma$, and consider the dual distance matrices $\{A_i^{*}\}_{i=0}^{D}$ of $\Gamma$ with…

Let $\Gamma$ denote a finite, connected graph with vertex set $X$. Fix $x \in X$ and let $\varepsilon \ge 3$ denote the eccentricity of $x$. For mutually distinct scalars $\{\theta^*_i\}_{i=0}^\varepsilon$ define a diagonal matrix…

Using the theory of equitable decompositions it is possible to decompose a matrix $M$ appropriately associated with a given graph. The result is a collection of smaller matrices whose collective eigenvalues are the same as the eigenvalues…

Let $\Gamma=(X,\mathcal{R})$ denote a finite, simple, connected, and undirected non-bipartite graph with vertex set $X$ and edge set $\mathcal{R}$. Fix a vertex $x \in X$, and define $\mathcal{R}_f = \mathcal{R} \setminus \{yz \mid…

Let $\Gamma$ be a $Q$-polynomial distance-regular graph with diameter at least $3$. Terwilliger (1993) implicitly showed that there exists a polynomial, say $T(\lambda)\in \mathbb{C}[\lambda]$, of degree $4$ depending only on the…

We obtain the following characterization of $Q$-polynomial distance-regular graphs. Let $\G$ denote a distance-regular graph with diameter $d\ge 3$. Let $E$ denote a minimal idempotent of $\G$ which is not the trivial idempotent $E_0$. Let…

Let $\Gamma$ denote a distance-regular graph with diameter $D\geq 3$ and Bose-Mesner algebra $M$. For $\theta\in C\cup \infty$ we define a 1 dimensional subspace of $M$ which we call $M(\theta)$. If $\theta\in C$ then $M(\theta)$ consists…

Let $\Gamma=(X,\mathcal{R})$ denote a finite, simple, connected, and undirected non-bipartite graph with vertex set $X$ and edge set $\mathcal{R}$. Fix a vertex $x \in X$, and define $\mathcal{R}_f = \mathcal{R} \setminus \{yz \mid…

We study a relationship between $Q$-polynomial distance-regular graphs and the double affine Hecke algebra of type $(C^{\vee}_1,C_1)$. Let $\Gamma$ denote a $Q$-polynomial distance-regular graph with vertex set $X$. We assume that $\Gamma$…

Let Gamma be a Q-polynomial distance-regular graph with vertex set X, diameter D geq 3 and adjacency matrix A. Fix x in X and let A*=A*(x) be the corresponding dual adjacency matrix. Recall that the Terwilliger algebra T=T(x) is the…

In this paper, we introduce a method computing the primitive decomposition of idempotents of any semisimple finite group algebra based on its matrix representations and Wedderburn decomposition. Particularly, we use this method to calculate…

Let $\Gamma$ denote a bipartite distance-regular graph with diameter $D \ge 4$ and valency $k \ge 3$. Let $X$ denote the vertex set of $\Gamma$, and let $A$ denote the adjacency matrix of $\Gamma$. For $x \in X$ let $T=T(x)$ denote the…

Let $\Gamma=\Gamma(A)$ denote a simple strongly connected digraph with vertex set $X$, diameter $D$, and let $\{A_0,A:=A_1,A_2,\ldots,A_D\}$ denote the set of distance-$i$ matrices of $\Gamma$. Let $\{R_i\}_{i=0}^D$ denote a partition of…