3 papers
math.CO2026
Semidefinite lower bounds for covering codes
Dion Gijswijt, Sven Polak
Let denote the minimum size of a -ary covering code of word length and covering radius . In other words, is the minimum size of a set of -ary cod…
math.CO2026
Circular sorting, strong complete mappings and wreath product constructions
Paul Bastide, Anurag Bishnoi, Carla Groenland +2
We continue the study of Adin, Alon and Roichman [arXiv:2502.14398, 2025] on the number of steps required to sort labelled points on a circle by transpositions. Imagine that th…
math.OC2025
Exploiting Symmetries in Optimal Quantum Circuit Design
Frank de Meijer, Dion Gijswijt, Renata Sotirov
A physical limitation in quantum circuit design is the fact that gates in a quantum system can only act on qubits that are physically adjacent in the architecture. To overcome this…