Effective bounds on differences of singular moduli that are S-units

TL;DR

This paper develops effective methods to identify singular moduli differences that are S-units, providing explicit bounds and algorithms, and explores conjectures related to their uniformity under certain hypotheses.

Contribution

It introduces effective bounds and algorithms for determining singular moduli differences that are S-units, extending results to infinitely many S and under GRH.

Findings

Effective methods for finding singular S-units for infinitely many S

Conditional results assuming GRH for the case when j_0=0

Numerical experiments suggesting a uniformity conjecture

Abstract

Given a singular modulus $j_0$ and a set of rational primes $S$, we study the problem of effectively determining the set of singular moduli $j$ such that $j-j_0$ is an $S$-unit. For every $j_0 \neq 0$, we provide an effective way of finding this set for infinitely many choices of $S$. The same is true if $j_0=0$ and we assume the Generalized Riemann Hypothesis. Certain numerical experiments will also lead to the formulation of a "uniformity conjecture" for singular $S$-units.