1,247 research outputs found
Switching codes and designs
AbstractVarious local transformations of combinatorial structures (codes, designs, and related structures) that leave the basic parameters unaltered are here unified under the principle of switching. The purpose of the study is threefold: presentation of the switching principle, unification of earlier results (including a new result for covering codes), and applying switching exhaustively to some common structures with small parameters
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
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
Compressed Genotyping
Significant volumes of knowledge have been accumulated in recent years
linking subtle genetic variations to a wide variety of medical disorders from
Cystic Fibrosis to mental retardation. Nevertheless, there are still great
challenges in applying this knowledge routinely in the clinic, largely due to
the relatively tedious and expensive process of DNA sequencing. Since the
genetic polymorphisms that underlie these disorders are relatively rare in the
human population, the presence or absence of a disease-linked polymorphism can
be thought of as a sparse signal. Using methods and ideas from compressed
sensing and group testing, we have developed a cost-effective genotyping
protocol. In particular, we have adapted our scheme to a recently developed
class of high throughput DNA sequencing technologies, and assembled a
mathematical framework that has some important distinctions from 'traditional'
compressed sensing ideas in order to address different biological and technical
constraints.Comment: Submitted to IEEE Transaction on Information Theory - Special Issue
on Molecular Biology and Neuroscienc
- …