New bounds and an efficient algorithm for sparse difference resultants

DOI10.1016/j.jsc.2021.04.002zbMath1472.12005arXiv1810.00057OpenAlexW2893627960MaRDI QIDQ2029018

Chun-Ming Yuan, Zhi Yong Zhang

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/1810.00057

zbMATH Keywords

complexitysparse resultantLaurent transformally essential systemsparse difference resultant

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Difference algebra (12H10) Solving polynomial systems; resultants (13P15) Numerical methods for difference and functional equations, recurrence relations (65Q99)

Uses Software

• NesSomos
• SparseResultants

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Differential elimination with Dixon resultants
• Effective difference elimination and nullstellensatz
• Linear complete differential resultants and the implicitization of linear DPPEs
• A characteristic set method for ordinary difference polynomial systems
• On the Newton polytope of the resultant
• Efficient incremental algorithms for the sparse resultant and the mixed volume
• Sparse differential resultant for Laurent differential polynomials
• On von Neumann regular rings with an automorphism
• Macaulay style formulas for sparse resultants
• Fast computation of GCDs
• Discrete May–Leonard Competition Models I
• How to generate as many Somos-like miracles as you wish^†
• The Importance of Being Zero
• Coexistence of competing juvenile–adult structured populations
• A subdivision-based algorithm for the sparse resultant
• Multihomogeneous resultant formulae for systems with scaled support
• Sparse difference resultant

This page was built for publication: New bounds and an efficient algorithm for sparse difference resultants