SearcharxivSearch

arXiv subjects

Tomislav Burić

Publications and source records attributed to Tomislav Burić.

2 recordsLinked to original sources

Appell Polynomials in Shifted Asymptotic Expansions: the Mills ratio, Hermite polynomials, and Stieltjes bounds

A theorem of Burić, Elezović and Vuk\v sić states that translating the argument in an asymptotic expansion, $f(x)\sim\sum(-1)^na_nx^{-n-1}$, to $f(x+t)$, replaces the constant coefficients $a_n$ by the Appell polynomials $R_n(t)$ generated by $(a_n)$. Their motivating examples came from the gamma and polygamma functions, where Bernoulli polynomials occur. We extend this construction beyond that setting and identify the Borel--Laplace representation $L_A(x)=\int_0^\infty e^{-xs}A(-s)\,\dd s$, whenever the integral exists. For the Gaussian kernel $A(-s)=e^{-s^2/2}$, this representation gives the \emph{Mills--Hermite} expansion $M(x+t)\sim\sum(-1)^n\He_n(t)x^{-n-1}$, extending the classical scalar expansion. We establish an explicit remainder estimate and derive finite-difference formulas that remain in the Hermite polynomial algebra. As an application, we obtain a large-threshold expansion of the non-central Gaussian tail with explicit polynomial dependence on the mean. If $A(-s)$ is itself the Laplace transform of a positive measure, then the coefficients form a Stieltjes moment sequence. The associated Padé convergents give a systematic hierarchy of two-sided bounds in which successive lower and upper approximants incorporate the moments one at a time.

math.CA

Asymptotic Analysis of Nonsymmetric Gaussian and Archimedean Compound Means

This paper studies asymptotic expansions of the Gaussian and Archimedean compounds of two arbitrary bivariate means that need not be symmetric. Recursive algorithms for the coefficients of such expansions were previously obtained only in the symmetric case. Here, this restriction is removed and recursions are derived for the general nonsymmetric setting. All coefficient calculations are carried out in the algebra of formal power series. This introduces an additional case in the recursion, as well as singular configurations in which the formal invariance equation does not determine the coefficients recursively. The formal problem is kept separate from the existence and convergence of the iterative procedures. We also connect the first formal coefficients with Farhi's metric, recall its known global convergence criterion, and derive the corresponding local rates. The algorithms are illustrated using weighted power means and several known identities. Finally, the method is extended to expansions with sign-dependent coefficients and is applied to the neo-Pythagorean means and to a recently introduced two-parameter family.

math.GM