相关论文: The identification problem for transcendental func…

Ich m\"ochte in diesem Bericht algorithmische Methoden vorstellen, die im wesentlichen in diesem Jahrzehnt Einzug in die Computeralgebra gefunden haben. Die haupts\"achlichen Ideen gehen auf Stanley \cite{Sta} und Zeilberger…

We employ computer algebra algorithms to prove a collection of identities involving Bessel functions with half-integer orders and other special functions. These identities appear in the famous Handbook of Mathematical Functions, as well as…

In this article we present a method to implement orthogonal polynomials and many other special functions in Computer Algebra systems enabling the user to work with those functions appropriately, and in particular to verify different types…

I consider the expansion of transcendental functions in a small parameter around rational numbers. This includes in particular the expansion around half-integer values. I present algorithms which are suitable for an implementation within a…

Computers calculate transcendental functions by approximating them through the composition of a few limited-precision instructions. For example, an exponential can be calculated with a Taylor series. These approximation methods were…

We extend Zeilberger's approach to special function identities to cases that are not holonomic. The method of creative telescoping is thus applied to definite sums or integrals involving Stirling or Bernoulli numbers, incomplete Gamma…

We present a computer algebra approach to proving identities on Bernoulli polynomials and Euler polynomials by using the extended Zeilberger's algorithm given by Chen, Hou and Mu. The key idea is to use the contour integral definitions of…

By combining well-known techniques from both noncommutative algebra and computational commutative algebra, we observe that an algorithmic approach can be applied to the study of irreducible representations of finitely presented algebras. In…

In the last decade major steps towards an algorithmic treatment of orthogonal polynomials and special functions (OP & SF) have been made, notably Zeilberger's brilliant extension of Gosper's algorithm on algorithmic definite hypergeometric…

We use both Abel's lemma on summation by parts and Zeilberger's algorithm to find recurrence relations for definite summations. The role of Abel's lemma can be extended to the case of linear difference operators with polynomial…

In this paper, we propose to consider various models of pattern recognition. At the same time, it is proposed to consider models in the form of two operators: a recognizing operator and a decision rule. Algebraic operations are introduced…

This paper argues that automated proofs of identities for non-terminating hypergeometric series are feasible by a combination of Zeilberger's algorithm and asymptotic estimates. For two analogues of Saalsch\"utz' summation formula in the…

Arithmetic differential equations are analogues of algebraic differential equations in which derivative operators acting on functions are replaced by Fermat quotient operators acting on numbers. Now, various remarkable transcendental…

Attempts to separate the power of classical and quantum models of computation have a long history. The ultimate goal is to find exponential separations for computational problems. However, such separations do not come a dime a dozen: while…

Quantum computers can execute algorithms that sometimes dramatically outperform classical computation. Undoubtedly the best-known example of this is Shor's discovery of an efficient quantum algorithm for factoring integers, whereas the same…

E-functions are entire functions with algebraic Taylor coefficients satisfying certain arithmetic conditions, and which are also solutions of linear differential equations with rational functions coefficients. They were introduced by Siegel…

Quantum arithmetic in the computational basis constitutes the fundamental component of many circuit-based quantum algorithms. There exist a lot of studies about reversible implementations of algebraic functions, while research on the…

Higher transcendental function occur frequently in the calculation of Feynman integrals in quantum field theory. Their expansion in a small parameter is a non-trivial task. We report on a computer program which allows the systematic…

Expansion of higher transcendental functions in a small parameter are needed in many areas of science. For certain classes of functions this can be achieved by algebraic means. These algebraic tools are based on nested sums and can be…

Quantum computers can execute algorithms that dramatically outperform classical computation. As the best-known example, Shor discovered an efficient quantum algorithm for factoring integers, whereas factoring appears to be difficult for…