English

Coefficient growth in square chains

Number Theory 2019-03-01 v1

Abstract

Suppose ((((x2c1)2c2)2)2ck1)2ck((\cdots((x^{2}-c_{1})^{2}-c_{2})^{2}\cdots)^{2}-c_{k-1})^{2}-c_{k} splits into linear factors over Z\mathbb{Z} and ck0c_{k}\neq0. We show that for each jj and each prime pp, if p2j1p\leq2^{j-1} then pp divides cjc_{j}. Consequently, lncj>142jforj5\ln c_{j}>\frac{1}{4}\cdot2^{j}\,\,\mathrm{for}\,j\geq5 If we also have p3(mod4)p\equiv3\,(\mathrm{mod\,4)} then p2jlgpp^{2^{j-\left\lceil \lg p\right\rceil }} divides cjc_{j}. Consequently, if k3k\geq3, there exists some absolute constant λ>0\lambda>0 so that, lncj>λk2jforallj\ln c_{j}>\lambda k2^{j}\mathrm{\,\,for\,all\,}j These estimates argue against the possibility of explicitly constructing polynomials of the given form for large kk, as the coefficients quickly become too large to manipulate.

Keywords

Cite

@article{arxiv.1902.11164,
  title  = {Coefficient growth in square chains},
  author = {Shawn Walker},
  journal= {arXiv preprint arXiv:1902.11164},
  year   = {2019}
}
R2 v1 2026-06-23T07:54:23.342Z