Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2503.14373 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908273659084800 |
|---|---|
| author | ková, Barbora Batí Kepka, Tomáš J. Němec, Petr C. |
| author_facet | ková, Barbora Batí Kepka, Tomáš J. Němec, Petr C. |
| contents | Given a positive integer $n$ and a partitioning $n=r_1s_1+\dots+ r_ts_t$, $t,r_i,s_i$ positive integers, such that $r_1>\dots>r_t$ (for $t\ge 2$), we can write $n$ symbols $1,\dots,n$ in the form of a staircase matrix having $r_1$ rows where first $r_1-r_2$ rows have $x_1$ columns, next $r_2-r_3$ rows have $t_1+t_2$ columns, etc., and finally last $r_t$ rows have $t_1+\dots+t_k$ columns. Then we can construct a~design having $r_1+s_1+\dots+s_t$ sets by taking all $r_1$ rows and $s_1+\dots+s_t$ columns of this staircase matrix. Such designs have exactly two replications of each symbol and various cardinalities for the sets constituting the design. The minimum size of combinatorial designs of staircase type is found. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_14373 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Size-minimal combinatorial designs of staircase type ková, Barbora Batí Kepka, Tomáš J. Němec, Petr C. Combinatorics 05B05 Given a positive integer $n$ and a partitioning $n=r_1s_1+\dots+ r_ts_t$, $t,r_i,s_i$ positive integers, such that $r_1>\dots>r_t$ (for $t\ge 2$), we can write $n$ symbols $1,\dots,n$ in the form of a staircase matrix having $r_1$ rows where first $r_1-r_2$ rows have $x_1$ columns, next $r_2-r_3$ rows have $t_1+t_2$ columns, etc., and finally last $r_t$ rows have $t_1+\dots+t_k$ columns. Then we can construct a~design having $r_1+s_1+\dots+s_t$ sets by taking all $r_1$ rows and $s_1+\dots+s_t$ columns of this staircase matrix. Such designs have exactly two replications of each symbol and various cardinalities for the sets constituting the design. The minimum size of combinatorial designs of staircase type is found. |
| title | Size-minimal combinatorial designs of staircase type |
| topic | Combinatorics 05B05 |
| url | https://arxiv.org/abs/2503.14373 |