3 papers
cs.FL2026
Combinatorial structures connecting Latin squares and bireversible automata
Brian Curtin, Dmytro Savchuk
This paper explores the theory of letter transducers, Mealy automata, and bireversible automata from a combinatorial perspective analogous to the theory of Latin squares. We view t…
math.CO2026
Generalizations of nets and Latin squares
Brian Curtin
We examine combinatorial structures that generalize -nets, orthogonal arrays, and mutually orthogonal Latin squares. By a reticulation we mean a point set and two collection…
math.CO2026
Excluded power graphs of groups
Brian Curtin
Let be a set of integers greater than one. The -excluded power graph of a group has vertex set and an edge from to each power of other th…