2013
DOI: 10.1007/s00373-013-1366-0
|View full text |Cite
|
Sign up to set email alerts
|

An Action of the Tetrahedron Algebra on the Standard Module for the Hamming Graphs and Doob Graphs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
7
0

Year Published

2015
2015
2025
2025

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 12 publications
(8 citation statements)
references
References 20 publications
1
7
0
Order By: Relevance
“…The paper [121] shows howĤ q is related to Leonard pairs. Additional results in the literature link tridiagonal pairs and Leonard pairs with the Lie algebra sl 2 (see [3, 7-9, 26, 81, 120]), the quantum algebras U q (sl 2 ) (see [2,29,30,88,147,162]), U q ( sl 2 ) (see [5,24,41,75,76,84,152]), the tetrahedron Lie algebra (see [25,56,79,96]), and its q-deformation q (see [42,73,77,78,80,164,165]).…”
Section: Casementioning
confidence: 99%
“…The paper [121] shows howĤ q is related to Leonard pairs. Additional results in the literature link tridiagonal pairs and Leonard pairs with the Lie algebra sl 2 (see [3, 7-9, 26, 81, 120]), the quantum algebras U q (sl 2 ) (see [2,29,30,88,147,162]), U q ( sl 2 ) (see [5,24,41,75,76,84,152]), the tetrahedron Lie algebra (see [25,56,79,96]), and its q-deformation q (see [42,73,77,78,80,164,165]).…”
Section: Casementioning
confidence: 99%
“…Repeating the argument from the first paragraph again in this case gives Combining ( 29) - (41) we have that X ru , X su , X tu acts on V as a BD triad. It is immediate from (30), (31), (34), (35), (38), (39) that the first, second, and third eigenvalue sequences of X ru , X su , X tu are each {2i − d} d i=0 . Therefore, the BD triad X ru , X su , X tu is reduced.…”
Section: Proof Of Theorem 43: Letmentioning
confidence: 99%
“…For more information on how the tetrahedron algebra arises in representation theory see [2,6,11,25,32]. See [18,30,31] for how the tetrahedron algebra has been used in algebraic combinatorics and graph theory.…”
Section: Introductionmentioning
confidence: 99%
“…Define C by (99). One verifies ( 97) and ( 98) using ( 94), ( 95), (96). ✷ Proposition 15.3 Assume that β = −2.…”
mentioning
confidence: 94%