Related papers: CM Method and Expansion of Numbers
Asymptotic expansions are derived for Gegenbauer (ultraspherical) polynomials for large order $n$ that are uniformly valid for unbounded complex values of the argument $z$, including the real interval $0 \leq z \leq 1$ in which the zeros in…
We discuss the pole mass and the width of the $\Delta(1232)$ resonance to third order in chiral effective field theory. In our calculation we choose the complex-mass renormalization scheme (CMS) and show that the CMS provides a consistent…
Let $\mathrm{TC}_r(X)$ denote the $r$-th topological complexity of a space $X$. In many cases, the generating function $\sum_{r\ge 1}\mathrm{TC}_{r+1}(X)x^r$ is a rational function $\frac{P(x)}{(1-x)^2}$ where $P(x)$ is a polynomial with…
For fixed natural numbers $r$ and $s$, where $2\leq s \leq r$, we consider a representation of numbers from the interval $[0;\frac{r}{s-1}]$ obtained by encoding numbers by means of the alphabet $A=\{0,1,...,r\}$ via the expansion…
We consider a stationary random field indexed by an increasing sequence of subsets of $\mathbb{Z}^d$ obeying a very broad geometrical assumption on how the sequence expands. Under certain mixing and local conditions, we show how the tail…
In this paper the local order of convergence used in iterative methods to solve nonlinear systems of equations is revisited, where shorter alternative analytic proofs of the order based on developments of multilineal functions are shown.…
We introduce a growth process which samples sections of uniform infinite causal triangulations by elementary moves in which a single triangle is added. A relation to a random walk on the integer half line is shown. This relation is used to…
Quasi-Monte Carlo (QMC) methods for estimating integrals are attractive since the resulting estimators typically converge at a faster rate than pseudo-random Monte Carlo. However, they can be difficult to set up on arbitrary posterior…
Here we examine the number of ways to partition an integer $n$ into $k$th powers when $n$ is large. Simplified proofs of some asymptotic results of Wright are given using the saddle-point method, including exact formulas for the expansion…
We consider the mass-dependent aggregation process (k+1)X -> X, given a fixed number of unit mass particles in the initial state. One cluster is chosen proportional to its mass and is merged into one either with k-neighbors in one…
We present methods for the numerical evaluation of the master integrals that appear in the calculation of scattering amplitudes at higher order in perturbative quantum field theory. We follow the general strategy of solving first-order…
The Fourier extension method, also known as the Fourier continuation method, is a method for approximating non-periodic functions on an interval using truncated Fourier series with period larger than the interval on which the function is…
In this paper, we study the probability density function, $\mathbb{P}(c,\alpha,\beta, n)\,dc$, of the center of mass of the finite $n$ Jacobi unitary ensembles with parameters $\alpha\,>-1$ and $\beta >-1$; that is the probability that…
The secant method is a very effective numerical procedure used for solving nonlinear equations of the form $f(x)=0$. It is derived via a linear interpolation procedure and employs only values of $f(x)$ at the approximations to the root of…
In this paper we extend some set theoretic concepts of numerical semigroups for arbitrary sub-semigroups of natural numbers. Then we characterized gapsets which leads to a more efficient computational approach towards numerical semigroups…
We give a 'recursive' formula (in terms of reducible limits) for counting rational curves on a variety moving in any sufficiently large and well-behaved family. Our approach is completely elementary and makes no use of moduli spaces for…
Let $q\in(1,2)$ and $x\in[0,\frac1{q-1}]$. We say that a sequence $(\epsilon_i)_{i=1}^{\infty}\in\{0,1\}^{\mathbb{N}}$ is an expansion of $x$ in base $q$ (or a $q$-expansion) if x=\sum_{i=1}^{\infty}\epsilon_iq^{-i}. Let…
We describe the recently developed on-shell bootstrap for computing one-loop amplitudes in non-supersymmetric theories such as QCD. The method combines the unitarity method with loop-level on-shell recursion. The unitarity method is used to…
We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible…
We extend the spectral method for proving limit theorems to random non-uniformly expanding dynamical systems. This yields the CLT and moderate deviations principles (MDP). We show that as the amount of non-uniformity decreases the CLT rates…