Search arXiv⌕ Search

arXiv · 2610.15587

Bloch torsion and modular combinations of Nahm sums

Abstract

We construct a positive-definite symmetric integral $12\times12$ matrix $A$ such that, for every solution $Q$ of Nahm's equations $1-Q=Q^A$ with $Q_i\ne0,1$ for all $i$, the associated element $\sum_i[Q_i]$ is torsion in the Bloch group of $\mathbb{Q}(Q_1,\ldots,Q_{12})$. However, the Nahm sum $F_{A,B,C}(τ)$ is nonmodular for every $B\in\mathbb{Q}^{12}$ and $C\in\mathbb{Q}$. Thus the torsion condition for all solutions in Nahm's conjecture is not sufficient for the existence of a modular Nahm sum.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xuejun Guo. 2026-10-11. Bloch torsion and modular combinations of Nahm sums. https://arxiv.org/abs/2610.15587

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

KEEP EXPLORING

Related papers

Sporadic points on $X_0(N)$

We determine all integers $N$ for which the modular curve $X_0(N)$ admits a sporadic CM point (of any degree), as well as all $N$ for which $X_0(N)$ admits a sporadic point, whether CM or non-CM. In a sense, our results generalize the classification of isogenies of elliptic curves over $\Q$ due to Mazur and Kenku: their work determines the $X_0(N)$ with degree 1 sporadic points, whereas we classify all $X_0(N)$ that have a sporadic point of arbitrary degree.

math.NT↗

On the Number of Prime Factors of Consecutive Integers

We prove that there are infinitely many $n$ such that $ω(n+k) \ll \log k$ for all integers $k \ge 2$. This improves on a result of Tao and Teräväinen (2025), who have $O(k)$ in place of $O(\log k)$. As corollaries, we make progress on a number of questions posed by Erdős. The proof is based on a quantitative refinement of the Tao-Teräväinen probabilistic argument, combining a refined sieve construction with upper bounds for high moments and the resulting tail estimates. Moreover, we formulate a conjecture on integers with many prime factors based on Cramér-type random models. Assuming this conjecture, the main bound is essentially sharp.

math.NT↗