scispace - formally typeset
Open AccessJournal ArticleDOI

The Subconstituent Algebra of an Association Scheme, (Part I)

Reads0
Chats0
TLDR
In this article, the authors introduce a non-commutative, associative, semi-simple C-algebra T e T(x) whose structure reflects the combinatorial structure of Y.
Abstract
We introduce a method for studying commutative association schemes with “many” vanishing intersection numbers and/or Krein parameters, and apply the method to the P- and Q-polynomial schemes. Let Y denote any commutative association scheme, and fix any vertex x of Y. We introduce a non-commutative, associative, semi-simple \Bbb {C}-algebra T e T(x) whose structure reflects the combinatorial structure of Y. We call T the subconstituent algebra of Y with respect to x. Roughly speaking, T is a combinatorial analog of the centralizer algebra of the stabilizer of x in the automorphism group of Y. In general, the structure of T is not determined by the intersection numbers of Y, but these parameters do give some information. Indeed, we find a relation among the generators of T for each vanishing intersection number or Krein parameter. We identify a class of irreducible T-moduIes whose structure is especially simple, and say the members of this class are thin. Expanding on this, we say Y is thin if every irreducible T(y)-module is thin for every vertex y of Y. We compute the possible thin, irreducible T-modules when Y is P- and Q-polynomial. The ones with sufficiently large dimension are indexed by four bounded integer parameters. If Y is assumed to be thin, then “sufficiently large dimension” means “dimension at least four”. We give a combinatorial characterization of the thin P- and Q-polynomial schemes, and supply a number of examples of these objects. For each example, we show which irreducible T-modules actually occur. We close with some conjectures and open problems.

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

A characterization of Leonard pairs using the parameters {ai}i=0d

TL;DR: In this paper, an ordered pair of linear transformations A : V → V and A * :V → V that satisfy (i) and (ii) below are characterized as Leonard pairs.
Journal ArticleDOI

Leonard pairs, spin models, and distance-regular graphs

TL;DR: In this article, it was shown that if a spin model W satisfies W ∈ M ⊆ N (W ), where M is the Bose-Mesner algebra of a distance-regular graph Γ, then Γ affords W.
Journal ArticleDOI

Completely regular clique graphs

TL;DR: In this paper, it was shown that all completely regular clique graphs are distance-regular if and only if they are a bipartite half of a distance-semiregular graph.

Leonard Pairs from the Equitable Generators of "U" _"q" "(" 〖"sl" 〗_"2" ")"

TL;DR: In this article, the authors consider the quantum algebra U_q (sl_2) over F with equitable generators x^(±1),y and z. They give necessary and sufficient conditions on the coefficients for A,A^* to act on V as a Leonard pair.
Journal ArticleDOI

The Terwilliger algebra of Odd graphs

TL;DR: The Terwilliger algebra of O m + 1 is determined and its basis is given and it is shown that the distance- m graph of J ( 2 m +1, m ) is the Odd graph O m - 1 .
References
More filters
Book

Basic Hypergeometric Series

TL;DR: In this article, the Askey-Wilson q-beta integral and some associated formulas were used to generate bilinear generating functions for basic orthogonal polynomials.
Book

Representation Theory of Finite Groups and Associative Algebras

TL;DR: In this paper, the authors present a group theory representation and modular representation for algebraic number theory, including Semi-Semi-Simple Rings and Group Algebras, including Frobenius Algebraic numbers.
Book

Distance-Regular Graphs

TL;DR: In this paper, a connected simple graph with vertex set X of diameter d is considered, and the authors define Ri X2 by (x, y) Ri whenever x and y have graph distance.