English
Related papers

Related papers: The Terwilliger algebra of the twisted Grassmann g…

200 papers

Let $\Gamma$ denote a finite, simple and connected graph. Fix a vertex $x$ of $\Gamma$ which is not a leaf and let $T=T(x)$ denote the Terwilliger algebra of $\Gamma$ with respect to $x$. Assume that the unique irreducible $T$-module with…

Combinatorics · Mathematics 2023-01-25 Blas Fernández

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…

Combinatorics · Mathematics 2008-04-11 Stefko Miklavic

Let $Y$ denote a $D$-class symmetric association scheme with $D \geq 3$, and suppose $Y$ is almost-bipartite P- and Q-polynomial. Let $x$ denote a vertex of $Y$ and let $T=T(x)$ denote the corresponding Terwilliger algebra. We prove that…

Combinatorics · Mathematics 2007-05-23 John S. Caughman , Mark S. MacLean , Paul M. Terwilliger

Let $D\geq 3$ denote an integer. For any $x\in \mathbb F_2^D$ let $w(x)$ denote the Hamming weight of $x$. Let $X$ denote the subspace of $\mathbb F_2^D$ consisting of all $x\in \mathbb F_2^D$ with even $w(x)$. The $D$-dimensional halved…

Combinatorics · Mathematics 2021-09-07 Chia-Yi Wen , Hau-Wen Huang

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…

Combinatorics · Mathematics 2025-02-20 Akihide Hanaki , Masayoshi Yoshikawa

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…

Combinatorics · Mathematics 2010-03-30 Diana R. Cerzo

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…

Combinatorics · Mathematics 2016-11-23 Mark S. MacLean , Stefko Miklavic

Let $\mathbb{F}_q$ denote a finite field with $q$ elements. Let $N$ and $D$ denote integers with $N>D \ge 1$. Let $\mathcal{V}$ denote an $N$-dimensional vector space over $\mathbb{F}_q$. The Grassmann graph $J_q(N,D)$ is the graph with…

Combinatorics · Mathematics 2025-09-22 Jae-Ho Lee , Jongyook Park , Ian Seong

The adjacency matrix of a symplectic dual polar graph restricted to the eigenspaces of an abelian automorphism subgroup is shown to act as the adjacency matrix of a weighted subspace lattice. The connection between the latter and…

Combinatorics · Mathematics 2021-09-01 Pierre-Antoine Bernard , Nicolas Crampe , Luc Vinet

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…

Combinatorics · Mathematics 2022-09-29 Hou Lihang , Gao Suogang , Kang Na , Hou Bo

In the year 2000, Eric Egge introduced the generalized Terwilliger algebra $\mathcal T$ of a distance-regular graph $\Gamma$. For any vertex $x$ of $\Gamma,$ there is a surjective algebra homomorphism $\natural$ from $\mathcal T$ to the…

Combinatorics · Mathematics 2023-02-17 Nathan Nicholson

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…

Combinatorics · Mathematics 2014-03-18 Alexander L. Gavrilyuk , Jack H. Koolen

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…

Combinatorics · Mathematics 2022-07-05 Hou Lihang , Gao Suogang , Kang Na , Hou Bo

Let $\Gamma = (\Omega,E)$ be a strongly-regular graph with adjacency matrix $A_1$, and let $A_2$ be the adjacency matrix of its complement. For any vertex $\omega\in \Omega$, we define $E_{0,\omega}^*$ $E_{1,\omega}^*$ and $E_{2,\omega}^*$…

Combinatorics · Mathematics 2025-07-22 Allen Herman , Roghayeh Maleki , Andriaherimanana Sarobidy Razafimahatratra

In [The Terwilliger algebra of the Johnson schemes, Discrete Mathematics 307 (2007) 1621--1635], Levstein and Maldonado computed the Terwilliger algebra of the Johnson scheme $J(n,m)$ when $3m\leq n$. The distance-$m$ graph of $J(2m+1,m)$…

Combinatorics · Mathematics 2011-12-05 Qian Kong , Benjian Lv , Kaishun Wang

Let $\Gamma$ denote a distance-regular graph with vertex set $X$ and diameter $D \geq 3$. Fix a vertex $x \in X$. Let the field $\mathbb{F}$ be either $\mathbb{R}$ or $\mathbb{C}$. Let $\operatorname{Mat}_X(\mathbb{F})$ denote the…

Combinatorics · Mathematics 2025-11-25 Blas Fernández , Jae-Ho Lee , Jongyook Park

Terwilliger algebras are a subalgebra of a matrix algebra constructed from an association scheme. In 2010, Tanaka defined what it means for a Terwilliger algebra to be almost commutative and gave five equivalent conditions for a Terwilliger…

Representation Theory · Mathematics 2025-09-22 Nicholas L. Bastian , Stephen P. Humphries

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…

Combinatorics · Mathematics 2024-11-14 Allen Herman , Roghayeh Maleki , Andriaherimanana Sarobidy Razafimahatratra

We discuss the Grassmann graph $J_q(N,D)$ with $N \geq 2D$, having as vertices the $D$-dimensional subspaces of an $N$-dimensional vector space over the finite field $\mathbb{F}_q$. This graph is distance-regular with diameter $D$; to avoid…

Combinatorics · Mathematics 2022-04-20 Jae-Ho Lee

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…

Combinatorics · Mathematics 2007-05-23 Paul Terwilliger , Chih-wen Weng
‹ Prev 1 2 3 10 Next ›