One-modulus formula for refined tree coefficients

Let γ=(γ1,,γn)\boldsymbol\gamma=(\gamma_1,\ldots,\gamma_n) be an ordered collection of charges, let γ^\hat{\boldsymbol\gamma} denote the corresponding hatted charge data, and let Zn1\mathscr{Z}_{n-1} index the n1n-1 possible adjacent combinations. Define

Gn(γ^;τ2,β)=Φ^n1M({v};2τ2(q+βθ),2τ2βθ).\mathscr{G}_n(\hat{\boldsymbol\gamma};\tau_2,\beta)=\hat\Phi^M_{n-1}(\{\boldsymbol v_{\ell}\};\sqrt{2\tau_2}(\boldsymbol q+\beta\boldsymbol\theta),\sqrt{2\tau_2}\,\beta\boldsymbol\theta).

In the one-modulus case, the functions Rnref\mathscr{R}^{\rm ref}_n determining the coefficients are given by

Rnref(γ^;τ2,β)=12n1JZn1bJδJGnJ(γ^J;τ2,β),\mathscr{R}^{\rm ref}_n(\hat{\boldsymbol\gamma};\tau_2,\beta)=\frac{1}{2^{n-1}}\sum_{\mathcal J\subseteq\mathscr{Z}_{n-1}}b_{|\mathcal J|}\,\delta_{\mathcal J}\,\mathscr{G}_{n-|\mathcal J|}(\hat{\boldsymbol\gamma}_{\mathcal J};\tau_2,\beta),

where bnb_n are the Taylor coefficients of tanh(x)/x\tanh(x)/x, bn2=2n(2n1)n!Bnb_{n-2}=\frac{2^n(2^n-1)}{n!}B_n, δJ=kJδΓk\delta_{\mathcal J}=\prod_{k\in\mathcal J}\delta_{\Gamma_k}, and Γk=i=1kj=k+1nγij\Gamma_k=\sum_{i=1}^k\sum_{j=k+1}^n\gamma_{ij}. The datum γ^J\hat{\boldsymbol\gamma}_{\mathcal J} is obtained by combining each γ^i\hat\gamma_i with the next charge for iJi\in\mathcal J. One-modulus refined-coefficient conjecture. In the one-modulus case, the functions Rnref\mathscr{R}^{\rm ref}_n are given by the displayed finite sum with the coefficients and Kronecker-delta factors specified above. The observation motivating this formula is that, for n=3n=3 and 44, the sum over Schröder trees undergoes a large cancellation, leaving only this type of term. The claim is supported in those cases by the stated cancellation, but its general validity is not established in the supplied text.

Sources & referencesView supporting material

Primary source

Sergei Alexandrov, “Mock modularity at work, or black holes in a forest”, arXiv:2505.02572 (2025).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.