2 papers
math.GR2026
How Many Reflections Make a Dihedral Set Large?
Be'eri Greenfeld, George King, Xiaoxuan Li +1
Given a size- subset of a group , how large can the product set be? We study this question, at several layers of refinement, for the infinite dihedral group. First,…
math.CO2025
Exhaustive Generation of Pattern-Avoiding s-Words
Samuel Buick, Madeleine Goertz, Amos Lastmann +6
The most well-known Gray code of permutations is plain changes. It was discovered in the 1600s by bell-ringers who wished to order the permutations of [n] by swaps (e.g., 123, 132,…