Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Source. Theorem 2.2, Section 2, p. 3 of the author's version named on the source card; proof pp. 3--4. Theorem 2.1 on p. 3. Read on the PDF page images.

Statement

Setting (p. 2). For odd integers qq and rr, Tq,r(n)=n/2T_{q,r}(n)=n/2 for even nn and Tq,r(n)=(qn+r)/2T_{q,r}(n)=(qn+r)/2 for odd nn; the generating function of its nn-th iterates is

fn,q,r(x)=∑k=1∞Tq,r(n)(k)xk,f_{n,q,r}(x)=\sum_{k=1}^{\infty}T_{q,r}^{(n)}(k)x^k ,

and Oq,r(n)(k)O_{q,r}^{(n)}(k) is the number of odd terms among k,Tq,r(1)(k),…,Tq,r(n−1)(k)k,T_{q,r}^{(1)}(k),\dots,T_{q,r}^{(n-1)}(k).

Theorem 2.1 (p. 3). For fixed odd (q,r)(q,r) and all n,k,j≥0n,k,j\ge0,

Tq,r(n)(2nk+j)=qOq,r(n)(j)k+Tq,r(n)(j).T_{q,r}^{(n)}(2^nk+j)=q^{O_{q,r}^{(n)}(j)}k+T_{q,r}^{(n)}(j).

The paper presents this as a generalization of a known fact for the 3x+13x+1 map, citing Terras and Lagarias.

Theorem 2.2 (p. 3). Each fn,q,rf_{n,q,r} is a rational function converging on the disc ∣x∣<1|x|<1, of the form Pn,q,r(x)/(1−x2n)2P_{n,q,r}(x)/(1-x^{2^n})^2, where Pn,q,rP_{n,q,r} is a polynomial of degree 2n+1−12^{n+1}-1 divisible by xx, and

fn,q,r(x)=1(1−x2n)2∑j=12nqOq,r(n)(j)xj+11−x2n∑j=12n(Tq,r(n)(j)−qOq,r(n)(j))xjf_{n,q,r}(x)=\frac{1}{(1-x^{2^n})^2}\sum_{j=1}^{2^n}q^{O_{q,r}^{(n)}(j)}x^j +\frac{1}{1-x^{2^n}}\sum_{j=1}^{2^n} \Bigl(T_{q,r}^{(n)}(j)-q^{O_{q,r}^{(n)}(j)}\Bigr)x^j

(display (1)). The paper lists fn,3,1f_{n,3,1} for n=0,1,2,3n=0,1,2,3 on p. 4 and notes there that the poles of fn,q,rf_{n,q,r} are exactly the 2n2^n-th roots of unity.

Read depth. Claims checked: both theorems were read clause by clause on the page images. The proofs were read for structure only, and nothing here is independently reviewed.

Proof pointer

Theorem 2.1 is an induction on nn (p. 3). For Theorem 2.2, split the summation index kk into residue classes j∈{1,…,2n}j\in\{1,\dots,2^n\} modulo 2n2^n, apply Theorem 2.1 to each class, and sum the resulting arithmetico-geometric series (pp. 3--4).

Dependencies

Theorem 2.1 (p. 3).

Bears on

Problem 1135: with (q,r)=(3,1)(q,r)=(3,1) the map T3,1T_{3,1} is the problem's map ff, and the theorem describes the generating function of its nn-th iterates. It says nothing about whether orbits reach 11.