Efficient \(q\)-integer linear decomposition of multivariate polynomials

DOI10.1016/j.jsc.2021.02.001zbMath1486.11160arXiv2002.00124OpenAlexW3132108882MaRDI QIDQ2029008

Hui Huang, George Labahn, Eugene Zima, Mark W. Giesbrecht

Publication date: 3 June 2021

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2002.00124

zbMATH Keywords

Newton polytope\(q\)-analoguepolynomial decompositioncreative telescopinginteger-linear polynomialsOre-Sato theory

Mathematics Subject Classification ID

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

Uses Software

• Maple
• qZeil

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithmic proof theory for hypergeometric (ordinary and ``\(q\)) multisum/integral identities
• Bounds for resultants of univariate and bivariate polynomials
• On multiplication and factorization of polynomials. I: Lexicographic orderings and extreme aggregates of terms
• On computation of the greatest common divisor of several polynomials over a finite field.
• The Ore-Sato theorem and shift exponents in the \(q\)-difference case
• Proof of the Wilf-Zeilberger conjecture for mixed hypergeometric terms
• A criterion for the applicability of Zeilberger's algorithm to rational functions
• On the structure of multivariate hypergeometric terms.
• Applicability of the \(q\)-analogue of Zeilberger's algorithm
• Modern Computer Algebra
• Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
• Lectures on Polytopes
• Factoring multivariate polynomials via partial differential equations
• Efficient Integer-Linear Decomposition of Multivariate Polynomials
• On the \(q\)-analogue of Zeilberger's algorithm to rational functions