More nonexistence results for symmetric pair coverings
Nevena Franceti\'c, Sarada Herke, Daniel Horsley

TL;DR
This paper extends nonexistence results for symmetric pair coverings by adapting matrix rational congruence methods, proving certain cyclic and excess-specific symmetric coverings cannot exist.
Contribution
It introduces new nonexistence proofs for symmetric coverings using rational matrix congruence techniques, expanding prior determinant-based methods.
Findings
Certain cyclic symmetric coverings are proven not to exist.
Nonexistence of symmetric coverings with specific excesses is established.
The methods generalize previous nonexistence results for symmetric pair coverings.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Finite Group Theory Research · Limits and Structures in Graph Theory
