Word length perturbations in certain symmetric presentations of dihedral groups

Given a finite group with a generating subset there is a well-established notion of length for a group element given in terms of its minimal length expression as a product of elements from the generating set. Recently, certain quantities called $\lambda_{1}$ and $\lambda_{2}$ have been defined that allow for a precise measure of how stable a group is under certain types of small perturbations in the generating expressions for the elements of the group. These quantities provide a means to measure differences among all possible paths in a Cayley graph for a group, establish a group theoretic analog for the notion of stability in nonlinear dynamical systems, and play an important role in the application of groups to computational genomics. In this paper, we further expose the fundamental properties of $\lambda_{1}$ and $\lambda_{2}$ by establishing their bounds when the underlying group is a dihedral group. An essential step in our approach is to completely characterize so-called symmetric presentations of the dihedral groups, providing insight into the manner in which $\lambda_{1}$ and $\lambda_{2}$ interact with finite group presentations. This is of interest independent of the study of the quantities $\lambda_{1},\; \lambda_{2}$. Finally, we discuss several conjectures and open questions for future consideration.

[1]  D. L. Johnson Presentations of groups , 1976 .

[2]  R. Carter REFLECTION GROUPS AND COXETER GROUPS (Cambridge Studies in Advanced Mathematics 29) , 1991 .

[3]  Geoff C. Smith,et al.  Topics in group theory , 2000, AMS/MAA Textbooks.

[4]  Attila Egri-Nagy,et al.  Group-theoretic models of the inversion process in bacterial genomes , 2014, Journal of mathematical biology.

[5]  Jennifer F. Vasquez,et al.  On the Structure of Involutions and Symmetric Spaces of Dihedral Groups , 2012, 1205.3207.

[6]  Ian Chiswell A course in formal languages, automata and groups / Ian Chiswell , 2008 .

[7]  H. O. Foulkes Abstract Algebra , 1967, Nature.

[8]  Pavel A. Pevzner,et al.  Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals , 1995, JACM.

[9]  Vineet Bafna,et al.  Genome rearrangements and sorting by reversals , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[10]  H. Coxeter,et al.  Generators and relations for discrete groups , 1957 .

[11]  Vincent Moulton,et al.  The ‘Butterfly effect’ in Cayley graphs with applications to genomics , 2012, Journal of mathematical biology.

[12]  Anne Bergeron,et al.  A very elementary presentation of the Hannenhalli-Pevzner theory , 2005, Discret. Appl. Math..

[13]  Maureen H. Fenrick Introduction to the Galois correspondence , 1991 .

[14]  Sabrina Hirsch,et al.  Reflection Groups And Coxeter Groups , 2016 .

[15]  Nathan Carter,et al.  Visual Group Theory , 2009 .