The Clergyman's conjecture for linear-form anti-recurrence sequences

About 1 year old · traced to

Let cmathbfa=(a1,⋯ ,ak)cmathbf a=(a_1,\cdots,a_k) be a positive integral vector of dimension k>1k>1, and let f(cmathbfx)=cmathbfacdotcmathbfxf(cmathbf x)=cmathbf acdotcmathbf x be its linear form. Let AnA_n be the anti-recurrence sequence for ff. Let ctauctau be the trace of the linear form and set ckappa=kctau+1ckappa=kctau+1. The Clergyman's conjecture. The sequence An−ckappanA_n-ckappa n is ctauctau-automatic. The conjecture is proved in the paper under a restriction on cmathbfacmathbf a; it was previously known for cmathbfa=(1,1)cmathbf a=(1,1), (1,1,1)(1,1,1), and (1,1,1,1)(1,1,1,1), so the unrestricted statement remains open.

References

Primary source

Robbert Fokkink and Gandhar Joshi, “Anti-recurrence sequences”, arXiv:2506.13337 (2025).

Progress summary

Never refreshed

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

Solutions 0

No solutions have been posted yet.