Unitary Cayley graphs whose spanning-tree counts are smooth over the modulus
Let X_n be the unitary Cayley graph on Z/nZ, in which x and y are adjacent exactly when gcd(x−y, n) = 1, and let τ(n) be its number of spanning trees. Call n tree-smooth if every prime divisor of τ(n) divides n. We prove that n is tree-smooth if and only if n = 1, n is prime, n = 2^a with a ≥ 1, or n = 2^a·3^b with a, b ≥ 1. The proof combines the known closed form for τ(n) coming from the Laplacian spectrum of X_n with an elementary ℓ-adic valuation criterion. Its key step is a zero-sum statement in the group (Z/rZ)^×/{±1}: for every prime r ≥ 7 the shifted primes p−1, with p < r an odd prime, have a product of at least two distinct factors that is congruent to ±1 (mod r). We prove this with Olson's theorem and the Rosser–Schoenfeld lower bound for π(x) when r ≥ 1000, and by computer below that. All computations were verified by two independent programs.
Authors
- Jesse Lee Berglund
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-21
- DOI
- https://doi.org/10.5281/zenodo.24430449
- Primary Topic
- Analytic Number Theory Research
- Type
- preprint