AbstractMany computations involving special functions, combinatorial sequences or theirq-analogues can be performed using linear operators and simple arguments on the dimension of related vector spaces. In this article, we develop a theory of ∂-finite sequences and functions which provides a unified framework to express algorithms for computing sums and integrals and for the proof or discovery of multivariate identities. This approach is vindicated by an implementation
We define antidomain operations for algebras of multiplace partial functions. For all signatures con...
International audienceThe Bogoliubov recursion is a particular procedure appearing in the process of...
AbstractIn this paper, we want to give an explicit description of identities satisfied by matrices n...
AbstractIn this article, we study the eliminations in noncommutative operator algebras and modify th...
AbstractLet k be a field of characteristic 0. Based on the Gelfand–Kirillov dimension computation of...
AbstractThis paper presents an operator calculus approach to computing with non-commutative variable...
Motivated by the fundamental lower bounds questions in proof complexity, we initiate the study of ma...
A new paradigm, called combinatorial expressions, for computing functions expressing properties over...
Abstract. The subresultant theory for univariate commutative polynomials is generalized to Ore polyn...
In this book the authors develop a theory of free noncommutative functions, in both algebraic and an...
This thesis shows how computer algebra makes it possible to manipulate a large class of sequences an...
Abstract. Consider the algebra Q〈〈x1, x2,...〉 〉 of formal power series in countably many noncommutin...
This paper focuses on two binomial identities. The proofs illustrate the power and elegance in enume...
. Some algebraic identities with independent variables are established by means of the calculus on f...
In this article we study algebraic functions in {→, 1}-subreducts of MV-algebras, also known as Łuka...
We define antidomain operations for algebras of multiplace partial functions. For all signatures con...
International audienceThe Bogoliubov recursion is a particular procedure appearing in the process of...
AbstractIn this paper, we want to give an explicit description of identities satisfied by matrices n...
AbstractIn this article, we study the eliminations in noncommutative operator algebras and modify th...
AbstractLet k be a field of characteristic 0. Based on the Gelfand–Kirillov dimension computation of...
AbstractThis paper presents an operator calculus approach to computing with non-commutative variable...
Motivated by the fundamental lower bounds questions in proof complexity, we initiate the study of ma...
A new paradigm, called combinatorial expressions, for computing functions expressing properties over...
Abstract. The subresultant theory for univariate commutative polynomials is generalized to Ore polyn...
In this book the authors develop a theory of free noncommutative functions, in both algebraic and an...
This thesis shows how computer algebra makes it possible to manipulate a large class of sequences an...
Abstract. Consider the algebra Q〈〈x1, x2,...〉 〉 of formal power series in countably many noncommutin...
This paper focuses on two binomial identities. The proofs illustrate the power and elegance in enume...
. Some algebraic identities with independent variables are established by means of the calculus on f...
In this article we study algebraic functions in {→, 1}-subreducts of MV-algebras, also known as Łuka...
We define antidomain operations for algebras of multiplace partial functions. For all signatures con...
International audienceThe Bogoliubov recursion is a particular procedure appearing in the process of...
AbstractIn this paper, we want to give an explicit description of identities satisfied by matrices n...