Related papers: IBIS: Inverse BInomial sum Solver
This paper presents a program analysis method that generates program summaries involving polynomial arithmetic. Our approach builds on prior techniques that use solvable polynomial maps for summarizing loops. These techniques are able to…
The present article is focused on the study of a special class of systems of nonlinear transcendental equations for which classical algebraic and symbolic methods are inapplicable. For the purpose of the study of such systems, we develop a…
We propose the application of iterative regularization for the development of ensemble methods for solving Bayesian inverse problems. In concrete, we construct (i) a variational iterative regularizing ensemble Levenberg-Marquardt method…
In groundwater contaminant remediation and risk assessment, it is important to identify parameters of the contaminant source and hydraulic conductivity field by solving an inverse problem. However, if the dimensionality of the inverse…
In this paper, we continue our investigation of double sums where the inner sum is binomial but incomplete. We prove many new results for these types of double sums associated with binomial transform pairs. As applications we deduce new…
The fractional Fourier series generalizes the classical Fourier series by introducing a rotation angle $\alpha$ in the time-frequency plane, but inherits the Gibbs phenomenon for piecewise smooth functions. Unlike the classical setting, the…
We address the problem of unambiguous reconstruction of rational functions of many variables. This is particularly relevant for recovery of exact expansion coefficients in integration-by-parts identites (IBPs) based on modular arithmetic.…
It is well-known that any sum of squares (SOS) program can be cast as a semidefinite program (SDP) of a particular structure and that therein lies the computational bottleneck for SOS programs, as the SDPs generated by this procedure are…
Any explicit functional representation $f$ of a density is hampered by two main obstacles when we wish to use it as a generative model: designing $f$ so that sampling is fast, and estimating $Z = \int f$ so that $Z^{-1}f$ integrates to 1.…
We present a calculation of the masses of the isovector mesons ( vector, scalar and pseudoscalar including the established recurrences) using a new method of finite energy QCD sum rules. The method is based on the idea of choosing a…
We give an extension of Sister Celine's method of proving hypergeometric sum identities that allows it to handle a larger variety of input summands. We then apply this to several problems. Some give new results, and some reprove already…
The interval subset sum problem (ISSP) is a generalization of the well-known subset sum problem. Given a set of intervals $\left\{[a_{i,1},a_{i,2}]\right\}_{i=1}^n$ and a target integer $T,$ the ISSP is to find a set of integers, at most…
-Residue Number System (RNS) is a valuable tool for fast and parallel arithmetic. It has a wide application in digital signal processing, fault tolerant systems, etc. In this work, we introduce the 3-moduli set {2^n, 2^{2n}-1, 2^{2n}+1} and…
We use Cramer's formula for the inverse of a matrix and a combinatorial expression for the determinant in terms of paths of an associated digraph (which can be traced back to Coates) to give a combinatorial interpretation of M\"obius…
Mellin-Barnes (MB) techniques applied to integrals emerging in particle physics perturbative calculations are summarized. New versions of AMBRE packages which construct planar and nonplanar MB representations are shortly discussed. The…
For any complex parameters $x$ and $\nu$, we provide a new class of linear inversion formulas $T = A(x,\nu) \cdot S \Leftrightarrow S = B(x,\nu) \cdot T$ between sequences $S = (S_n)_{n \in \mathbb{N}^*}$ and $T = (T_n)_{n \in…
We present a method for rewriting dimensionally regulated Feynman parameter integrals in the Minkowski regime as a sum of real, positive integrands multiplied by complex prefactors. This representation eliminates the need for contour…
We develop a systematic and fully explicit approach to the evaluation of binomial sums involving reciprocals of binomial coefficients based on Beta integral techniques. Starting from a simple integral representation, we provide a derivation…
I consider the expansion of transcendental functions in a small parameter around rational numbers. This includes in particular the expansion around half-integer values. I present algorithms which are suitable for an implementation within a…
We solve exactly the scalar box integral using the Mellin-Barnes representation. Firstly we recognize the hypergeometric functions resumming the series coming from the scalar integrals, then we perform an analytic continuation before…