Related papers: Computer Algebra Algorithms for Special Functions …
We express the asymptotics of the remainders of the partial sums {s_n} of the generalized hypergeometric function q+1_F_q through an inverse power series z^n n^l \sum_k c_k/n^k, where the exponent l and the asymptotic coefficients {c_k} may…
We further develop a new framework, called PDE Acceleration, by applying it to calculus of variations problems defined for general functions on $\mathbb{R}^n$, obtaining efficient numerical algorithms to solve the resulting class of…
This is a brief review of our recent work attempted at a generalization of the Grassmann algebra to the paragrassmann ones. The main aim is constructing an algebraic basis for representing `fractional' symmetries appearing in $2D$…
We consider the quantum analog of the generalized Zernike systems given by the Hamiltonian: $$\hat{\mathcal{H}}_N =\hat{p}_1^2+\hat{p}_2^2+\sum_{k=1}^N \gamma_k (\hat{q}_1 \hat{p}_1+\hat{q}_2 \hat{p}_2)^k ,$$ with canonical operators…
We present algorithms to work with iterated Eisenstein integrals that have recently appeared in the computation of multi-loop Feynman integrals. These algorithms allow one to analytically continue these integrals to all regions of the…
The decompositions of an element of a finite von Neumann algebra into the sum of a normal operator plus an s.o.t.-quasinilpotent operator, obtained using the Haagerup--Schultz hyperinvariant projections, behave well with respect to…
We show how the continuous Almkvist-Zeilberger algorithm can be used to efficiently discover and prove differential equations satisfied by generating functions of sequences defined as integrals of powers of C-finite polynomial sequences…
Let $\Gamma$ be a connected bridgeless metric graph, and fix a point $v$ of $\Gamma$. We define combinatorial iterated integrals on $\Gamma$ along closed paths at $v$, a unipotent generalization of the usual cycle pairing and the…
We study the parameterized complexity of algorithmic problems whose input is an integer set $A$ in terms of the doubling constant $C := |A + A|/|A|$, a fundamental measure of additive structure. We present evidence that this new…
This article describes the REDUCE package ZEILBERG implemented by Gregor St\"olting and the author. The REDUCE package ZEILBERG is a careful implementation of the Gosper and Zeilberger algorithms for indefinite, and definite summation of…
The hypercomputers compute functions or numbers, or more generally solve problems or carry out tasks, that cannot be computed or solved by a Turing machine. Several numerical simulations of a possible hypercomputational algorithm based on…
We derive the algebraic relations of alternating and non-alternating finite harmonic sums up to the sums of depth~6. All relations for the sums up to weight~6 are given in explicit form. These relations depend on the structure of the index…
A universal algorithm to construct N-particle (classical and quantum) completely integrable Hamiltonian systems from representations of coalgebras with Casimir element is presented. In particular, this construction shows that quantum…
Historically, the polylogarithm has attracted specialists and non-specialists alike with its lovely evaluations. Much the same can be said for Euler sums (or multiple harmonic sums), which, within the past decade, have arisen in…
By applying the recurrence approach and coupling constant metamorphosis, we construct higher order integrals of motion for the Stackel equivalents of the $N$-dimensional superintegrable Kepler-Coulomb model with non-central terms and the…
With the help of computer algebra we study the diagonal matrix elements <Or^p>, where O are the standard Dirac matrix operators and the angular brackets denote the quantum-mechanical average for the relativistic Coulomb problem. Using…
It was observed that hyperlogarithms provide a tool to carry out Feynman integrals. So far, this method has been applied successfully to finite single-scale processes. However, it can be employed in more general situations. We give examples…
We show how the basic operations of quantum computing can be expressed and manipulated in a clear and concise fashion using a multiparticle version of geometric (aka Clifford) algebra. This algebra encompasses the product operator formalism…
We initiate the study of cluster algebras in Feynman integrals in dimensional regularization. We provide evidence that four-point Feynman integrals with one off-shell leg are described by a $C_{2}$ cluster algebra, and we find cluster…
Symbolic integration deals with the evaluation of integrals in closed form. We present an overview of Risch's algorithm including recent developments. The algorithms discussed are suited for both indefinite and definite integration. They…