Search arXivSearch

arXiv · 2510.07577

Markoff triples and Nielsen equivalence in $\text{SL}_2(\mathbb{F}_p)$

Abstract

In 2013, Darryl McCullough and Marcus Wanderley made a series of conjectures that describe the Nielsen equivalence classes and $T_2$-equivalence classes of pairs of generators for $\text{SL}_2(\mathbb{F}_q)$ and the Markoff equivalence classes of triples in $\mathbb{F}_q^3$ that solve $x^2+y^2+z^2=xyz+κ$ for some $κ\in\mathbb{F}_q$. (The case $κ=0$ was originally conjectured by Baragar in 1991.) We prove that one of the McCullough-Wanderley conjectures, the "Q-Classification Conjecture" on Markoff triples, implies the others. Then we prove that the Q-Classification Conjecture holds if $q=p$ is a prime such that $24{,}504{,}480$ does not divide $p^2-1$. More generally, for any integer $d$, we reduce the Q-Classification Conjecture for all primes $p\not\equiv \pm 1\,\text{mod}\,d$ to checking whether a roughly $2d\times 2d$ matrix with entries in $\mathbb{Q}[κ]$ is invertible. We (and SageMath) perform this invertibility check for all prime powers $d$ up to $17$, hence the modulus $24{,}504{,}480=2\text{lcm}(1,2,\dots,17)$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Daniel E. Martin. 2025-11-21. Markoff triples and Nielsen equivalence in $\text{SL}_2(\mathbb{F}_p)$. https://arxiv.org/abs/2510.07577

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT