The minimal-polynomial degree conjecture for recursive sequences modulo prime powers
The minimal-polynomial degree conjecture for recursive sequences modulo prime powers
Let be prime and let , with , be a modulus. A minimal polynomial is a polynomial of least degree giving the relevant recursive-sequence relation modulo . Minimal-polynomial degree conjecture. The degree of a minimal polynomial for the modulus is the least such that
This conjecture is proposed from the minimal-polynomial calculations for the moduli . The source gives no resolution or further evidence for its status.
Sources & referencesView supporting material
Primary source
Christian Krattenthaler and Thomas W. Müller, “A method for determining the mod-p^k behaviour of recursive sequences”, arXiv:1508.02580 (2025).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.