More nonexistence results for symmetric pair coverings

preprint2015arXivOpen access

Abstract

A (v,k,λ)(v,k,λ)-covering is a pair (V,B)(V, \mathcal{B}), where VV is a vv-set of points and B\mathcal{B} is a collection of kk-subsets of VV (called blocks), such that every unordered pair of points in VV is contained in at least λλ blocks in B\mathcal{B}. The excess of such a covering is the multigraph on vertex set VV in which the edge between vertices xx and yy has multiplicity rxy−λr_{xy}-λ, where rxyr_{xy} is the number of blocks which contain the pair {x,y}\{x,y\}. A covering is symmetric if it has the same number of blocks as points. Bryant et al.(2011) adapted the determinant related arguments used in the proof of the Bruck-Ryser-Chowla theorem to establish the nonexistence of certain symmetric coverings with 22-regular excesses. Here, we adapt the arguments related to rational congruence of matrices and show that they imply the nonexistence of some cyclic symmetric coverings and of various symmetric coverings with specified excesses.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.