Related papers: Algorithms and differential relations for Belyi fu…
In this article we consider rational functions on algebraic curves, which have one zero and one pole (and call pair of such function and curve Abel pair). We investigate moduli spaces of such functions on curves of genus one; the number of…
Multiple elliptic polylogarithms can be written as (multiple) integrals of products of basic hypergeometric functions. The latter are computable, to arbitrary precision, using a q-difference equation and q-contiguous relations.
Partial ordinary Bell polynomials are used to formulate and prove a version of the Fa\`{a} di Bruno's formula which is convenient for handling nonlinear terms in the differential transformation. Applicability of the result is shown in two…
We use a numerical method to compute a database of three-point branched covers of the complex projective line of small degree. We report on some interesting features of this data set, including issues of descent.
Exceptional Belyi covering is a connected Belyi covering uniquely determined by its ramification scheme or the respective dessin d'enfant. We focus on rational exceptional Belyi coverings of compact Riemann surfaces of genus 0. Well known…
In this short note we introduce the Belyi degree of a number field K, which is the smallest degree of a dessin d'enfant having K as field of moduli. After the description of some general properties (for example, the fact that there exist…
We associate to each Boolean function a polynomial whose evaluations represents the distances from all possible Boolean affine functions. Both determining the coefficients of this polynomial from the truth table of the Boolean function and…
From the literature it is known that orthogonal polynomials as the Jacobi polynomials can be expressed by hypergeometric series. In this paper, the authors derive several contiguous relations for terminating multivariate hypergeometric…
The relationship between quantum physics and discrete mathematics is reviewed in this article. The Boolean functions unitary representation is considered. The relationship between Zhegalkin polynomial, which defines the algebraic normal…
The paper develops a method for discrete computational Fourier analysis of functions defined on quasicrystals and other almost periodic sets. A key point is to build the analysis around the emerging theory of quasicrystals and diffraction…
In a previous work, we developed an algorithm for the computation of incomplete Bessel functions, which pose as a numerical challenge, based on the $G_{n}^{(1)}$ transformation and Slevinsky-Safouhi formula for differentiation. In the…
Algorithms for the computation of the real zeros of hypergeometric functions which are solutions of second order ODEs are described. The algorithms are based on global fixed point iterations which apply to families of functions satisfying…
Functional integrals are central to modern theories ranging from quantum mechanics and statistical thermodynamics to biology, chemistry, and finance. In this work we present a new method for calculating functional integrals based on a…
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…
In this paper we describe a singly exponential algorithm for computing the first Betti number of a given semi-algebraic set. Singly exponential algorithms for computing the zero-th Betti number, and the Euler-Poincar\'e characteristic, were…
The generalization, similarly to exponential multivariate bases in the Fourier transform, of the Bessel functions to many dimensions is offered. Analogously to the Fourier transform property under the differentiation, the similar Hankel…
We present two approaches that can be used to compute modular forms on noncongruence subgroups. The first approach uses Hejhal's method for which we improve the arbitrary precision solving techniques so that the algorithm becomes about up…
Developing an algorithm for computing the Betti numbers of semi-algebraic sets with singly exponential complexity has been a holy grail in algorithmic semi-algebraic geometry and only partial results are known. In this paper we consider the…
The Weyl closure is a basic operation in algebraic analysis: it converts a system of differential operators with rational coefficients into an equivalent system with polynomial coefficients. In addition to encoding finer information on the…
As is well-known, poly-Bernoulli polynomials are defined in terms of polylogarithm functions. Recently, as degenerate version of such functions and polynomials, degenerate polylogarithm functions were introduced and degenertae…