Add to ORKGIn this paper, we give an algorithmic solution to a dynamical analog of the problem of certifying combinatorial identities by Wilf-Zeilberger pairs. Given two sequences generated in a dynamical setting, we calculate an upper bound N ≥ 1 such that whenever the first N terms of the two sequences agree pairwise, the two sequences agree term-by-term. Then, we give an algorithm that can be used to check whether two such sequences agree term-by-term. Our methods are mainly based on the theory of Chow rings of algebraic varieties
A sequence of binomial type is a basis for [x] satisfying a binomial-like identity, e.g. powers, ris...
This thesis is codirected between Ecole Polytechnique and Chinese Academy of SciencesSince the 1990'...
Two methods are presented for determining advanced combinatorial identities. The first is based on e...
This paper focuses on two binomial identities. The proofs illustrate the power and elegance in enume...
The Dynamical Mordell--Lang Conjecture states that if a polynomial orbit has infinite intersection w...
The purpose of the thesis is to get a better understanding of computer algebra in general, and polyn...
This paper presents a general method for proving and discovering combinatorial identities: to prove ...
In the old days, when one had to find some sequence, a(n), there were two extremes. In the lucky cas...
In this thesis we investigate the algebraic properties of matchings via representation theory. We id...
This thesis shows how computer algebra makes it possible to manipulate a large class of sequences an...
International audienceWe present a theorem-proving experiment performed with a computer algebra syst...
AbstractA terminating condition of the well-known Zeilberger's algorithm for a given hypergeometric ...
AbstractIn this paper, we present a direct algorithm to construct the minimal Z-pairs for rational f...
AbstractZeilberger's algorithm which finds holonomic recurrence equations for definite sums of hyper...
AbstractWe consider the applicability (or terminating condition) of the well-known Zeilberger's algo...
A sequence of binomial type is a basis for [x] satisfying a binomial-like identity, e.g. powers, ris...
This thesis is codirected between Ecole Polytechnique and Chinese Academy of SciencesSince the 1990'...
Two methods are presented for determining advanced combinatorial identities. The first is based on e...
This paper focuses on two binomial identities. The proofs illustrate the power and elegance in enume...
The Dynamical Mordell--Lang Conjecture states that if a polynomial orbit has infinite intersection w...
The purpose of the thesis is to get a better understanding of computer algebra in general, and polyn...
This paper presents a general method for proving and discovering combinatorial identities: to prove ...
In the old days, when one had to find some sequence, a(n), there were two extremes. In the lucky cas...
In this thesis we investigate the algebraic properties of matchings via representation theory. We id...
This thesis shows how computer algebra makes it possible to manipulate a large class of sequences an...
International audienceWe present a theorem-proving experiment performed with a computer algebra syst...
AbstractA terminating condition of the well-known Zeilberger's algorithm for a given hypergeometric ...
AbstractIn this paper, we present a direct algorithm to construct the minimal Z-pairs for rational f...
AbstractZeilberger's algorithm which finds holonomic recurrence equations for definite sums of hyper...
AbstractWe consider the applicability (or terminating condition) of the well-known Zeilberger's algo...
A sequence of binomial type is a basis for [x] satisfying a binomial-like identity, e.g. powers, ris...
This thesis is codirected between Ecole Polytechnique and Chinese Academy of SciencesSince the 1990'...
Two methods are presented for determining advanced combinatorial identities. The first is based on e...