Related papers: Terwilliger algebra of Odd graphs

Levstein and Maldonado [F. Levstein, C. Maldonado, The Terwilliger algebra of the Johnson schemes, Discrete Mathematics 307 (2007) 1621--1635] computed the Terwilliger algebra of the Johnson scheme $J(n,m)$ when $3m\leq n$. In this paper,…

In [F. Levstein, C. Maldonado, The Terwilliger algebra of the Johnson schemes, Discrete Math. 307 (2007) 1621--1635], the Terwilliger algebra of the Johnson scheme $J(n,d)$ was determined when $n\geq 3d$. In this paper, we determine the…

Let $2.O_{m+1}$ denote the doubled Odd graph with vertex set $X$ on a set of cardinality $2m+1$, where $m\geq 1$. Fix a vertex $x_0\in X$. Let $\mathcal{A}:=\mathcal{A}(x_0)$ denote the centralizer algebra of the stabilizer of $x_0$ in the…

Let $O_{m+1}$ denote the Odd graph on a set of cardinality $2m+1$, where $m$ is a positive integer. Denote by $X$ its vertex set and by $T:=T(x_0)$ its Terwilliger algebra with respect to any fixed vertex $x_0\in X$. In this paper, we first…

Terwilliger algebras are finite-dimensional semisimple algebras that were first introduced by Paul Terwilliger in 1992 in studies of association schemes and distance-regular graphs. The Terwilliger algebras of the conjugacy class…

This paper delves into the Terwilliger algebra associated with the ordered Hamming scheme, which extends from the wreath product of one-class association schemes and was initially introduced by Delsarte as a natural expansion of the Hamming…

The Terwilliger algebra $T(x)$ of a finite connected simple graph $\Gamma$ with respect to a vertex $x$ is the complex semisimple matrix algebra generated by the adjacency matrix $A$ of $\Gamma$ and the diagonal matrices…

We define modular Terwilliger algebras of association schemes, Terwilliger algebras over a positive characteristic field, and consider basic properties. We give a condition for the modular Terwilliger algebra to be non-semisimple. We show…

Let $\Gamma$ denote a distance-regular graph with diameter $D \ge 3$. Assume $\Gamma$ has classical parameters $(D,b,\alpha,\beta)$ with $b < -1$. Let $X$ denote the vertex set of $\Gamma$ and let $A \in MX$ denote the adjacency matrix of…

In the present paper, we define the Terwilliger algebra of digraphs. Then, we determine the irreducible modules of the Terwilliger algebra of a Hamming digraph $H^*(d,3)$. As is well known, the representation of the Terwilliger algebra of a…

For any non-negative integers $v > k > i$, the {\em generalized Johnson graph}, $J(v,k,i)$, is the undirected simple graph whose vertices are the $k$-subsets of a $v$-set, and where any two vertices $A$ and $B$ are adjacent whenever $|A…

For a finite connected simple graph, the Terwilliger algebra is a matrix algebra generated by the adjacency matrix and idempotents corresponding to the distance partition with respect to a fixed vertex. We will consider algebras defined by…

The Terwilliger algebras of asymmetric association schemes of rank $3$, whose nonidentity relations correspond to doubly regular tournaments, are shown to have thin irreducible modules, and to always be of dimension $4k+9$ for some positive…

In this paper, we study the subconstituent algebras, also called as Terwilliger algebras, of association schemes that are obtained as the wreath product of one-class association schemes $K_n=H(1, n)$ for $n\ge 2$. We find that the $d$-class…

Let $\mathbb{F}$ be an arbitrary field. In this paper, we continue studying the Terwilliger algebras of association schemes over $\mathbb{F}$ that were called the Terwilliger $\mathbb{F}$-algebras of association schemes in [8]. We determine…

The Terwilliger algebras of association schemes over an arbitrary field $\mathbb{F}$ were called the Terwilliger $\mathbb{F}$-algebras of association schemes in [8]. In this paper, we study the Terwilliger $\mathbb{F}$-algebras of factorial…

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 initiate study of the Terwilliger algebra and related semidefinite programming techniques for the conjugacy scheme of the symmetric group Sym$(n)$. In particular, we compute orbits of ordered pairs on Sym$(n)$ acted upon by conjugation…

In [3], Hanaki defined the Terwilliger algebras of association schemes over a commutative unital ring. In this paper, we call the Terwilliger algebras of association schemes over a field $\mathbb{F}$ the Terwilliger $\mathbb{F}$-algebras of…

In 2010, Koolen and Bang proposed the following conjecture: For a fixed integer $m \geq 2$, any geometric distance-regular graph with smallest eigenvalue $-m$, diameter $D \geq 3$ and $c_2 \geq 2$ is either a Johnson graph, a Grassmann…