On the Integrality of n-th Roots of Generating Functions
Abstract
Motivated by the discovery that the eighth root of the theta series of the E8 lattice and the 24th root of the theta series of the Leech lattice both have integer coefficients, we investigate the question of when an arbitrary element f in R (where R = 1 + xZ[[x]]) can be written as f = gn for g in R, n >= 2. Let Pn := gn : g in R and let mun := n Productp|n p. We show among other things that (i) for f in R, f in Pn <=> f mod mun in Pn, and (ii) if f in Pn, there is a unique g in Pn with coefficients mod mun/n such that f == gn (mod mun). In particular, if f == 1 (mod mun) then f in Pn. The latter assertion implies that the theta series of any extremal even unimodular lattice in Rn (e.g. E8 in R8) is in Pn if n is of the form 2i 3j 5k (i >= 3). There do not seem to be any exact analogues for codes, although we show that the weight enumerator of the r-th order Reed-Muller code of length 2m is in P2r. We give a number of other results and conjectures, and establish a conjecture of Paul D. Hanna that there is a unique element f in Pn (n != 2) with coefficients restricted to the set 1, 2, ..., n.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.