2025/06/24 by Michael P. Allocca, Allocca, Michael, Max Trimmer +1
Biochemistry, Genetics and Molecular Biology · Mathematics · Psychology · #DNA and Biological Computing #FOS: Mathematics #Finite Group Theory Research #Group Theory (math.GR) #Phonetics and Phonology Research
paper · pdf · doi:10.48550/arxiv.2506.19216
openalex publication_date 2025/06/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We investigate the properties of word lengths of elements from a three-reflection symmetric generating set of the dihedral group Dn. Specifically, we provide the upper bound λ1(Dn,S) ≤ \lfloor(n)/(2)\rfloor + 1 for a quantity λ1 defined in arXiv:1104.5044, which measures the stability of a finitely presented group under perturbations in the words corresponding to certain elements with respect to specific presentations. This quantity has been of recent interest due to its role in the application of group theory to computational genomics, and we aim to introduce techniques in additive combinatorics to its discourse.