English
Related papers

Related papers: The fundamental module of $S_3$-symmetric tridiago…

200 papers

The tridiagonal algebra is defined by two generators and two relations, called the tridiagonal relations. Special cases of the tridiagonal algebra include the $q$-Onsager algebra, the positive part of the $q$-deformed enveloping algebra…

Combinatorics · Mathematics 2026-03-25 Paul Terwilliger

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

We define an algebra on two generators which we call the Tridiagonal algebra, and we consider its irreducible modules. The algebra is defined as follows. Let K denote a field, and let $\beta, \gamma, \gamma^*, \varrho, \varrho^*$ denote a…

Quantum Algebra · Mathematics 2007-05-23 Paul Terwilliger

We establish a foundational homotopical framework for ternary $\Gamma$-modules by establishing that $\mathcal{T}\text{-Mod}$ is a Barr-exact, monoidal closed category. We resolve the long-standing "additivity obstruction" in non-binary…

Rings and Algebras · Mathematics 2026-01-15 Chandrasekhar Gokavarapu

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

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

The standard generators of tridiagonal algebras, recently introduced by Terwilliger, are shown to generate a new (in)finite family of mutually commuting operators which extends the Dolan-Grady construction. The involution property relies on…

Mathematical Physics · Physics 2009-11-10 Pascal Baseilhac

In this paper we further develop the connection between tridiagonal pairs and the q-tetrahedron algebra $\boxtimes_q$. Let V denote a finite dimensional vector space over an algebraically closed field and let A, A^* denote a tridiagonal…

Representation Theory · Mathematics 2013-07-04 Darren Funk-Neubauer

We define a congruence module $\Psi_A(M)$ associated to a surjective $\mathcal O$-algebra morphism $\lambda\colon A \to \mathcal{O}$, with $\mathcal{O}$ a discrete valuation ring, $A$ a complete noetherian local $\mathcal{O}$-algebra…

Number Theory · Mathematics 2024-11-26 Srikanth B. Iyengar , Chandrashekhar B. Khare , Jeffrey Manning

Let $\Gamma$ be a dual polar graph with diameter $D \geqslant 3$, having as vertices the maximal isotropic subspaces of a finite-dimensional vector space over the finite field $\mathbb{F}_q$ equipped with a non-degenerate form (alternating,…

Combinatorics · Mathematics 2018-02-13 Jae-Ho Lee , Hajime Tanaka

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

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

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

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…

Combinatorics · Mathematics 2026-03-25 Paul Terwilliger

Given a field $F$ of characteristic $3$ and division symbol $p$-algebras $[\alpha,\beta)_{3,F}$ and $[\alpha,\gamma)_{3,F}$ of degree $3$ over $F$, we prove that if $\alpha \text{dlog}(\beta)\wedge \text{dlog}(\gamma)$ is trivial in the…

Rings and Algebras · Mathematics 2019-11-05 Adam Chapman

Let $\Gamma^{(x_0)}$ be a finite rooted tree, for which $\Gamma$ is the underlying tree and $x_0$ the root. Let $T$ be the Terwilliger algebra of $\Gamma$ with respect to $x_0$. We study the structure of the principal $T$-module. As a…

Combinatorics · Mathematics 2019-10-23 Shuang-Dong Li , Yi-Zheng Fan , Tatsuro Ito , Masoud Karimi , Jing Xu

Let T be a Hom-finite triangulated Krull-Schmidt category over a field k. Inspired by a definition of Koenig and Liu, we say that a family S of pairwise orthogonal objects in T with trivial endomorphism rings is a simple-minded system if…

Representation Theory · Mathematics 2016-06-07 Alex Dugas

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…

Combinatorics · Mathematics 2023-09-01 Blas Fernández , Roghayeh Maleki , Štefko Miklavič , Giusy Monzillo
‹ Prev 1 2 3 10 Next ›