Related papers: Algorithms and differential relations for Belyi fu…
We introduce a family of sequence transformations, defined via partial Bell polynomials, that may be used for a systematic study of a wide variety of problems in enumerative combinatorics. This family includes some of the transformations…
We introduce a general method for constructing modules for $0$-Hecke algebras and supermodules for $0$-Hecke-Clifford algebras from diagrams of boxes in the plane, and give formulas for the images of these modules in the algebras of…
Fractional vector calculus is discussed in the spherical coordinate framework. A variation of the Legendre equation and fractional Bessel equation are solved by series expansion and numerically. Finally, we generalize the hypergeometric…
We construct new smallest parts partition functions and smallest parts crank functions by considering variations of Bailey's Lemma and conjugate Bailey pairs. The functions we introduce satisfy simple linear congruences modulo $3$ and $5$.…
The polylogarithm function is one of the constellation of important mathematical functions. It has a long history, and many connections to other special functions and series, and many applications, for instance in statistical physics.…
We design a Quasi-Polynomial time deterministic approximation algorithm for computing the integral of a multi-dimensional separable function, supported by some underlying hyper-graph structure, appropriately defined. Equivalently, our…
We present new algorithms to compute fundamental properties of a Boolean function given in truth-table form. Specifically, we give an O(N^2.322 log N) algorithm for block sensitivity, an O(N^1.585 log N) algorithm for `tree decomposition,'…
We give a number of theoretical and practical methods related to the computation of L-functions, both in the local case (counting points on varieties over finite fields, involving in particular a detailed study of Gauss and Jacobi sums),…
In this paper we present a fast and accurate numerical algorithm for the computation of hyperspherical Bessel functions of large order and real arguments. For the hyperspherical Bessel functions of closed type, no stable algorithm existed…
We present a straightforward discretization of the Bessel functions $J_n(x)$ to discrete counterparts $B^{(N)}_n(x_m)$, of $N$ integer orders $n$ on $N$ integer points $x_m \equiv m$, that we call discrete Bessel functions. These are built…
We discuss a numerical algorithm for solving nonlinear integro-differential equations, and illustrate our findings for the particular case of Volterra type equations. The algorithm combines a perturbation approach meant to render a…
The goal of this paper is to extend the classical and multiplicative fractional derivatives. For this purpose, it is introduced the new extended modified Bessel function and also given an important relation between this new function…
We describe a method for the rapid numerical evaluation of the Bessel functions of the first and second kinds of nonnegative real orders and positive arguments. Our algorithm makes use of the well-known observation that although the Bessel…
A correspondence between arbitrary Fourier series and certain analytic functions on the unit disk of the complex plane is established. The expression of the Fourier coefficients is derived from the structure of complex analysis. The…
It is possible to perform some operations with extrafunctions applying these operations separately to each coordinate. Operations performed in this manner are called regular. It is proved that it is possible to extend several operations…
In this paper we study some algebraic properties of hypergraphs, in particula their Betti numbers. We define some different types of complete hypergraphs, which to the best of our knowledge, are not previously considered in the literature.…
We describe the resurgence properties of some partition functions corresponding to field theories in dimension 0. We show that these functions satisfy linear differential equations with polynomial coefficients and then use elementary…
In many applications (hupergeometric-type) special functions like orthogonal polynomials are needed. For example in more than 50% of the published solutions for the (application-oriented) questions in the "Problems Section" of SIAM Review…
We present a general diagrammatic approach to the construction of efficient algorithms for computing a Fourier transform on a semisimple algebra. This extends previous work wherein we derive best estimates for the computation of a Fourier…
We study primary submodules and primary decompositions from a differential and computational point of view. Our main theoretical contribution is a general structure theory and a representation theorem for primary submodules of an arbitrary…