Efficient integer-linear decomposition of multivariate polynomials

DOI10.1145/3326229.3326261MaRDI QIDQ5120489zbMATH OpenOpenAlexWikidataFDO

Authors Hui Huang, Mark Giesbrecht, G. Labahn, Eugene Zima

Publication date 10 September 2020

Published in Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3326229.3326261

zbMATH Keywords

creative telescopinginteger-linear polynomialsOre-Sato theorypolynomial decomposition

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10) Symbolic computation and algebraic computation (68W30)

Recommendations

• Efficient q-integer linear decomposition of multivariate polynomials
• Efficient rational creative telescoping
• scientific article; zbMATH DE number 2125607
• Decomposition of differential polynomials with constant coefficients
• Decomposition of ordinary difference polynomials

Cited in

(5)

• Efficient q-integer linear decomposition of multivariate polynomials
• Constructing minimal telescopers for rational functions in three discrete variables
• How to generate all possible rational Wilf-Zeilberger forms?
• A unified reduction for hypergeometric and q-hypergeometric creative telescoping
• Efficient rational creative telescoping

Describes a project that uses

Uses Software

• Maple

This page was built for publication: Efficient integer-linear decomposition of multivariate polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5120489)