The lengths of conjugators in the model filiform groups
Abstract
The conjugator length function of a finitely generated group gives the optimal upper bound on the length of a shortest conjugator for any pair of conjugate elements in the ball of radius n in the Cayley graph of . We prove that polynomials of arbitrary degree arise as conjugator length functions of finitely presented groups. To establish this, we analyse the geometry of conjugation in the discrete model filiform groups d = ZdφZ where is φ is the automorphism of Zd that fixes the last element of a basis a1,…,ad and sends ai to aiai+1 for i<d. The conjugator length function of d is polynomial of degree d.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.