Machine learning the arithmetic of Boyd's Mahler measure conjectures
Abstract
Boyd conjectured that the Mahler measure of for an integer, is given by , where is the elliptic curve associated to the zero locus of and is a rational number. We study various arithmetic properties of using a dataset containing the first values of , combining large-scale statistical analysis assisted by Claude with transformer-based experiments carried out using Axolver. We recover Boyd's observation that, apart from a few exceptions, is the reciprocal of an integer. The size of this integer is governed by the conductor of the elliptic curve. Moreover, its -adic valuations display markedly different behavior according to the prime. For , the probability of for appears to be . For the primes and , however, we find additional arithmetic structure involving congruence conditions on and the primes of bad reduction of . Although the neural networks do not predict exactly, they recover significant information about its magnitude and valuations. In particular, the experiments at the prime suggest arithmetic structure beyond the explicit predictor obtained from our statistical analysis.
Keywords
Cite
@article{arxiv.2608.00615,
title = {Machine learning the arithmetic of Boyd's Mahler measure conjectures},
author = {Alberto Alfarano and Pablo Bianucci and Matilde N. Lalín and Berend Ringeling},
journal= {arXiv preprint arXiv:2608.00615},
year = {2026}
}
Comments
36 pages, 19 figures