Questions in Geometric Group Theory — Q 12.7
Status Partially solved · unsolvedmath.comLLM status Open unverified
Top Open Problems Not reported cataloguedPartially solvedOpenStatement
Definitions and mathematical statement
Let $F_n$ be the free group on a fixed basis of size $n\geq2$, and let $\alpha\in\operatorname{Aut}(F_n)$. A right-invariant order is a strict total order $<$ on $F_n$ such that \[ g<h\ \Longrightarrow\ gk<hk\qquad(g,h,k\in F_n). \] The automorphism preserves this order when $g<h$ implies $\alpha(g)<\alpha(h)$. Characterize the automorphisms for which some right-invariant order is preserved.Equivalently, seek a subset $P\subset F_n$ satisfying \[ F_n=P\sqcup\{1\}\sqcup P^{-1},\qquad PP\subset P, \qquad\alpha(P)=P. \] The corresponding order is $g<h$ exactly when $hg^{-1}\in P$. No invariance of $P$ under conjugation is imposed, since that would require a two-sided order and would change the question.
A necessary obstruction is a nonconstant finite orbit: if $\alpha^m(g)=g$ for some $m>1$ but $\alpha(g)\ne g$, order preservation would give an impossible strict cycle of inequalities. Fixed elements themselves are allowed; in particular the identity automorphism preserves every right order. Determine whether further obstructions are needed and, if so, formulate a useful necessary-and-sufficient condition from the automorphism. The question concerns an order on the entire free group, not just an order on its abelianization. The chosen order may depend on the automorphism and on its rank.
Short English statement
Which automorphisms of a free group preserve a right-invariant total order?Sources
- S1 ULAM.AI and the UnsolvedMath Contributors, supplied problems.json, record 1101207 (AMR-010-1207), AMR Open Problem Lists. Catalogue identity and source transcription; CC BY 4.0. https://huggingface.co/datasets/ulamai/UnsolvedMath.
- S2 Bestvina - Questions in Geometric Group Theory (pdf) (2004), Question 12.7 (PDF page 20). Original source indexed by AMR-010-1207. https://www.math.utah.edu/~bestvina/eprints/questions-updated.pdf.
Statement licence: CC-BY-4.0 · Source file
Contributions 0
No attempts yet. Significant partial results and substantial reductions are welcome. Contribute an attempt.