Some results on the Ryser design conjecture

DOI10.1002/JCD.21699MaRDI QIDQ6187425zbMATH OpenOpenAlexWikidataFDO

Authors Tushar D. Parulekar, Sharad Sane

Publication date 31 January 2024

Published in Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1907.12482

zbMATH Keywords

Ryser design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) General block designs in finite geometry (51E05) Statistical block designs (62K10)

Abstract: A Ryser design $mathcalD$ on $v$ points is a collection of $v$ proper subsets (called blocks) of a point-set with $v$ points such that every two blocks intersect each other in $lambda$ points (and $lambda<v$ is a fixed number) and there are at least two block sizes. A design $mathcalD$ is called a symmetric design, if every point of $mathcalD$ has the same replication number (or equivalently, all the blocks have the same size) and every two blocks intersect each other in $lambda$ points. The only known construction of a Ryser design is via block complementation of a symmetric design. Such a Ryser design is called a Ryser design of Type-1. This is the ground for the Ryser-Woodall conjecture: "every Ryser design is of Type-1". This long standing conjecture has been shown to be valid in many situations. Let $mathcalD$ denote a Ryser design of order $v$, index $lambda$ and replication numbers $r_1,r_2$. Let $e_i$ denote the number of points of $mathcalD$ with replication number $r_i$ (with $i=1,2$). Call $A$ small (respectively large) if $|A|<2lambda$ (respectively $|A|>2lambda$) and average if $|A|=2lambda$. Let $D$ denote the integer $e_1-r_2$ and let $ho>1$ denote the rational number $dfrac{r}_1-1r_2-1$. Main results of the present article are the following. For every block $A$, $r_{1}geq|A|geq{r}_2$ (this improves an earlier known inequality $|A|geq{r}_2$). If there is no small block (respectively no large block) in $mathcalD$, then $Dleq-1$ (respectively $Dgeq0$). With an extra assumption $e_2>e_1$ an earlier known upper bound on $v$ is improved from a cubic to a quadratic in $lambda$. It is also proved that if $vleqlambd{a}^2+lambda+1$ and if $ho$ equals $lambda$ or $lambda-1$, then $mathcalD$ is of Type-1. Finally a Ryser design with $2^n+1$ points is shown to be of Type-1.

Recommendations

• Some results on the Ryser design conjecture. III
• Some results on the Ryser design conjecture. II
• scientific article; zbMATH DE number 1409206
• Towards the Ryser–Woodall λ \lambda ‐design conjecture
• Some results on -design conjecture

Cites work

• A survey of some problems in combinatorial designs - a matrix approach
• All lambda-designs with = 2 p are type-1
• An extension of a theorem of the Bruijn and Erdős on combinatorial designs
• Combinatorics of symmetric designs
• scientific article; zbMATH DE number 3521986 (Why is no real title available?)
• scientific article; zbMATH DE number 1539541 (Why is no real title available?)
• scientific article; zbMATH DE number 3351597 (Why is no real title available?)
• On the \(\lambda\)-design conjecture
• Some characterizations of type-1 -designs
• Some results on λ-designs
• Symmetric designs and related configurations

Cited in

(1)

• Some results on the Ryser design conjecture. III

This page was built for publication: Some results on the Ryser design conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6187425)