AbstractThe greatest factorial factorization (GFF) of a polynomial provides an analogue to square-free factorization but with respect to integer shifts instead to multiplicities. We illustrate the fundamental role of that concept in the context of symbolic summation. Besides a detailed discussion of the basic GFF notions we present a new approach to the indefinite rational summation problem as well as to Gosper's algorithm for summing hypergeometric sequences
We consider a class of sums over products of Z-sums whose arguments differ by a symbolic integer. Su...
In this paper, we examine the problem of computing the greatest common divisor (GCD) of univariate p...
We consider a class of sums over products of Z-sums whose arguments differ by a symbolic integer. Su...
AbstractThe greatest factorial factorization (GFF) of a polynomial provides an analogue to square-fr...
An algebraically motivated generalization of Gosper’s algorithm to indefinite bibasic hypergeometric...
In recent years, the problem of symbolic summation has received much attention due to the exciting a...
The celebrated Zeilberger algorithm which finds holonomic recurrence equations for definite sums of ...
The aim of this paper is to describe two new factorization algorithms for polynomials. The first fac...
AbstractA detailed study of the degree setting for Gosper's algorithm for indefinite hypergeometric ...
AbstractZeilberger's algorithm which finds holonomic recurrence equations for definite sums of hyper...
AbstractThe process of factoring a polynomial in such a way that the multiplicities of its distinct ...
Modern algorithmic techniques for summation, most of which were introduced in the 1990s, are develop...
Abstract. Let R be a UFD. Let f ∈ R[T] be of content 1. Then f can be written as f = ga11 · · · ga...
this paper a detailed analysis of this degree setting is given. It turns out that the situation for ...
AbstractWe present a hybrid symbolic-numeric algorithm for certifying a polynomial or rational funct...
We consider a class of sums over products of Z-sums whose arguments differ by a symbolic integer. Su...
In this paper, we examine the problem of computing the greatest common divisor (GCD) of univariate p...
We consider a class of sums over products of Z-sums whose arguments differ by a symbolic integer. Su...
AbstractThe greatest factorial factorization (GFF) of a polynomial provides an analogue to square-fr...
An algebraically motivated generalization of Gosper’s algorithm to indefinite bibasic hypergeometric...
In recent years, the problem of symbolic summation has received much attention due to the exciting a...
The celebrated Zeilberger algorithm which finds holonomic recurrence equations for definite sums of ...
The aim of this paper is to describe two new factorization algorithms for polynomials. The first fac...
AbstractA detailed study of the degree setting for Gosper's algorithm for indefinite hypergeometric ...
AbstractZeilberger's algorithm which finds holonomic recurrence equations for definite sums of hyper...
AbstractThe process of factoring a polynomial in such a way that the multiplicities of its distinct ...
Modern algorithmic techniques for summation, most of which were introduced in the 1990s, are develop...
Abstract. Let R be a UFD. Let f ∈ R[T] be of content 1. Then f can be written as f = ga11 · · · ga...
this paper a detailed analysis of this degree setting is given. It turns out that the situation for ...
AbstractWe present a hybrid symbolic-numeric algorithm for certifying a polynomial or rational funct...
We consider a class of sums over products of Z-sums whose arguments differ by a symbolic integer. Su...
In this paper, we examine the problem of computing the greatest common divisor (GCD) of univariate p...
We consider a class of sums over products of Z-sums whose arguments differ by a symbolic integer. Su...
DOI
Add to ORKG