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
Posted Content

Idempotent systems.

TL;DR: This paper focuses on a family of idempotent systems, said to be symmetric, which is an abstraction of the primary module for the subconstituent algebra of a symmetric association scheme.
Journal ArticleDOI

A new characterization of taut distance-regular graphs of odd diameter

TL;DR: It is shown that @C is taut if and only if @D 0 and the subspace W is invariant under multiplication by the adjacency matrix.
Posted Content

Vertex subsets with minimal width and dual width in $Q$-polynomial distance-regular graphs

TL;DR: In this paper, the authors study polynomial distance-regular graphs from the point of view of descendents, that is, those vertex subsets with the property that the width $w$ and dual width$w^*$ satisfy $w+w^*)=d, where $d$ is the diameter of the graph.
Journal ArticleDOI

The local eigenvalues of a bipartite distance-regular graph

TL;DR: It is shown that the adjacency matrix of the local graph Γ 2 2 has at most four distinct eigenvalues, motivated by the fact that the assumption above holds if Γ is Q -polynomial.
Dissertation

Bipartite Distance-Regular Graphs of Diameter Four

Junbo Huang
TL;DR: In this paper, it was shown that a bipartite distance-regular graph of diameter four satisfies q3,3(3) = 0 if and only if it satisfies the so-called Q-polynomial property.
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.