537 research outputs found
A Primitive Non-symmetric 3-Class Association Scheme on 36 Elements with p111 = 0 Exists and is Unique
AbstractIn this paper we construct a primitive, non-symmetric 3-class association scheme with parameters v = 36, v1 = 7, p111 = 0 and p211 = 4 and show that such a scheme is determined by its parameters
Four-class Skew-symmetric Association Schemes
An association scheme is called skew-symmetric if it has no symmetric
adjacency relations other than the diagonal one. In this paper, we study
4-class skew-symmetric association schemes. In J. Ma [On the nonexistence of
skew-symmetric amorphous association schemes, submitted for publication], we
discovered that their character tables fall into three types. We now determine
their intersection matrices. We then determine the character tables and
intersection numbers for 4-class skew-symmetric pseudocyclic association
schemes, the only known examples of which are cyclotomic schemes. As a result,
we answer a question raised by S. Y. Song [Commutative association schemes
whose symmetrizations have two classes, J. Algebraic Combin. 5(1) 47-55, 1996].
We characterize and classify 4-class imprimitive skew-symmetric association
schemes. We also prove that no 2-class Johnson scheme can admit a 4-class
skew-symmetric fission scheme. Based on three types of character tables above,
a short list of feasible parameters is generated.Comment: 12 page
Cometric Association Schemes
The combinatorial objects known as association schemes arise in group theory, extremal graph theory, coding theory, the design of experiments, and even quantum information theory. One may think of a d-class association scheme as a (d + 1)-dimensional matrix algebra over R closed under entrywise products. In this context, an imprimitive scheme is one which admits a subalgebra of block matrices, also closed under the entrywise product. Such systems of imprimitivity provide us with quotient schemes, smaller association schemes which are often easier to understand, providing useful information about the structure of the larger scheme. One important property of any association scheme is that we may find a basis of d + 1 idempotent matrices for our algebra. A cometric scheme is one whose idempotent basis may be ordered E0, E1, . . . , Ed so that there exists polynomials f0, f1, . . . , fd with fi ◦ (E1) = Ei and deg(fi) = i for each i. Imprimitive cometric schemes relate closely to t-distance sets, sets of unit vectors with only t distinct angles, such as equiangular lines and mutually unbiased bases. Throughout this thesis we are primarily interested in three distinct goals: building new examples of cometric association schemes, drawing connections between cometric association schemes and other objects either combinatorial or geometric, and finding new realizability conditions on feasible parameter sets — using these conditions to rule out open parameter sets when possible. After introducing association schemes with relevant terminology and definitions, this thesis focuses on a few recent results regarding cometric schemes with small d. We begin by examining the matrix algebra of any such scheme, first looking for low rank positive semidefinite matrices with few distinct entries and later establishing new conditions on realizable parameter sets. We then focus on certain imprimitive examples of both 3- and 4-class cometric association schemes, generating new examples of the former while building realizability conditions for both. In each case, we examine the related t-distance sets, giving conditions which work towards equivalence; in the case of 3-class Q-antipodal schemes, an equivalence is established. We conclude by partially extending a result of Brouwer and Koolen concerning the connectivity of graphs arising from metric association schemes
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
On commutative association schemes and associated (directed) graphs
Let denote the Bose--Mesner algebra of a commutative -class
association scheme (not necessarily symmetric), and
denote a (strongly) connected (directed) graph with adjacency matrix . Under
the assumption that belongs to , in this paper, we describe the
combinatorial structure of .
Among else, we show that, if is a commutative -class
association scheme that is not an amorphic symmetric scheme, then we can always
find a (directed) graph such that the adjacency matrix of
generates the Bose--Mesner algebra of
- …