Factorization of C-finite Sequences
Manuel Kauers, Doron Zeilberger
TL;DR
This paper investigates the problem of determining whether a given C-finite sequence can be expressed as a nontrivial product of two other C-finite sequences, providing insights into sequence factorization.
Contribution
It introduces criteria and methods for factorizing C-finite sequences into products of simpler C-finite sequences, a problem not previously well-understood.
Findings
Established conditions for sequence factorization
Developed algorithms for testing factorization
Enhanced understanding of C-finite sequence structure
Abstract
We discuss how to decide whether a given C-finite sequence can be written nontrivially as a product of two other C-finite sequences.
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
TopicsAdvanced Combinatorial Mathematics · semigroups and automata theory · Finite Group Theory Research