Conjecture on recurrence divisibility for algebraic integers

From papers

Let αZˉ\alpha \in \bar{\Z}, let K=\Q(α)K=\Q(\alpha), and let dk(α)d_k(\alpha) denote the largest positive integer such that

αk1dk(α)OK.\alpha^k-1\in d_k(\alpha)\mathcal O_K.

Assume that either (a) [\Q(αr):\Q]3[\Q(\alpha^r):\Q]\geq 3 for every r1r\geq 1, or (b) [\Q(αr):\Q]2[\Q(\alpha^r):\Q]\geq 2 for every r1r\geq 1 and NK(α)±1N_K(\alpha)\ne\pm1. Conjecture 9. Under these assumptions, the set

{k1dk(α)=d1(α)}\{k\geq 1\mid d_k(\alpha)=d_1(\alpha)\}

is infinite. The conjecture predicts infinitely many indices at which the divisibility sequence attached to α\alpha returns to its initial value, outside the exceptional low-degree or quadratic-unit cases discussed in the paper.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Elisa Bellah, “Norm Form Equations and Linear Divisibility Sequences”, arXiv:2007.07392 (2021).

Solutions 0

No solutions have been posted yet.