arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv math/0509316math.NTmath.CO
收藏

关于Generating Functions的n次根的可积性

On the Integrality of n-th Roots of Generating Functions

Nadia Heninger, E. M. Rains, N. J. A. Sloane

摘要:

基于E_8格的θ级数的第8次根和Leech格的θ级数的第24次根都具有整数系数的发现,我们研究了R中任意元素f(其中R = 1 + xZ[[x]])何时可以写成f = g^n,其中g在R中,n >= 2.设P_n:= {g^n:g in R},设mu_n:= n Product_{p|n} p.我们证明了(i)对f in R,f in P_n <=> fmod mu_n in P_n,(ii)若f in P_n,则P_n中存在系数为mod mu_n/n的唯一g,使得f == g^n(mod mu_n).特别地,如果f == 1(mod mu_n),则f在P_n中.后一个断言意味着R^n中的任何极值偶幺模格(例如R^8中的E_8)的θ级数在P_n中,如果n的形式为2^i3^j5^k(i ≥ 3)。虽然我们证明了长度为2^m的r阶Reed-Muller码的重量计数器在P_{2^r}中,但似乎没有任何精确的码的类似物。我们给出了一些其它的结果和定理,并建立了Paul D. Hanna证明了P_n(n!= 1)中存在唯一的元素f 2)其中系数被限制为集合{1,2,...,n}。

英文摘要:

Motivated by the discovery that the eighth root of the theta series of the E_8 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 = g^n for g in R, n >= 2. Let P_n := {g^n : g in R} and let mu_n := n Product_{p|n} p. We show among other things that (i) for f in R, f in P_n <=> f mod mu_n in P_n, and (ii) if f in P_n, there is a unique g in P_n with coefficients mod mu_n/n such that f == g^n (mod mu_n). In particular, if f == 1 (mod mu_n) then f in P_n. The latter assertion implies that the theta series of any extremal even unimodular lattice in R^n (e.g. E_8 in R^8) is in P_n if n is of the form 2^i 3^j 5^k (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 2^m is in P_{2^r}. 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 P_n (n != 2) with coefficients restricted to the set {1, 2, ..., n}.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑