block design 1combinatorial optimization 1covering design 1satisfiability search 1single-change design 1
From the 1 of 3 linked papers with an AI index.
Showing math.COShow all
2 papers · 1 filter
math.CO2026
A tight single-change covering design with block size 6
Richard Bean
The paper constructs a tight single‑change covering design with parameters v=26 and block size k=6, resolving an open problem about the existence of such designs with block size gr…
math.CO2026
Critical Sets in Latin Squares and Associated Structures
Richard Winston Bean
A critical set in a Latin square of order is a set of entries in an array which can be embedded in precisely one Latin square of order , with the property that i…