Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOn generating functions of Hausdorff moment sequences
118
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
The class of generating functions for completely monotone sequences (moments of finite positive measures on $[0,1]$) has an elegant characterization as the class of Pick functions analytic and positive on $(-infty,1)$. We establish this and another such characterization and develop a variety of consequences. In particular, we characterize generating functions for moments of convex and concave probability distribution functions on $[0,1]$. Also we provide a simple analytic proof that for any real $p$ and $r$ with $p>0$, the Fuss-Catalan or Raney numbers $frac{r}{pn+r}binom{pn+r}{n}$, $n=0,1,ldots$ are the moments of a probability distribution on some interval $[0,tau]$ {if and only if} $pge1$ and $pge rge 0$. The same statement holds for the binomial coefficients $binom{pn+r-1}n$, $n=0,1,ldots$.
rate research
Read More
In this paper we show that many well-known counting coefficients, including the Catalan numbers, the Motzkin numbers, the central binomial coefficients, the central Delannoy numbers are Hausdorff moment sequences in a unified approach. In particular we answer a conjecture of Liang at al. which such numbers have unique representing measures. The smallest interval including the support of representing measure is explicitly found. Subsequences of Catalan-like numbers are also considered. We provide a necessary and sufficient condition for a pattern of subsequences that if sequences are the Stieltjes Catalan-like numbers, then their subsequences are Stieltjes Catalan-like numbers. Moreover, a representing measure of a linear combination of consecutive Catalan-like numbers is studied.
Electronic transport through chaotic quantum dots exhibits universal behaviour which can be understood through the semiclassical approximation. Within the approximation, transport moments reduce to codifying classical correlations between scattering trajectories. These can be represented as ribbon graphs and we develop an algorithmic combinatorial method to generate all such graphs with a given genus. This provides an expansion of the linear transport moments for systems both with and without time reversal symmetry. The computational implementation is then able to progress several orders higher than previous semiclassical formulae as well as those derived from an asymptotic expansion of random matrix results. The patterns observed also suggest a general form for the higher orders.
Starting from the moment sequences of classical orthogonal polynomials we derive the orthogonality purely algebraically. We consider also the moments of ($q=1$) classical orthogonal polynomials, and study those cases in which the exponential generating function has a nice form. In the opposite direction, we show that the generalized Dumont-Foata polynomials with six parameters are the moments of rescaled continuous dual Hahn polynomials.
In this note, we show that the Hausdorff operator $H_{Phi}$ is unbounded on a large family of Quasi-Banach spaces, unless $H_{Phi}$ is a zero operator.
We derive the P-finite recurrences for classes of sequences with ordinary generating function containing roots of polynomials. The focus is on establishing the D-finite differential equations such that the familiar steps of reducing their power series expansions apply.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
