ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let g∈PSL⁡2(Z)g\in\operatorname{PSL}_{2}(\mathbb{Z}) be hyperbolic. Let L(g;p)L(g;p) denote the longest orbit of gg on Y−2(Fp)\mathbb{Y}_{-2}(\mathbb{F}_{p}), where Y−2(Fp)\mathbb{Y}_{-2}(\mathbb{F}_{p}) is the set of orbits of the even-sign-change Klein four-group on the nonzero Markoff surface over Fp\mathbb{F}_{p}. An element gg is ambiguous if its conjugacy class is taken to the conjugacy class of g−1g^{-1} by an element of PGL⁡2(Z)\operatorname{PGL}_{2}(\mathbb{Z}) of determinant −1-1. Longest-orbit conjecture. If gg is ambiguous, then there are constants C1=C1(g)>0C_{1}=C_{1}(g)>0 and C2=C2(g)>C1C_{2}=C_{2}(g)>C_{1} such that

C1p≤L(g;p)≤C2pC_{1}p\leq L(g;p)\leq C_{2}p

for all primes pp, and the measures

1#{primes p≤X}(∑p≤XδL(g;p)/p)\frac{1}{\#\{\text{primes }p\leq X\}}\left(\sum_{p\leq X}\delta_{L(g;p)/p}\right)

converge as X→∞X\to\infty to a compactly supported Borel probability measure on R\mathbb{R}. If gg is not ambiguous, then there is a constant c=c(g)c=c(g) such that L(g;p)≥cp2L(g;p)\geq cp^{2} for all primes pp, and the measures

1#{primes p≤X}(∑p≤XδL(g;p)/p2)\frac{1}{\#\{\text{primes }p\leq X\}}\left(\sum_{p\leq X}\delta_{L(g;p)/p^{2}}\right)

converge as X→∞X\to\infty to a compactly supported Borel probability measure on R\mathbb{R}. In particular, for κ=−2\kappa=-2,

lim⁡p→∞log⁡L(g;p)log⁡p={1if g is ambiguous,2if g is not ambiguous.\lim_{p\to\infty}\frac{\log L(g;p)}{\log p}=\begin{cases}1&\text{if }g\text{ is ambiguous},\\2&\text{if }g\text{ is not ambiguous.}\end{cases}

This conjecture predicts a sharp dichotomy between linear and quadratic longest-orbit growth, together with limiting distributions after the corresponding normalization. It is motivated by computations for explicit hyperbolic words and by the equivalence between cyclic-palindrome and ambiguous elements established earlier in the paper; the asserted bounds, convergence statements, and limiting exponents remain open.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.