English
Related papers

Related papers: Structure of Thin Irreducible Modules of a Q-polyn…

200 papers

Let $K$ denote a field, and let $V$ denote a vector space over $K$ with finite positive dimension. Consider a pair of linear transformations $A:V\to V$ and $A^*:V\to V$ that satisfy both conditions below: (i) There exists a basis for $V$…

Combinatorics · Mathematics 2007-05-23 Tatsuro Ito , Kenichiro Tanabe , Paul Terwilliger

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…

Combinatorics · Mathematics 2025-03-25 Mojtaba Jazaeri

Fix an algebraically closed field $\mathbb{F}$ and an integer $d \geq 3$. Let $\text{Mat}_{d+1}(\mathbb{F})$ denote the $\mathbb{F}$-algebra consisting of the $(d+1) \times (d+1)$ matrices that have all entries in $\mathbb{F}$. We consider…

Rings and Algebras · Mathematics 2014-04-29 Kazumasa Nomura

Let $\Gamma$ denote a $Q$-polynomial distance-regular graph with vertex set $X$ and diameter $D$. Let $A$ denote the adjacency matrix of $\Gamma$. For a vertex $x\in X$ and for $0 \leq i \leq D$, let $E^*_i(x)$ denote the projection matrix…

Combinatorics · Mathematics 2024-05-08 Jack H. Koolen , Jae-Ho Lee , Ying-Ying Tan

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…

Combinatorics · Mathematics 2009-08-31 Aleksandar Jurisic , Paul Terwilliger , Arjana Zitnik

We consider the Norton algebra associated with a $Q$-polynomial primitive idempotent of the adjacency matrix for a distance-regular graph. We obtain a formula for the Norton algebra product that we find attractive.

Combinatorics · Mathematics 2020-06-11 Paul Terwilliger

Let Lambda be a tiled R-order. We give a description of Aut_R(Lambda) as the semidirect product of Inn(Lambda) and a certain subgroup of Aut(Q(Lambda)), where Q(Lambda) is the link graph of Lambda. Additionally, we give criteria for…

Rings and Algebras · Mathematics 2009-09-25 Jeremy Haefner , Christopher J. Pappacena

This survey paper contains a tutorial introduction to distance-regular graphs, with an emphasis on the subconstituent algebra and the $Q$-polynomial property.

Combinatorics · Mathematics 2022-08-30 Paul Terwilliger

In this paper, we study distance-regular graphs $\Gamma$ that have a pair of distinct vertices, say x and y, such that the number of common neighbors of x and y is about half the valency of $\Gamma$. We show that if the diameter is at least…

Combinatorics · Mathematics 2010-08-09 Jack H. Koolen , Jongyook Park

The basic properties of the Temperley-Lieb algebra $TL_n$ with parameter $\beta = q + q^{-1}$, for $q$ any non-zero complex number, are reviewed in a pedagogical way. The link and standard (cell) modules that appear in numerous physical…

Mathematical Physics · Physics 2014-07-09 David Ridout , Yvan Saint-Aubin

Let $F/\mathbb{Q}_p$ be finite and let $\mathfrak{X}_G$ be the moduli space of Langlands parameters valued in $G$, in characteristic distinct from $p$. First, we determine the irreducible components of $\mathfrak{X}_G$. Then, we determine…

Number Theory · Mathematics 2023-12-06 Jack Shotton

Let $G$ denote a $Q$-polynomial distance-regular graph with diameter $D$ at least 4. Assume that the intersection numbers of $G$ satisfy $a_i=0$ for $0 \leq i \leq D-1$ and $a_D\neq 0$. We show that $G$ is a polygon, a folded cube, or an…

Combinatorics · Mathematics 2016-09-07 Michael S. Lang , Paul M. Terwilliger

Let $\G$ denote a bipartite distance-regular graph with vertex set $X$ and diameter $D \ge 3$. Fix $x \in X$ and let $L$ (resp. $R$) denote the corresponding lowering (resp. raising) matrix. We show that each $Q$-polynomial structure for…

Combinatorics · Mathematics 2011-08-12 Stefko Miklavic , Paul Terwilliger

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…

Combinatorics · Mathematics 2007-05-23 Paul Terwilliger

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$…

Representation Theory · Mathematics 2016-05-03 Jae-Ho Lee

There is a type of distance-regular graph, said to be $Q$-polynomial. In this paper we investigate a generalized $Q$-polynomial property involving a graph that is not necessarily distance-regular. We give a detailed description of an…

Combinatorics · Mathematics 2023-06-09 Paul Terwilliger

The $q$-Onsager algebra $\mathcal O_q$ is defined by two generators $A$, $A^*$ and two relations, called the $q$-Dolan/Grady relations. Recently P. Baseilhac and S. Kolb found an automorphism $L$ of $\mathcal O_q$, that fixes $A$ and sends…

Quantum Algebra · Mathematics 2020-05-04 Paul Terwilliger

Let $\mathbb K$ be an algebraically closed field of characteristic zero. Let $V$ be a module over the polynomial ring $\mathbb K[x,y]$. The actions of $x$ and $y$ determine linear operators $P$ and $Q$ on $V$ as a vector space over $\mathbb…

Rings and Algebras · Mathematics 2017-01-16 A. P. Petravchuk , K. Ya. Sysak

We study $Q$-polynomial distance-regular graphs from the point of view of what we call descendents, that is to say, those vertex subsets with the property that the width $w$ and dual width $w^*$ satisfy $w+w^*=d$, where $d$ is the diameter…

Combinatorics · Mathematics 2021-11-02 Hajime Tanaka

A Leonard pair is a pair of diagonalizable linear transformations of a finite-dimensional vector space, each of which acts in an irreducible tridiagonal fashion on an eigenbasis for the other one. In the present paper we give an elementary…

Representation Theory · Mathematics 2012-01-10 Kazumasa Nomura , Paul Terwilliger