English
Related papers

Related papers: Inverse Mellin Transform of Holonomic Sequences

200 papers

In this paper, we present a novel method to compute an explicit formula for the inverse of the confluent Vandermonde matrices. Our proposed results may have many interesting perspectives in diverse areas of mathematics and natural sciences,…

Rings and Algebras · Mathematics 2020-10-09 M. Moucouf , S. Zriaa

We study the holomorphic projection of mixed mock modular forms involving sesquiharmonic Maass forms. As a special case, we numerically express the holomorphic projection of a function involving real quadratic class numbers multiplied by a…

Number Theory · Mathematics 2024-11-12 Michael Allen , Olivia Beckwith , Vaishavi Sharma

The main aim of this paper is to derive some new summation theorems for terminating and truncated Clausen's hypergeometric series with unit argument, when one numerator parameter and one denominator parameter are negative integers. Further,…

Classical Analysis and ODEs · Mathematics 2019-06-20 M. I. Qureshi , Saima Jabee , Dilshad Ahamad

Extending Eulerian polynomials and Faulhaber's formula 1, we study several combi-natorial aspects of harmonic sums and polylogarithms at non-positive multi-indices as well as their structure. Our techniques are based on the combinatorics of…

Combinatorics · Mathematics 2016-11-30 Gérard Duchamp , Hoang Ngoc , Ngo Quoc

Using the theory of representations of the symmetric group, we propose an algorithm to compute the invariant ring of a permutation group. Our approach have the goal to reduce the amount of linear algebra computations and exploit a thinner…

Combinatorics · Mathematics 2015-11-04 Nicolas Borie

The proof of the theorem concerning to the inverse cyclotomic Discrete Fourier Transform algorithm over finite field is provided.

Information Theory · Computer Science 2019-12-24 Sergei V. Fedorenko

The paper proposes a new Monte-Carlo simulator combining the advantages of Sequential Monte Carlo simulators and Hamiltonian Monte Carlo simulators. The result is a method that is robust to multimodality and complex shapes to use for…

Computation · Statistics 2018-12-20 Remi Daviet

The aim of this paper consists of providing summation formulas for the $k$-Fibonacci numbers ($k \in \mathbb{Z}$, $k \geq 2$) and their asymptotic equivalents in terms of generalized binomial coefficients. Our main tools are the Lagrange…

Number Theory · Mathematics 2023-07-28 Bakir Farhi

Bernstein polynomials, long a staple of approximation theory and computational geometry, have also increasingly become of interest in finite element methods. Many fundamental problems in interpolation and approximation give rise to…

Numerical Analysis · Mathematics 2019-07-15 Larray Allen , Robert C. Kirby

Mellin transform of fibre integral is calculated for certain classes of non-degenerate affine complete intersections. The lattice structure of the poles of the Mellin transform is clarified by means of the mixed Hodge structure of the…

Algebraic Geometry · Mathematics 2007-05-23 Susumu Tanabé

We study an inverse problem for a coupled system of semilinear Helmholtz equations where we are interested in reconstructing multiple coefficients in the system from internal data measured in applications such as thermoacoustic imaging. We…

Analysis of PDEs · Mathematics 2023-07-06 Kui Ren , Nathan Soedjak

We study the compositional inverses of some general classes of permutation polynomials over finite fields. We show that we can write these inverses in terms of the inverses of two other polynomials bijecting subspaces of the finite field,…

Number Theory · Mathematics 2013-11-01 Aleksandr Tuxanidy , Qiang Wang

We present a new program package for calculating one-loop Feynman integrals, based on a new method avoiding Feynman parametrization and the contraction due to Passarino and Veltman. The package is calculating one-, two- and three-point…

High Energy Physics - Phenomenology · Physics 2007-05-23 Lars Brucher , Johannes Franzkowski

In this paper, we explore different techniques to synthesize modular invariants for synchronous code encoded as Horn clauses. Modular invariants are a set of formulas that characterizes the validity of predicates. They are very useful for…

Logic in Computer Science · Computer Science 2014-12-04 Pierre-Loic Garoche , Arie Gurfinkel , Temesghen Kahsai

This paper proposes an efficient symbolic-numeric method to compute the integrals in the successive Galerkin approximation (SGA) of the Hamilton-Jacobi-Bellman (HJB) equation. A solution of the HJB equation is first approximated with a…

Systems and Control · Electrical Eng. & Systems 2023-03-20 Tomoyuki Iori

We introduce a new set of algorithms to compute Jacobi matrices associated with measures generated by infinite systems of iterated functions. We demonstrate their relevance in the study of theoretical problems, such as the continuity of…

Numerical Analysis · Mathematics 2013-11-20 Giorgio Mantica

We propose the fast semi-analytical method of modelling the polarization curves in the voltammetric experiment. The method is based on usage of the special func- tions and shows a big calculation speed and a high accuracy and stability. Low…

Computational Physics · Physics 2016-08-12 N. A. Koshev , A. N. Koshev , V. V. Kuzina

By dividing hypergeometric series representations of the inverse sine by sin^-1 (x) and integrating, new double series representations of integers and constants arise. Binomial coefficients and the sine integral are thus combined in double…

Number Theory · Mathematics 2010-09-17 John M. Campbell

We give an explicit formula for the Hankel transform of a regular sequence in terms of the coefficients of the associated orthogonal polynomials and the sequence itself. We apply this formula to some sequences of combinatorial interest,…

Combinatorics · Mathematics 2011-03-31 Paul Barry

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…

Symbolic Computation · Computer Science 2026-05-06 Hadrien Brochet