加载中…
We investigate the properties of word lengths of elements from a three-reflection symmetric generating set of the dihedral group . Specifically, we provide the upper bound for a quantity 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.

生成讲解博客的中文版本

生成AI智能校验的中文版本