New upper bounds for covering arrays of strength 3 and 4

We give explicit covering arrays that improve the best known size for 31 parameter sets: 13 of strength 3 and 18 of strength 4. The note describes the constructions, the verification by two separately written checkers, the use of a language model as a tool, a baseline without it and a pre-registered prediction that failed. Version 1.1 corrects version 1.0, which claimed 39 parameter sets: eight had already been overtaken by a deposit of Bai XunDi (doi:10.5281/zenodo.23787055), credited in the note.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-10-31
DOI
https://doi.org/10.5281/zenodo.23842218
Primary Topic
Advanced Combinatorial Mathematics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

New upper bounds for covering arrays of strength 3 and 4

Theo Nicolas Sitjar
1 links
Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
preprint

New upper bounds for covering arrays of strength 3 and 4

Theo Nicolas Sitjar
preprint en

Abstract

We give explicit covering arrays that improve the best known size for 31 parameter sets: 13 of strength 3 and 18 of strength 4. The note describes the constructions, the verification by two separately written checkers, the use of a language model as a tool, a baseline without it and a pre-registered prediction that failed. Version 1.1 corrects version 1.0, which claimed 39 parameter sets: eight had already been overtaken by a deposit of Bai XunDi (doi:10.5281/zenodo.23787055), credited in the note.

Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon
New upper bounds for covering arrays of strength 3 and 4 — Theo Nicolas Sitjar · Zenodo (CERN European Organization for Nuclear Research) (2026) | TGRS Research Map | TGRS