Related papers: Taking the logarithm of binomial type sequences: l…
In this work, we investigate the effects of logarithms on the asymptotic behavior of power expansion/OPE in supper-renormalizable QFTs. We performed a careful investigation of the large $p^2$ expansion of a scalar-scalar two-point function…
We retrace the recent history of the Umbral Calculus. After studying the classic results concerning polynomial sequences of binomial type, we generalize to a certain type of logarithmic series. Finally, we demonstrate numerous typical…
Asymptotic expansions are derived as power series in a small coefficient entering a nonlinear multiplicative noise and a deterministic driving term in a nonlinear evolution equation. Detailed estimates on remainders are provided.
Consider an abstract operator $L$ which acts on monomials $x^n$ according to $L x^n= \lambda_n x^n + \nu_n x^{n-2}$ for $\lambda_n$ and $\nu_n$ some coefficients. Let $P_n(x)$ be eigenpolynomials of degree $n$ of $L$: $L P_n(x) = \lambda_n…
In this paper we consider the strong asymptotic behavior of Laguerre polynomials in the complex plane. The leading behavior is well known from Perron and Mehler-Heine formulas, but higher order coefficients, which are important in the…
We present a new method that allows us to get a direct proof of the classical Bernstein asymptotics for the error of the best uniform polynomial approximation of $|x|^p$ on two symmetric intervals. Note, that in addition, we get asymptotics…
We use a non-linear characterization of orthonormal polynomials due to Saff in order to show that the behavior of orthonormal polynomials is determined only by its leading coefficient and its normalization. Several applications of this…
In this article we extend a theorem of Andrews, Crippa, and Simon on the asymptotic behavior of polynomials defined by a general class of recursive equations. Here the polynomials are in the variable $q$, and the recursive definition at…
We obtain exact, simple and very compact expressions for the linearization coefficients of the products of orthogonal polynomials; both the conventional Clebsch-Gordan-type and the modified version. The expressions are general depending…
A novel polynomial expansion method of symmetric Boolean functions is described. The method is efficient for symmetric Boolean function with small set of valued numbers and has the linear complexity for elementary symmetric Boolean…
In this paper, we consider the discrete Laguerre polynomials $P_{n, N}(z)$ orthogonal with respect to the weight function $w(x) = x^{\alpha} e^{-N cx}$ supported on the infinite nodes $L_N = \{ x_{k,N} = \frac{k^2}{N^2}, k \in \mathbb{N}…
The generating series of a radix-rational sequence is a rational formal power series from formal language theory viewed through a fixed radix numeration system. For each radix-rational sequence with complex values we provide an asymptotic…
Given a symmetric polynomial $P$ in $2n$ variables, there exists a unique symmetric polynomial $Q$ in $n$ variables such that \[ P(x_1,\ldots,x_n,x_1^{-1},\ldots,x_n^{-1}) =Q(x_1+x_1^{-1},\ldots,x_n+x_n^{-1}). \] We denote this polynomial…
This paper deals with asymptotics for multiple-set linear canonical analysis (MSLCA). A definition of this analysis, that adapts the classical one to the context of Euclidean random variables, is given and properties of the related…
We approach Riordan arrays and their generalizations via umbral symbolic methods. This new approach allows us to derive fundamental aspects of the theory of Riordan arrays as immediate consequences of the umbral version of the classical…
We study moments of the logarithmic derivative of characteristic polynomials of orthogonal and symplectic random matrices. In particular, we compute the asymptotics for large matrix size, $N$, of these moments evaluated at points which are…
Given a partition $\lambda$ of a number $k$, it is known that by adding a long line of length $n-k$, the dimension of the associated representation of $S_{n}$ is an integer-valued polynomial of degree $k$ in $n$. We show that its expansion…
This paper considers fast algorithms for operations on linearized polynomials. We propose a new multiplication algorithm for skew polynomials (a generalization of linearized polynomials) which has sub-quadratic complexity in the polynomial…
In this work we study orthogonal polynomials via polynomial mappings in the framework of the $H_q-$semiclassical class. We consider two monic orthogonal polynomial sequences $\{p_n (x)\}_{n\geq0}$ and $\{q_n(x)\}_{n\geq0}$ such that $$…
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…