51 research outputs found
Distance-regular graphs
This is a survey of distance-regular graphs. We present an introduction to
distance-regular graphs for the reader who is unfamiliar with the subject, and
then give an overview of some developments in the area of distance-regular
graphs since the monograph 'BCN' [Brouwer, A.E., Cohen, A.M., Neumaier, A.,
Distance-Regular Graphs, Springer-Verlag, Berlin, 1989] was written.Comment: 156 page
Taut distance-regular graphs and the subconstituent algebra
We consider a bipartite distance-regular graph with diameter at least
4 and valency at least 3. We obtain upper and lower bounds for the local
eigenvalues of in terms of the intersection numbers of and the
eigenvalues of . Fix a vertex of and let denote the corresponding
subconstituent algebra. We give a detailed description of those thin
irreducible -modules that have endpoint 2 and dimension . In an earlier
paper the first author defined what it means for to be taut. We obtain
three characterizations of the taut condition, each of which involves the local
eigenvalues or the thin irreducible -modules mentioned above.Comment: 29 page
Uniformity in association schemes and coherent configurations: cometric Q-antipodal schemes and linked systems
Inspired by some intriguing examples, we study uniform association schemes
and uniform coherent configurations, including cometric Q-antipodal association
schemes. After a review of imprimitivity, we show that an imprimitive
association scheme is uniform if and only if it is dismantlable, and we cast
these schemes in the broader context of certain --- uniform --- coherent
configurations. We also give a third characterization of uniform schemes in
terms of the Krein parameters, and derive information on the primitive
idempotents of such a scheme. In the second half of the paper, we apply these
results to cometric association schemes. We show that each such scheme is
uniform if and only if it is Q-antipodal, and derive results on the parameters
of the subschemes and dismantled schemes of cometric Q-antipodal schemes. We
revisit the correspondence between uniform indecomposable three-class schemes
and linked systems of symmetric designs, and show that these are cometric
Q-antipodal. We obtain a characterization of cometric Q-antipodal four-class
schemes in terms of only a few parameters, and show that any strongly regular
graph with a ("non-exceptional") strongly regular decomposition gives rise to
such a scheme. Hemisystems in generalized quadrangles provide interesting
examples of such decompositions. We finish with a short discussion of
five-class schemes as well as a list of all feasible parameter sets for
cometric Q-antipodal four-class schemes with at most six fibres and fibre size
at most 2000, and describe the known examples. Most of these examples are
related to groups, codes, and geometries.Comment: 42 pages, 1 figure, 1 table. Published version, minor revisions,
April 201
Uniformity in Association schemes and Coherent Configurations: Cometric Q-Antipodal Schemes and Linked Systems
2010 Mathematics Subject Classification. Primary 05E30, Secondary 05B25, 05C50, 51E12
Commutative association schemes
Association schemes were originally introduced by Bose and his co-workers in
the design of statistical experiments. Since that point of inception, the
concept has proved useful in the study of group actions, in algebraic graph
theory, in algebraic coding theory, and in areas as far afield as knot theory
and numerical integration. This branch of the theory, viewed in this collection
of surveys as the "commutative case," has seen significant activity in the last
few decades. The goal of the present survey is to discuss the most important
new developments in several directions, including Gelfand pairs, cometric
association schemes, Delsarte Theory, spin models and the semidefinite
programming technique. The narrative follows a thread through this list of
topics, this being the contrast between combinatorial symmetry and
group-theoretic symmetry, culminating in Schrijver's SDP bound for binary codes
(based on group actions) and its connection to the Terwilliger algebra (based
on combinatorial symmetry). We propose this new role of the Terwilliger algebra
in Delsarte Theory as a central topic for future work.Comment: 36 page
Spin models and distance-regular graphs of -Racah type
Let denote a distance-regular graph, with vertex set and
diameter . We assume that is formally self-dual and -Racah
type. We also assume that for each the subconstituent algebra
contains a certain central element . We use to construct a
spin model afforded by . We investigate the combinatorial
implications of . We reverse the logical direction and recover from . We finish with some open problems.Comment: 48 page
On symmetric association schemes and associated quotient-polynomial graphs
Let denote an undirected, connected, regular graph with vertex set
, adjacency matrix , and distinct eigenvalues. Let denote the subalgebra of Mat
generated by . We refer to as the {\it adjacency algebra} of
. In this paper we investigate algebraic and combinatorial structure of
for which the adjacency algebra is closed under
Hadamard multiplication. In particular, under this simple assumption, we show
the following: (i) has a standard basis ;
(ii) for every vertex there exists identical distance-faithful intersection
diagram of with cells; (iii) the graph is
quotient-polynomial; and (iv) if we pick then
has distinct eigenvalues if and only if
spanspan. We describe the
combinatorial structure of quotient-polynomial graphs with diameter and
distinct eigenvalues. As a consequence of the technique from the paper we give
an algorithm which computes the number of distinct eigenvalues of any Hermitian
matrix using only elementary operations. When such a matrix is the adjacency
matrix of a graph , a simple variation of the algorithm allow us to
decide wheter is distance-regular or not. In this context, we also
propose an algorithm to find which distance- matrices are polynomial in ,
giving also these polynomials.Comment: 22 pages plus 4 pages of reference
- …