Math-13342 · mathematics · Topology

Math-13342

Problem 3.3 — Does there exist an algorithm which produces the integer M in Theorem 3.1, given φ1,...,φ n?

Status Open · unsolvedmath.comLLM status Open unverified

Top Open Problems Not reported cataloguedOpenOpen

Statement

Definitions and mathematical statement

Problem 3.3. Given $\varphi_1,\ldots,\varphi_n$, does there exist an algorithm producing the integer $M$ asserted in Theorem 3.1? The theorem, the nature of the $\varphi_i$, their admissibility hypotheses, and their effective input encoding are absent from the supplied record.

Writing $\mathcal D$ for the intended class of admissible finite tuples and $R(\varphi_1,\ldots,\varphi_n;M)$ for the unprovided theorem's conclusion, the algorithmic target is a procedure that halts on every input in $\mathcal D$ and returns an integer $M\in{\mathbb{Z}}$ for which that conclusion holds. These symbols expose missing data; they do not define a substitute theorem. If Theorem 3.1 restricts $M$ to positive integers or requires a threshold valid for all larger exponents, those conditions must be recovered rather than guessed.

The source asks for an effective witness from the tuple, not a proof of bare existence, the least possible integer, or a prescribed complexity bound. It does not state whether $n$ and the ambient group or surface are fixed or part of the input. No mapping-class, pseudo-Anosov, or independence assumption is silently supplied.

Short English statement

Make the integer in Theorem 3.1 effective from the finite input tuple. The theorem and its hypotheses are missing, so neither the output property nor the admissible inputs can be specified further.

Sources

  • Local UnsolvedMath registry, permanent ID 11000231, source code catalogue entry, Problem 3.3, PDF page 270. No individual proposer is supplied.
  • Farb, Problems on Mapping Class Groups and Related Topics. Supplied URL: https://www.math.uchicago.edu/~farb/papers/mcgbook.pdf; recorded access 2026-07-29; extraction pdf-font-structure. The volume contains 329 explicitly typeset headings across chapters, with repeated labels disambiguated by page. The essential cross-reference Theorem 3.1 is not supplied.
  • Supplied status open and OPEN-TRIAGE. The research summary says only "Cannot verify." Current primary-literature status and redistribution terms for the publicly accessible author/publisher copy remain NEEDS_REVIEW.

Catalogue entry

Statement licence: CC-BY-4.0 · Source file

Contributions 0

No attempts yet. Significant partial results and substantial reductions are welcome. Contribute an attempt.