Researchain
Decentralized Journals
A
Archives
Welcome to Researchain!
Feedback Center
Decentralized Journals
A
Archives
Updated
Computer Science
Symbolic Computation
Factorization of C-finite Sequences
Manuel Kauers
,
Doron Zeilberger
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.
Full PDF
Related Researches
On exact division and divisibility testing for sparse polynomials
by
Pascal Giorgi
Polynomial Linear System Solving with Random Errors: new bounds and early termination technique
by
Guerrini Eleonora
Fast real and complex root-finding methods for well-conditioned polynomials
by
Guillaume Moroz
Symbolic computation of hypergeometric type and non-holonomic power series
by
Bertrand Teguia Tabuguia
Separability Problems in Creative Telescoping
by
Shaoshi Chen
Algorithms for Linearly Recurrent Sequences of Truncated Polynomials
by
Seung Gyu Hyun
Solving linear difference equations with coefficients in rings with idempotent representations
by
Jakob Ablinger
On Two Signature Variants Of Buchberger's Algorithm Over Principal Ideal Domains
by
Maria Francis
Root Radii and Subdivision for Polynomial Root-Finding
by
Rémi Imbach
An algorithm to determine regular singular Mahler systems
by
Colin Faverjon
Computing Limits of Quotients of Multivariate Real Analytic Functions
by
Adam Strzebonski
Term Algebras, Canonical Representations and Difference Ring Theory for Symbolic Summation
by
Carsten Schneider
Lazy Hermite Reduction and Creative Telescoping for Algebraic Functions
by
Shaoshi Chen
On FGLM Algorithms with Tate Algebras
by
Xavier Caruso
Choosing the Variable Ordering for Cylindrical Algebraic Decomposition via Exploiting Chordal Structure
by
Haokun Li
Polynomial modular product verification and its implications
by
Pascal Giorgi
PTOPO: Computing the Geometry and the Topology of Parametric Curves
by
Christina Katsamaki
Some fast algorithms multiplying a matrix by its adjoint
by
Jean-Guillaume Dumas
Certified evaluations of Hölder continuous functions at roots of polynomials
by
Parker B. Edwards
Extensions of the AZ-algorithm and the Package MultiIntegrate
by
Jakob Ablinger
MultivariateApart: Generalized Partial Fractions
by
Matthias Heller
Border Basis Computation with Gradient-Weighted Norm
by
Hiroshi Kera
Telescopers for differential forms with one parameter
by
Shaoshi Chen
Monomial-agnostic computation of vanishing ideals
by
Hiroshi Kera
On FGLM Algorithms with Tropical Gröbner bases
by
Yuki Ishihara
«
1
2
3
4
»
Submitted on 12 Jan 2016
Updated
arXiv.org
Original Source
NASA ADS
Google Scholar
Semantic Scholar