scispace - formally typeset
Search or ask a question
Journal ArticleDOI

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

01 Dec 1992-Journal of Algebraic Combinatorics (Kluwer Academic Publishers-Plenum Publishers)-Vol. 1, Iss: 4, pp 363-388
TL;DR: 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.

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI
TL;DR: In this article, the concept of a Leonard system was introduced, and it was shown that for any Leonard pair A,A* on V, there exists a sequence of scalars β,γ,γ*,ϱ,ϱ* taken from K such that both

335 citations

Journal ArticleDOI
Stefan Kolb1
TL;DR: In this paper, a general theory of quantum group analogs of symmetric pairs for involutive automorphism of the second kind of symmetrizable Kac-Moody algebras is developed.

245 citations

Journal ArticleDOI
TL;DR: A new upper bound on the maximum size A(n,d) of a binary code of word length n and minimum distance at least d is given, based on block-diagonalizing the Terwilliger algebra of the Hamming cube.
Abstract: We give a new upper bound on the maximum size A(n,d) of a binary code of word length n and minimum distance at least d. It is based on block-diagonalizing the Terwilliger algebra of the Hamming cube. The bound strengthens the Delsarte bound, and can be calculated with semidefinite programming in time bounded by a polynomial in n. We show that it improves a number of known upper bounds for concrete values of n and d. From this we also derive a new upper bound on the maximum size A(n,d,w) of a binary code of word length n, minimum distance at least d, and constant weight w, again strengthening the Delsarte bound and yielding several improved upper bounds for concrete values of n, d, and w

216 citations


Additional excerpts

  • ...) This algebra is called the Terwilliger algebra [14] of the Hamming cube ....

    [...]

Posted Content
TL;DR: In this article, an ordered pair of linear transformations (i.e., a Leonard pair on a field and a vector space over a field with finite positive dimension) is considered.
Abstract: Let $K$ denote a field and let $V$ denote a vector space over $K$ with finite positive dimension We consider an ordered pair of linear transformations $A:V\to V$ and $A^*:V\to V$ that satisfy conditions (i), (ii) below (i) There exists a basis for $V$ with respect to which the matrix representing $A$ is irreducible tridiagonal and the matrix representing $A^*$ is diagonal (ii) There exists a basis for $V$ with respect to which the matrix representing $A$ is diagonal and the matrix representing $A^*$ is irreducible tridiagonal We call such a pair a Leonard pair on $V$ We give an overview of the theory of Leonard pairs

212 citations

01 Jan 1999
TL;DR: In this paper, the authors consider a pair of linear transformations A : V → V and A :V → V satisfying the following four conditions: (i) A and V are both diagonalizable on V, (ii) A is both diagonalisable on V and V is both diagonalizable on A, and (iii) there is no subspace W of V such that both AW ⊆ W, AW⊆ AW, AW ∆ W, other than W = 0 and W = V.
Abstract: Inspired by the theory of P -and Q-polynomial association schemes we consider the following situation in linear algebra. Let F denote a field, and let V denote a vector space over F with finite positive dimension. We consider a pair of linear transformations A : V → V and A : V → V satisfying the following four conditions. (i) A and A are both diagonalizable on V . (ii) There exists an ordering V0, V1, . . . , Vd of the eigenspaces of A such that AVi ⊆ Vi−1 + Vi + Vi+1 (0 ≤ i ≤ d), where V−1 = 0, Vd+1 = 0. (iii) There exists an ordering V ∗ 0 , V ∗ 1 , . . . , V ∗ δ of the eigenspaces of A ∗ such that AV ∗ i ⊆ V ∗ i−1 + V ∗ i + V ∗ i+1 (0 ≤ i ≤ δ), where V ∗ −1 = 0, V ∗ δ+1 = 0. (iv) There is no subspace W of V such that both AW ⊆ W , AW ⊆ W , other than W = 0 and W = V . We call such a pair a TD pair. Referring to the above TD pair, we show d = δ. We show that for 0 ≤ i ≤ d, the eigenspaces Vi and V ∗ i have the same dimension. Denoting this common dimension by ρi, we show the sequence ρ0, ρ1, . . . , ρd is symmetric and unimodal, i.e. ρi−1 ≤ ρi for 1 ≤ i ≤ d/2 and ρi = ρd−i for 0 ≤ i ≤ d. We show that there exists a sequence of scalars β, γ, γ, , taken from F such that both 0 = [A,AA − βAAA+AA − γ(AA +AA)− A], 0 = [A, AA− βAAA +AA − γ(AA+AA)− A], where [r, s] means rs − sr. The sequence is unique if d ≥ 3. Let θi (resp. θ ∗ i ) denote the eigenvalue of A (resp. A) associated with Vi (resp. V ∗ i ), for 0 ≤ i ≤ d. We show the expressions θi−2 − θi+1 θi−1 − θi , θ i−2 − θ ∗ i+1 θ i−1 − θ ∗ i both equal β + 1, for 2 ≤ i ≤ d − 1. We hope these results will ultimately lead to a complete classification of the TD pairs.

195 citations

References
More filters
Book
27 Apr 1990
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.
Abstract: Foreword Preface 1. Basic hypergeometric series 2. Summation, transformation, and expansion formulas 3. Additional summation, transformation, and expansion formulas 4. Basic contour integrals 5. Bilateral basic hypergeometric series 6. The Askey-Wilson q-beta integral and some associated formulas 7. Applications to orthogonal polynomials 8. Further applications 9. Linear and bilinear generating functions for basic orthogonal polynomials 10. q-series in two or more variables 11. Elliptic, modular, and theta hypergeometric series Appendices References Author index Subject index Symbol index.

3,622 citations


"The Subconstituent Algebra of an As..." refers background in this paper

  • ...See [1], [2], [30] for information on the q-Racah polynomials....

    [...]

Book
01 Jan 1962
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.
Abstract: Notation Background from Group Theory Representations and Modules Algebraic Number Theory Semi-Simple Rings and Group Algebras Group Characters Induced Characters Induced Representation Non-Semi-Simple Rings Frobenius Algebras Splitting Fields and Separable Algebras Integral Representations Modular Representations Index

2,778 citations

Book
23 Jun 1989
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.
Abstract: Consider a connected simple graph with vertex set X of diameter d. Define Ri X2 by (x, y) Ri whenever x and y have graph distance

2,264 citations

Book
21 Jan 1984

1,210 citations


"The Subconstituent Algebra of an As..." refers methods in this paper

  • ...To access work done more than a few years ago, we refer the reader to the 1985 book of Bannai and Ito [3], the 1989 book of Brouwer, Cohen, and Neumaier Keywords: association scheme, P-polynomial, Q-polynomial, distance-regular graph....

    [...]

Book
01 Apr 1985

1,175 citations


"The Subconstituent Algebra of an As..." refers background in this paper

  • ...See [1], [2], [30] for information on the q-Racah polynomials....

    [...]