Related papers: On Gegenbauer Point Processes on the unit interval
This paper provides error analyses of the algorithms most commonly used for the evaluation of the Chebyshev polynomial of the first kind $T_N(x)$. Some of these algorithms are shown to be backward stable. This means that the computed value…
We prove a general inequality on $\beta$-mixing coefficients of point processes depending uniquely on their $n$-th order intensity functions. We apply this inequality in the case of determinantal point processes and show that the rate of…
We discuss a practical algorithm to compute parabolic Kazhdan-Lusztig polynomials. As an application we compute Kazhdan-Lusztig polynomials which are needed to evaluate a character formula for reductive groups due to Lusztig. Some…
We compute the leading asymptotics of the maximum of the (centered) logarithm of the absolute value of the characteristic polynomial, denoted $\Psi_N$, of the Ginibre ensemble as the dimension $N$ of the random matrix tends to infinity. The…
We combine different techniques to extract information about the logarithmic contributions to the two-body conservative dynamics within the post-Newtonian (PN) approximation of General Relativity. The logarithms come from the conservative…
The paper presents some heuristic results about the distribution of zeros of Hermite-Pade polynomials of first kind for the case of three functions $1,f,f^2$, where $f$ has the form $f(z): = \prod\limits_ {j = 1 } ^3 (z-a_j) ^ {\alpha_j} $,…
Determinantal Point Processes (DPPs) are a family of probabilistic models that have a repulsive behavior, and lend themselves naturally to many tasks in machine learning where returning a diverse set of objects is important. While there are…
We investigate the interplay between three possible properties of stationary point processes: i) Finite Coulomb energy with short-scale regularization, ii) Finite $2$-Wasserstein transportation distance to the Lebesgue measure and iii)…
We classify nonconstant entire local minimizers of the standard Ginzburg-Landau functional for maps in $H^{1}_{loc}(R^3;R^3)$ satisfying a natural energy bound. Up to translations and rotations, such solutions of the Ginzburg-Landau system…
For a rational $q=u+\frac{\alpha}{d}$ with $u, \alpha, d\in \ACOBZ$ with $u\ge 0, 1\le \alpha<d$, $\gcd(\alpha, d)=1$, the \emph{generalized Hermite-Laguerre polynomials $G_q(x)$} are defined by \begin{align*} G_q(x)&=a_nx^n+a_{n-1}(\alpha…
This work computes the asymptotics of the non-integer moments of the logarithmic derivative of characteristic polynomials of matrices from the $SO(2N+1)$ ensemble. It follows from work of Alvarez and Snaith who computed the asymptotics of…
We describe methods for proving bounds on infinite-time averages in differential dynamical systems. The methods rely on the construction of nonnegative polynomials with certain properties, similarly to the way nonlinear stability can be…
If P is a rational polytope in R^d, then $i_P(t):=#(tP\cap Z^d)$ is a quasi-polynomial in t, called the Ehrhart quasi-polynomial of P. A period of i_P(t) is D(P), the smallest positive integer D such that D*P has integral vertices. Often,…
We consider a doubly stochastic Poisson process with stochastic intensity $\lambda_t =n q\left(X_t\right)$ where $X$ is a continuous It\^o semimartingale and $n$ is an integer. Both processes are observed continuously over a fixed period…
We give a precise algebraic characterisation of the power of Sherali-Adams relaxations for solvability of valued constraint satisfaction problems to optimality. The condition is that of bounded width which has already been shown to capture…
We consider ergodic Jacobi operators and obtain estimates on the Lebesgue measure and the distance between maximum and minimum points of the spectrum in terms of the Lyapunov exponent. Our proofs are based on results from logarithmic…
Gaussian process regression has recently emerged as a powerful, system-agnostic tool for building global potential energy surfaces (PES) of polyatomic molecules. While the accuracy of GP models of PES increases with the number of potential…
Algorithms and underlying mathematics are presented for numerical computation with periodic functions via approximations to machine precision by trigonometric polynomials, including the solution of linear and nonlinear periodic ordinary…
Three-point semidefinite programming bounds are one of the most powerful known tools for bounding the size of spherical codes. In this paper, we use them to prove lower bounds for the potential energy of particles interacting via a pair…
Exponential divided differences arise in numerical linear algebra, matrix-function evaluation, and quantum Monte Carlo simulations, where they serve as kernel weights for time evolution and observable estimation. Efficient and numerically…