Derangements and asymptotics of Laplace transforms of polynomials
classification
🧮 math.CA
math.CO
keywords
derangementslaplacetransformsapproachasymptoticsbehaviorcombinatorialcomplex
read the original abstract
We use a probabilistic approach to describe the behavior as $n -> \infty$ of the Laplace transforms of $P^n$, where $P$ a fixed complex polynomial. As a consequence we obtain a new elementary proof of an result of Gillis-Ismail-Offer in the combinatorial theory of derangements.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.