Determining Covering Array Numbers via Balanced Covering Arrays
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915564330418176 |
|---|---|
| author | Hiess, Irene Kampel, Ludwig |
| author_facet | Hiess, Irene Kampel, Ludwig |
| contents | In this article we determine five previously unknown covering array numbers (CANs). We do so using properties of so called balanced covering arrays together with a computational result for these. The balance properties allow us to generalize the (computational) non-existence result for balanced covering arrays to covering arrays. Covering arrays are combinatorial designs that can be considered generalizations of orthogonal arrays, when dropping the restriction that the considered $t$-tuples appear exactly $λ$ times, and instead require them to appear at least $λ$ times. While this generalization renders the existence of covering arrays trivial, it raises the question for their optimality, respectively the smallest number of rows, the CAN, for which a certain covering array exists. The CANs determined in this paper were tightly bound for decades, but remained ultimately unknown. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_17596 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Determining Covering Array Numbers via Balanced Covering Arrays Hiess, Irene Kampel, Ludwig Combinatorics 05B40, 05B30, 05B20 In this article we determine five previously unknown covering array numbers (CANs). We do so using properties of so called balanced covering arrays together with a computational result for these. The balance properties allow us to generalize the (computational) non-existence result for balanced covering arrays to covering arrays. Covering arrays are combinatorial designs that can be considered generalizations of orthogonal arrays, when dropping the restriction that the considered $t$-tuples appear exactly $λ$ times, and instead require them to appear at least $λ$ times. While this generalization renders the existence of covering arrays trivial, it raises the question for their optimality, respectively the smallest number of rows, the CAN, for which a certain covering array exists. The CANs determined in this paper were tightly bound for decades, but remained ultimately unknown. |
| title | Determining Covering Array Numbers via Balanced Covering Arrays |
| topic | Combinatorics 05B40, 05B30, 05B20 |
| url | https://arxiv.org/abs/2510.17596 |