Related papers: Exact formula for 1-lower run overpartitions
We consider the cross section for one-particle inclusive production at high transverse momentum in hadronic collisions. We present the all-order resummation formula that controls the logarithmically-enhanced perturbative QCD contributions…
Polynomial multiplication is a fundamental problem in symbolic computation. There are efficient methods for the multiplication of two univariate polynomials. However, there is rarely efficiently nontrivial method for the multiplication of…
We consider quadrature formulas based on interpolation using the basis functions $1/(1+t_kx)$ $(k=1,2,3,\ldots)$ on $[-1,1]$, where $t_k$ are parameters on the interval $(-1,1)$. We investigate two types of quadratures: quadrature formulas…
A procedure is described that makes use of the generating function of characters to obtain a new generating function $H$ giving the multiplicities of each weight in all the representations of a simple Lie algebra. The way to extract from…
In the previous paper [Sun23], the author proved a uniform bound for sums of half-integral weight Kloosterman sums. This bound was applied to prove an exact formula for partitions of rank modulo 3. That uniform estimate provides a more…
A simple formula computing the multiplier ideal of a monomial ideal on an arbitrary affine toric variety is given. Variants for the multiplier module and test ideals are also treated.
In various applications, computers are required to compute approximations to univariate elementary and special functions such as $\exp$ and $\arctan$ to modest accuracy. This paper proposes a new heuristic for automating the design of such…
The purpose of this paper is to give some explicit formulas involving M\"obius functions, which may be known under the generalized Riemann Hypothesis, but unconditional in this paper. Concretely, we prove explicit formulas of partial sums…
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…
In previous papers the authors gave formulae for generating series of classes (in the Grothendieck ring of complex quasi-projective varieties) of Hilbert schemes of zero-dimensional subschemes on smooth varieties and on orbifolds in terms…
It is known that the number of minimal factorizations of the long cycle in the symmetric group into a product of $k$ cycles of given lengths has a very simple formula: it is $n^{k-1}$ where $n$ is the rank of the underlying symmetric group…
We give a new formula for the rotation number (or Whitney index) of a smooth closed plane curve. This formula is obtained from the winding numbers associated with the regions and the crossing points of the curve. One difference with the…
In this note we will give various exact formulas for functions on integer partitions including the functions $p(n)$ and $p(n,k)$ of the number of partitions of $n$ and the number of such partitions into exactly $k$ parts respectively. For…
In this note we study Kloosterman sums twisted by a multiplicative characters modulo a prime power. We show, by an elementary calculation, that these sums become equidistributed on the real line with respect to a suitable measure.
We develop a generating-function formulation for the symbolic reduction of multi-loop Feynman integrals. In this framework, integration-by-parts identities are rewritten as differential equations for sector-wise generating functions, so the…
Extending a classical estimate of Mertens for the sum of the reciprocals of the first primes, we provide an explicit remainder formula for products of an arbitrary, but fixed, number of primes.
This paper derives numerical bounds for and implements the splitting circle method for finding roots of a univariate polynomial in the presence of fixed precision.
A new formula for the partition function $p(n)$ is developed. We show that the number of partitions of $n$ can be expressed as the sum of a simple function of the two largest parts of all partitions. Specifically, if $a_1 + >... + a_k = n$…
We study applications of clustering (in particular, the $k$-center clustering problem) in the design of efficient and practical algorithms for computing an approximate and the exact arithmetic matrix product of two 0-1 rectangular matrices…
A new formula for the probability that a standard Brownian motion stays between two linear boundaries is proved. A simple algorithm is deduced. Uniform precision estimates are computed. Different implementations have been made available…