Size-minimal combinatorial designs of staircase type
Mathematica Slovaca · 26.04.2026 · 76 (2) · 291-301
DOI: 10.1515/ms-2026-0129 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematica Slovaca, online erschienen am 19.03.2026. Verfasst von Barbora Batíková und 2 weiteren Autor:innen. Die Arbeit nennt 3 Literaturangaben.
Abstract (Originalsprache)
Given a positive integer n and a partitioning n = r 1 s 1 + ⋯ + r t s t , t , r i , s i positive integers, such that r 1 > ⋯ > r t (for t ≥ 2), we can write n symbols 1, …, n in the form of a staircase matrix having r 1 rows where first r 1 − r 2 rows have t 1 columns, next r 2 − r 3 rows have t 1 + t 2 columns, etc., and finally last r t rows have t 1 + ⋯ + t k columns. Then we can construct a design having r 1 + s 1 + ⋯ + s t sets by taking all r 1 rows and s 1 + ⋯ + 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. In this note, the minimum size of combinatorial designs of staircase type is found.
Zitieren
APA
Batíková, B., Kepka, T. J., & Němec, P. C. (2026). Size-minimal combinatorial designs of staircase type. Mathematica Slovaca, 76(2), 291-301. https://doi.org/10.1515/ms-2026-0129
Vancouver
Batíková B, Kepka TJ, Němec PC. Size-minimal combinatorial designs of staircase type. Mathematica Slovaca. 2026;76(2):291-301. doi:10.1515/ms-2026-0129
BibTeX
@article{Batkov2026,
author = {Batíková, Barbora and Kepka, Tomáš J. and Němec, Petr C.},
title = {Size-minimal combinatorial designs of staircase type},
journal = {Mathematica Slovaca},
year = {2026},
volume = {76},
number = {2},
pages = {291--301},
doi = {10.1515/ms-2026-0129}
}
EUVIMED