Elsevier

Journal of Symbolic Computation

Volume 68, Part 1, May–June 2015, Pages 169-203
Journal of Symbolic Computation

Sparse difference resultant

https://doi.org/10.1016/j.jsc.2014.09.016Get rights and content
Under an Elsevier user license
open archive

Abstract

In this paper, the concept of sparse difference resultant for a Laurent transformally essential system of difference polynomials is introduced and a simple criterion for the existence of sparse difference resultant is given. The concept of transformally homogenous polynomial is introduced and the sparse difference resultant is proved to be transformally homogenous. It is shown that the vanishing of the sparse difference resultant gives a necessary condition for the corresponding difference polynomial system to have non-zero solutions. Order and degree bounds for the sparse difference resultant are given. Based on these bounds, an algorithm to compute the sparse difference resultant is proposed, which is single exponential in terms of the number of variables, the Jacobi number, and the size of the Laurent transformally essential system. Furthermore, the precise order and degree, a determinant representation, and a Poisson-type product formula for the difference resultant are given.

Keywords

Sparse difference resultant
Difference resultant
Laurent transformally essential system
Jacobi number
Transformally homogeneous polynomial
Incompleteness of projective difference space
Single exponential algorithm

Cited by (0)

Partially supported by a National Key Basic Research Project of China (2011CB302400) and by grants from NSFC (60821002, 11101411).