Related papers: A new method for computing asymptotics of diagonal…

It is well known that the Newton method may not converge when the initial guess does not belong to a specific quadratic convergence region. We propose a family of new variants of the Newton method with the potential advantage of having a…

Given a Feynman parameter integral, depending on a single discrete variable $N$ and a real parameter $\epsilon$, we discuss a new algorithmic framework to compute the first coefficients of its Laurent series expansion in $\epsilon$. In a…

The asymptotic expansion method is generalized from the periodic setting to stationary ergodic stochastic geometries. This will demonstrate that results from periodic asymptotic expansion also apply to non-periodic structures of a certain…

Near-Gaussian probability densities are common in many important physical applications. Here we develop an asymptotic expansion methodology for computing entropic functionals for such densities. The expansion proposed is a close relative of…

A new technique towards finding asymptotic normalization coefficients in the complex-ranged Gaussian basis is presented. It is shown that a diagonalisation procedure for the total Hamiltonian matrix in the given basis results in…

We give rational expressions for the subresultants of n+1 generic polynomials f_1,..., f_{n+1} in n variables as a function of the coordinates of the common roots of f_1,..., f_n and their evaluation in f_{n+1}. We present a simple…

Methods were initiated by Mark Kac and Richard Feynman to evaluate random functionals of the form $\int^t_0V(X_s)ds$ for a nonnegative $V$ and a Markov process $X_t$. Their results evolved into the well known Feynman Kac formula.…

Asymptotic expansions for a wide class of distribution are studied. A simple method for computation of the series coefficients is suggested. The case when regularization parameter of the distribution depends on the asymptotic parameter is…

Exact formulas are derived for the probability density functions of the sum and difference of two independent non-central gamma distributed random variables, with both series and integral representations of the density presented. These…

Assuming that a plane partition of the positive integer $n$ is chosen uniformly at random from the set of all such partitions, we propose a general asymptotic scheme for the computation of expectations of various plane partition statistics…

Let $F({\bf x})\in\mathbb{Z}[x_1,x_2,\dots,x_n]$ be a quadratic polynomial in $n\geq 3$ variables with a nonsingular quadratic part. Using the circle method we derive an asymptotic formula for the sum $$ \Sigma_{k,F}(X;…

In this paper we relate a fundamental parameter of a random graph, its degree sequence, to a simple model of nearly independent binomial random variables. This confirms a conjecture made in 1997. As a result, many interesting functions of…

Let $\{a_n(x)\}_{n\geq1}$ be the sequence of digits of $x\in(0,1)$ in infinite iterated function systems with polynomial decay of the derivative. We first study the multifractal spectrum of the convergence exponent defined by the sequence…

In this paper, we tackle the following problem: compute the gcd for several univariate polynomials with parametric coefficients. It amounts to partitioning the parameter space into ``cells'' so that the gcd has a uniform expression over…

In this work we provide a novel approach for computing the coefficients of the characteristic polynomial of a square matrix. We demonstrate that each coefficient can be efficiently represented by a set of circle graphs. Thus, one can employ…

Using the steepest descent method of Deift-Zhou, we derive locally uniform asymptotic formulas for the Meixner polynomials. These include an asymptotic formula in a neighborhood of the origin, a result which as far as we are aware has not…

We look at the asymptotic behavior of the coefficients of the $q$-binomial coefficients (or Gaussian polynomials) $\binom{a+k}{k}_q$, when $k$ is fixed. We give a number of results in this direction, some of which involve Eulerian…

We establish an alternative, ``perpendicular" collection of generating functions for the coefficients of Gaussian polynomials, $\begin{bmatrix}N+m\\m\end{bmatrix}_q$. We provide a general characterization of these perpendicular generating…

A novel method of asymptotic factorization of $n \times n$ matrix functions is proposed. Considered class of matrices is motivated by certain problems originated in the elasticity theory. An example is constructed to illustrate…

The on-line nearest-neighbour graph on a sequence of $n$ uniform random points in $(0,1)^d$ ($d \in \N$) joins each point after the first to its nearest neighbour amongst its predecessors. For the total power-weighted edge-length of this…