Related papers: Exact formula for 1-lower run overpartitions
The aim of this paper is to present an explicit reduction algorithm for Hilbert modular groups over arbitrary totally real number fields. An implementation of the algorithm is available to download from [19]. The exposition is…
Our goal in this work is to found a closed form for rational generat- ing functions, these generate a various families of polynomials and generalized polynomials, in order to get the general recursive formula satisfied by these polynomials.
We estimate the sums \[ \sum_{c\leq x} \frac{S(m,n,c,\chi)}{c}, \] where the $S(m,n,c,\chi)$ are Kloosterman sums of half-integral weight on the modular group. Our estimates are uniform in $m$, $n$, and $x$ in analogy with Sarnak and…
The primary focus of this paper is overpartitions, a type of partition that plays a significant role in $q$-series theory. In 2006, Treneer discovered an explicit infinite family of congruences of overpartitions modulo $5$. In our research,…
Euler Maclaurin formulas for a polytope express the sum of the values of a function over the lattice points in the polytope in terms of integrals of the function and its derivatives over faces of the polytope or its expansions. Exact Euler…
We develop explicit formulas and algorithms for arithmetic in radical function fields K/k(x) over finite constant fields. First, we classify which places of k(x) whose local integral bases have an easy monogenic form, and give explicit…
This paper develops an algorithmic approach for obtaining approximate, numerical estimates of the sizes of subcodes of Reed-Muller (RM) codes, all of the codewords in which satisfy a given constraint. Our algorithm is based on a statistical…
In this note, we consider ordered partitions of integers such that each entry is no more than a fixed portion of the sum. We give a method for constructing all such compositions as well as both an explicit formula and a generating function…
We obtain a new estimate for Kloosterman sum with primes $p\leqslant X$ to composite modulo $q$, that is, for the exponential sum of the type \[ \sum\limits_{p\leqslant X,\;p\,\nmid q}\exp{\biggl(\frac{2\pi…
Evaluating the log-sum-exp function or the softmax function is a key step in many modern data science algorithms, notably in inference and classification. Because of the exponentials that these functions contain, the evaluation is prone to…
We propose a novel method to compute multi-loop master integrals by constructing and numerically solving a system of ordinary differential equations, with almost trivial boundary conditions. Thus it can be systematically applied to problems…
Using explicit constructions of the Weierstrass mock modular form, we offer a closed formula for generating the values of shifted convolution $L$-values for certain elliptic curves that can be computed to arbitrary precision. These…
We study a new simple quadrature rule based on integrating a $C^1$ quadratic spline quasi-interpolant on a bounded interval. We give nodes and weights for uniform and non-uniform partitions. We also give error estimates for smooth functions…
We generalize Sylvester single sums to multisets (sets with repeated elements), and show that these sums compute subresultants of two univariate polyomials as a function of their roots independently of their multiplicity structure. This is…
This paper gives the recursion formula for mixed multiplicities of maximal degrees with respect to joint reductions of ideals, which is one of important results in the mixed multiplicity theory. Using this result, we give consequences on…
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…
We prove formulas for the generating functions for M_2-rank differences for partitions without repeated odd parts. These formulas are in terms of modular forms and generalized Lambert series.
In this paper, we provide formulas for partial sums of weighted averages over regular integers modulo $n$ of the $\gcd$-sum function with any arithmetic function. Many interesting applications of the results are also given.
In earlier work the authors obtained integral formulas for probabilities for a single particle in the asymmetric simple exclusion process. Here formulas are obtained for joint probabilities for several particles. In the case of a single…
In this article we show the rough outline of a computer algorithm to generate lower bounds on the exponential function of (in principle) arbitrary precision. We implemented this to generate all necessary analytic terms for the Boltzmann…