The C-finite ansatz
From MaRDI portal
Publication:2376847
Abstract: While it is trivial to multiply two C-finite sequences (just like integers), it is not quite so trivial to "factorize" them, or to decide whether they are "prime". The former is plain linear algebra, while the latter is heavy-duty non-linear algebra, getting hairy systems of algebraic equations that can be solved, in principle, using Gr"obner bases and the Buchberger algorithm, but, alas, sooner or later it becomes too hard even for the fastest and largest computers. The main technical novely of this article is a fast "algorithm" (it cheats and uses floating-point arithmetic, please don't tell anyone!) for deciding whether a given C-finite sequence can be written as a product of C-finite sequences of lower order. This article accompanies the Maple package Cfinite available from http://www.math.rutgers.edu/~zeilberg/tokhniot/Cfinite .
Recommendations
- Computing the algebraic relations of \(C\)-finite sequences and multisequences
- scientific article; zbMATH DE number 7676358
- Propriétés algébriques de suites différentiellement finies
- Constant term evaluation for summation of C-finite sequences
- An extension of holonomic sequences: C^2-finite sequences
Cites work
- A combinatorial proof of a Chebyshev polynomial identity
- A holonomic systems approach to special functions identities
- A Proof in the Spirit of Zeilberger of an Amazing Identity of Ramanujan
- Closed form summation of 𝐶-finite sequences
- Computing the algebraic relations of \(C\)-finite sequences and multisequences
- Constant term evaluation for summation of C-finite sequences
- Crystal Statistics. I. A Two-Dimensional Model with an Order-Disorder Transition
- Differentiably finite power series
- Dimer problem in statistical mechanics-an exact result
- scientific article; zbMATH DE number 3983158 (Why is no real title available?)
- scientific article; zbMATH DE number 1919515 (Why is no real title available?)
- scientific article; zbMATH DE number 5252403 (Why is no real title available?)
- SumCracker: A package for manipulating symbolic sums and related objects
- The concrete tetrahedron. Symbolic sums, recurrence equations, generating functions, asymptotic estimates
- The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
Cited in
(17)- Game of pure chance with restricted boundary
- A multi-computational exploration of some games of pure chance
- The Chamber Ansatz for quantum unipotent cells
- On multiple and infinite log-concavity
- Lonely points in simplices
- Untying the Gordian Knot via Experimental Mathematics
- Summations of linear recurrent sequences
- Constant term evaluation for summation of C-finite sequences
- Invariance properties of matrix powers
- Products of multiple-index Fibonacci numbers
- scientific article; zbMATH DE number 7676358 (Why is no real title available?)
- Some D-finite and some possibly D-finite sequences in the OEIS
- A unified approach to derive explicit solutions of generalized second-order linear recurrences and applications
- Lots and lots of Perrin-type primality tests and their pseudo-primes
- Ansatz in a nutshell: a comprehensive step-by-step guide to polynomial, C-finite, holonomic, and \(\mathrm{C}^2\)-finite sequences
- Explicit expressions for the moments of the size of an \((s,\, s+1)\)-core partition with distinct parts
- Shift equivalence of P-finite sequences
This page was built for publication: The \(C\)-finite ansatz
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2376847)
