3 papers
math.CO2026
Resolvable Triple Arrays
Alexey Gordeev, Lars-Daniel Ãhman
We present a new construction of triple arrays by combining a symmetric 2-design with a resolution of another 2-design. This is the first general method capable of producing non-ex…
math.CO2025
Near Triple Arrays
Alexey Gordeev, Klas Markström, Lars-Daniel Ãhman
We introduce near triple arrays as binary row-column designs with at most two consecutive values for the replication numbers of symbols, for the intersection sizes of pairs of rows…
math.CO2024
Enumeration of Row-Column Designs
Gerold Jäger, Klas Markström, Lars-Daniel Ãhman +1
We computationally completely enumerate a number of types of row-column designs up to isotopism, including double, sesqui and triple arrays as known from the literature, and two ne…