ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let p=2p=2, and let Fd{\mathcal F}_d denote the family considered in the paper. The preceding corollaries establish finite monodromy when d=2a+1d=2^a+1 for some a≥1a\geq 1, and when d=(2a+1)/(2b+1)d=(2^a+1)/(2^b+1) with a>b≥1a>b\geq 1 and a=bca=bc for an odd integer cc. Finite-monodromy classification conjecture. The family Fd{\mathcal F}_d has finite monodromy if and only if dd has one of these forms:

d=2a+1for some a≥1,d=2^a+1\quad\text{for some }a\geq 1,

or

d=2a+12b+1for some b≥1 and a=bc with odd c≥3.d=\frac{2^a+1}{2^b+1}\quad\text{for some }b\geq 1\text{ and }a=bc\text{ with odd }c\geq 3.

The conjecture asserts that the two families of examples supplied by the preceding corollaries exhaust all finite-monodromy cases when p=2p=2; the source notes that this has been checked computationally for dd up to 1000010000.

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.