Generalised Binomial coefficients and Jarden's Theorem
Cheng Lien Lang, Mong Lung Lang

TL;DR
This paper presents a strengthened version of Jarden's Theorem, expanding its applicability to recurrence relations involving powers of recursive functions, thereby advancing the theoretical understanding of recursive sequences.
Contribution
It introduces a generalized form of Jarden's Theorem that applies to broader classes of recursive functions and their powers.
Findings
Proves a stronger version of Jarden's Theorem
Extends the theorem's applicability to recursive functions
Provides new insights into recurrence relations involving powers
Abstract
We prove a stronger version of Jarden's Theorem for recurrence of powers of recursive functions
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Mathematical Dynamics and Fractals · semigroups and automata theory
