34 research outputs found
Symplectic spreads, planar functions and mutually unbiased bases
In this paper we give explicit descriptions of complete sets of mutually
unbiased bases (MUBs) and orthogonal decompositions of special Lie algebras
obtained from commutative and symplectic semifields, and
from some other non-semifield symplectic spreads. Relations between various
constructions are also studied. We show that the automorphism group of a
complete set of MUBs is isomorphic to the automorphism group of the
corresponding orthogonal decomposition of the Lie algebra .
In the case of symplectic spreads this automorphism group is determined by the
automorphism group of the spread. By using the new notion of pseudo-planar
functions over fields of characteristic two we give new explicit constructions
of complete sets of MUBs.Comment: 20 page
Lattices invariant under the affine general linear group
AbstractIntegral lattices invariant under the affine group AGLm(pt) in its natural permutation module Λ of dimension n=mt are studied. A complete description of such lattices is given. As a consequence we have results on automorphism groups of affine invariant codes over fields and finite residue rings Z/pkZ
Association schemes related to universally optimal configurations, Kerdock codes and extremal Euclidean line-sets
H. Cohn et. al. proposed an association scheme of 64 points in R^{14} which
is conjectured to be a universally optimal code. We show that this scheme has a
generalization in terms of Kerdock codes, as well as in terms of maximal real
mutually unbiased bases. These schemes also related to extremal line-sets in
Euclidean spaces and Barnes-Wall lattices. D. de Caen and E. R. van Dam
constructed two infinite series of formally dual 3-class association schemes.
We explain this formal duality by constructing two dual abelian schemes related
to quaternary linear Kerdock and Preparata codes.Comment: 16 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
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