Related papers: A Generalized Apagodu-Zeilberger Algorithm
We begin by defining general hypergeometric functions over finite fields and obtaining a finite field analogue of a classical symmetry in their complex counterparts. We give a geometric proof for the symmetry by constructing isomorphisms…
Recently, we have established and used the generalized Littlewood theorem concerning contour integrals of the logarithm of analytical function to obtain a few new criteria equivalent to the Riemann hypothesis. Here, the same theorem is…
This article summarises the theory of several bounded functional calculi for unbounded operators that have recently been discovered. The extend the Hille--Phillips calculus for (negative) generators $A$ of certain bounded $C_0$-semigroups,…
Using a different approach, we derive integral representations for the Riemann zeta function and its generalizations (the Hurwitz zeta, $\zeta(-k,b)$, the polylogarithm, $\mathrm{Li}_{-k}(e^m)$, and the Lerch transcendent,…
Frugal resolvent splittings are a class of fixed point algorithms for finding a zero in the sum of the sum of finitely many set-valued monotone operators, where the fixed point operator uses only vector addition, scalar multiplication and…
We show that every finite semilattice can be represented as an atomized semilattice, an algebraic structure with additional elements (atoms) that extend the semilattice's partial order. Each atom maps to one subdirectly irreducible…
A fast algorithm (linear in the degrees of freedom) for the solution of linear variable-coefficient rational-order fractional integral and differential equations is described. The approach is related to the ultraspherical method for…
We consider a class of sums over products of Z-sums whose arguments differ by a symbolic integer. Such sums appear, for instance, in the expansion of Gauss hypergeometric functions around integer indices that depend on a symbolic parameter.…
In this paper certain classes of infinite sums involving special functions are evaluated analytically by application of basic quantum mechanical principles to simple models of half harmonic oscillator and a particle trapped inside an…
We develop a theory of vector spaces spanned by orbit-finite sets. Using this theory, we give a decision procedure for equivalence of weighted register automata, which are the common generalization of weighted automata and register automata…
Finite geometry is employed to underpin operators in finite, d, dimensional Hilbert space. The central role of mutual unbiased bases (MUB) states projectors is exhibited. Interrelation among operators in Hilbert space, revealed through…
The theoretical computing of special values assumed by the hypergeometric functions has a high interest not only on its own, but also in sight of the remarkable implications to both pure Mathematics and Mathematical Physics. Accordingly, in…
Surprisingly, apart from some special cases, simple asymptotic expansions for the associated Legendre functions $P_\nu ^\mu (z)$ and $Q_\nu ^\mu (z)$ for large degree $\nu$ or large order $\mu$ are not available in the literature. The main…
The Grover algorithm is one of the most famous quantum algorithms. On the other hand, the absolute zeta function can be regarded as a zeta function over $\mathbb{F}_{1}$ defined by a function satisfying the absolute automorphy. In this…
We present some general theorems about operator algebras that are algebras of functions on sets, including theories of local algebras, residually finite dimensional operator algebras and algebras that can be represented as the scalar…
We introduce a class of multidimensional Schr\"odinger operators with elliptic potential which generalize the classical Lam\'e operator to higher dimensions. One natural example is the Calogero--Moser operator, others are related to the…
In this short note we use ideas from systems theory to define a functional calculus for infinitesimal generators of strongly continuous semigroups on a Hilbert space. Among others, we show how this leads to new proofs of (known) results in…
Minimal annihilating polynomials are very useful in a wide variety of algorithms in exact linear algebra. A new efficient method is proposed for calculating the minimal annihilating polynomials for all the unit vectors, for a square matrix…
We overview numerous algorithms in computational $D$-module theory together with the theoretical background as well as the implementation in the computer algebra system \textsc{Singular}. We discuss new approaches to the computation of…
This paper considers finite-automata based algorithms for handling linear arithmetic with both real and integer variables. Previous work has shown that this theory can be dealt with by using finite automata on infinite words, but this…