More nonexistence results for symmetric pair coverings
From MaRDI portal
Publication:890552
Abstract: A -covering is a pair , where is a -set of points and is a collection of -subsets of (called blocks), such that every unordered pair of points in is contained in at least blocks in . The excess of such a covering is the multigraph on vertex set in which the edge between vertices and has multiplicity , where is the number of blocks which contain the pair . 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 -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.
Recommendations
Cites work
- scientific article; zbMATH DE number 1204080 (Why is no real title available?)
- scientific article; zbMATH DE number 1460605 (Why is no real title available?)
- scientific article; zbMATH DE number 3104192 (Why is no real title available?)
- A note on a three-term recurrence for a tridiagonal matrix.
- Combinatorial Problems
- Combinatorial Properties of Group Divisible Incomplete Block Designs
- Generalising Fisher's inequality to coverings and packings
- Number Theory
- On the non-existence of pair covering designs with at least as many points as blocks
- The Nonexistence of Certain Finite Projective Planes
- The arithmetical invariants of quadratic forms
This page was built for publication: More nonexistence results for symmetric pair coverings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q890552)