ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let m≥3m\geq 3 and write

jm(z)=1qm(z)+∑n≥0αn(m)qm(z)n.j_m(z)=\frac{1}{q_m(z)}+\sum_{n\geq 0}\alpha_n(m)q_m(z)^n.

Brent's interpolation conjecture. For every integer n>−2n>-2, there exists a polynomial An(x)∈Q[x]A_n(x)\in\mathbb{Q}[x] such that αn(m)=An(m)\alpha_n(m)=A_n(m) for m=3,4,…m=3,4,\ldots, with A−1(x)≡1A_{-1}(x)\equiv 1, A0(x)=24(x2+4/3)A_0(x)=24(x^2+4/3), and A1(x)=276x2(x4−8x2/69−16/23)A_1(x)=276x^2(x^4-8x^2/69-16/23). For n>1n>1, the conjecture further asserts

An(x)=a‾n(x−2)(x+2)xn+1an(x),A_n(x)=\overline a_n(x-2)(x+2)x^{n+1}a_n(x),

where {a‾n}\{\overline a_n\} is the McKay–Thompson series of class 4A4A, an(x)a_n(x) is monic and irreducible over Q\mathbb{Q} of degree 2n2n, and the coefficient of xkx^k in ana_n is zero if and only if kk is odd; it also includes the stated congruence divisibility and Galois-group assertions for prime nn and for Gal⁡(an,Q)\operatorname{Gal}(a_n,\mathbb{Q}). The claim predicts a structured polynomial family whose factorizations encode McKay–Thompson coefficients, congruences, and large Galois groups; the paper reports numerical evidence but does not establish these assertions.

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.