Parametric restrictions on quasi-symmetric designs
From MaRDI portal
Publication:2237862
DOI10.1016/J.EJC.2021.103434zbMATH Open1476.05019arXiv2102.05576OpenAlexW3199084077MaRDI QIDQ2237862FDOQ2237862
Publication date: 28 October 2021
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Abstract: In this paper, we attach several new invariants to connected strongly regular graphs (excepting conference graphs on non-square number of vertices) : one invariant called the discriminant, and a p-adic invariant corresponding to each prime number p. We prove parametric restrictions on quasi-symmetric 2-designs with a given connected block graph and a given defect (absolute difference of the two intersection numbers) solely in terms of the defect and the parameters of , including these new invariants. This is a natural analogue of Schutzenberger's Theorem and the Shrikhande-Chowla-Ryser theorem. This theorem is effective when these graph invariants can be explicitly computed. We do this for complete multipartite graphs, co-triangular graphs, symplectic non-orthogonality graphs (over the field of order ) and the Steiner graphs, yielding explicit restrictions on the parameters of quasi-symmetric 2-designs whose block graphs belong to any of these four classes.
Full work available at URL: https://arxiv.org/abs/2102.05576
Recommendations
Association schemes, strongly regular graphs (05E30) Other designs, configurations (05B30) Connectivity (05C40)
Cites Work
- Title not available (Why is that?)
- An Embedding Theorem for Balanced Incomplete Block Designs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On t-designs
- Quasi-symmetric designs with fixed difference of block intersection numbers
- The Nonexistence of Certain Finite Projective Planes
- Quasi-symmetric designs with the difference of block intersection numbers two
- On quasi-symmetric designs with intersection difference three
- Title not available (Why is that?)
- Strongly Regular Graphs Derived from Combinatorial Designs
- Title not available (Why is that?)
- The application of invariant theory to the existence of quasi-symmetric designs
- Geometric invariants for quasi-symmetric designs
- On quasi-symmetric designs
- Quasi-symmetric designs and the Smith normal form
- Binary codes and quasi-symmetric designs
- Conditions for the parameters of the block graph of quasi-symmetric designs
- An infinite family of quasi-symmetric designs
- Combinatorial Problems
- The Impossibility of Certain Symmetrical Balanced Incomplete Block Designs
- Title not available (Why is that?)
- Quasi-symmetric designs and self-dual codes
- Non-Existence of Some Unsymmetrical Partially Balanced Incomplete Block Designs
- Non-derivable strongly regular graphs from quasi-symmetric designs
- The Non-Existence of Certain Affine Resolvable Balanced Incomplete Block Designs
- Corrections and supplements to ``On tight 4-designs
Cited In (3)
This page was built for publication: Parametric restrictions on quasi-symmetric designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2237862)