期刊： JOURNAL OF SYMBOLIC COMPUTATION, 2021; 107 ()
We present two new algorithms for the computation of the q-integer linear decomposition of a multivariate polynomial. Such a decomposition is essentia......
期刊： JOURNAL OF SYMBOLIC COMPUTATION, 2021; 107 ()
The sparse difference resultant introduced in Li et al. (2015b) is a basic concept in difference elimination theory. In this paper, we show that the s......
期刊： JOURNAL OF SYMBOLIC COMPUTATION, 2021; 107 ()
We consider the higher order Turan inequality and higher order log-concavity for sequences {a(n)}(n >= 0) such that an-1a(n+1)/a(n)(2) =1+ Sigma(m)......
期刊： JOURNAL OF SYMBOLIC COMPUTATION, 2021; 107 ()
In this paper, we prove a supercongruence via the Wilf-Zeilberger method and symbolic summation algorithms in the setting of difference rings. That is......
期刊： JOURNAL OF SYMBOLIC COMPUTATION, 2021; 107 ()
As a fundamental notion, the free differential algebra on a set is concretely constructed as the polynomial algebra on the differential variables. Suc......
期刊： JOURNAL OF SYMBOLIC COMPUTATION, 2021; 102 ()
Let f = (f(1), ..., f(s)) be a sequence of polynomials in Q[X-1, ..., X-n] of maximal degree D and V subset of C-n be the algebraic set defined by f a......
期刊： JOURNAL OF SYMBOLIC COMPUTATION, 2021; 102 ()
In this paper, we first prove that when the associated graph of a polynomial set is chordal, a particular triangular set computed by a general algorit......
期刊： JOURNAL OF SYMBOLIC COMPUTATION, 2021; 102 ()
Two new efficient algorithms for computing greatest common divisors (gcds) of parametric multivariate polynomials over k[U][X] are presented. The key ......
期刊： JOURNAL OF SYMBOLIC COMPUTATION, 2021; 104 ()
Algorithms for integration of the algebraic functions implemented in modern computer algebra systems (CAS) are not always able to solve the classical ......
期刊： JOURNAL OF SYMBOLIC COMPUTATION, 2021; 104 ()
In this paper, we study unirational differential curves and the corresponding differential rational parametrizations. We first investigate basic prope......
期刊： JOURNAL OF SYMBOLIC COMPUTATION, 2021; 104 ()
We consider the problem of finding a condition for a univariate polynomial having a given multiplicity structure when the number of distinct roots is ......
期刊： JOURNAL OF SYMBOLIC COMPUTATION, 2021; 104 ()
Zeilberger's method of creative telescoping is crucial for the computer-generated proofs of combinatorial and special-function identities. Telescopers......
期刊： JOURNAL OF SYMBOLIC COMPUTATION, 2021; 104 ()
Multiplicative relations between the roots of a polynomial in Q[x] have drawn much attention in the field of arithmetic and algebra, while the problem......
期刊： JOURNAL OF SYMBOLIC COMPUTATION, 2021; 104 ()
The W-characteristic set of a polynomial ideal is the minimal triangular set contained in the reduced lexicographical Grobner basis of the ideal. A pa......
期刊： JOURNAL OF SYMBOLIC COMPUTATION, 2021; 104 ()
A distance from free to dummy indices is defined. The distance is invariant with respect to both monoterm symmetries and bottom antisymmetry. Using th......
