Stieltjes Moment Sequences for Pattern-Avoiding Permutations

A small set of combinatorial sequences have coefficients that can be represented as moments of a nonnegative measure on $[0, \infty)$. Such sequences are known as Stieltjes moment sequences. They have a number of nice properties, such as log-convexity, which are useful to rigorously bound their growth constant from below. This article focuses on some classical sequences in enumerative combinatorics, denoted $Av(\mathcal{P})$, and counting permutations of $\{1, 2, \ldots, n \}$ that avoid some given pattern $\mathcal{P}$. For increasing patterns $\mathcal{P}=(12\ldots k)$, we recall that the corresponding sequences, $Av(123\ldots k)$, are Stieltjes moment sequences, and we explicitly find the underlying density function, either exactly or numerically, by using the Stieltjes inversion formula as a fundamental tool. We first illustrate our approach on two basic examples, $Av(123)$ and $Av(1342)$, whose generating functions are algebraic. We next investigate the general (transcendental) case of $Av(123\ldots k)$, which counts permutations whose longest increasing subsequences have length at most $k-1$. We show that the generating functions of the sequences $\, Av(1234)$ and $\, Av(12345)$ correspond, up to simple rational functions, to an order-one linear differential operator acting on a classical modular form given as a pullback of a Gaussian $\, _2F_1$ hypergeometric function, respectively to an order-two linear differential operator acting on the square of a classical modular form given as a pullback of a $\, _2F_1$ hypergeometric function. We demonstrate that the density function for the Stieltjes moment sequence $Av(123\ldots k)$ is closely, but non-trivially, related to the density attached to the distance traveled by a walk in the plane with $k-1$ unit steps in random directions. Finally, we study the challenging case of the $Av(1324)$ sequence and give compelling numerical evidence that this too is a Stieltjes moment sequence. Accepting this, we show how rigorous lower bounds on the growth constant of this sequence can be constructed, which are stronger than existing bounds. A further unproven assumption leads to even better bounds, which can be extrapolated to give an estimate of the (unknown) growth constant.

A two-parameter extension of Urbanik’s product convolution semigroup

We prove that sna, b = Γan + b/Γb, n = 0, 1, . . ., is an infinitely divisible Stieltjes moment sequence for arbitrary a, b > 0. Its powers sna, bc, c > 0, are Stieltjes determinate if and only if ac ≤ 2. The latter was conjectured in a paper by Lin 2019 in the case b = 1. We describe a product convolution semigroup τca, b, c > 0, of probability measures on the positive half-line with densities eca, b and having the moments sna, bc. We determine the asymptotic behavior of eca, bt for t → 0 and for t → ∞, and the latter implies the Stieltjes indeterminacy when ac > 2. The results extend the previous work of the author and Lopez 2015 and lead to a convolution semigroup of probability densities gca, bxc>0 on the real line. The special case gca, 1xc>0 are the convolution roots of the Gumbel distribution with scale parameter a > 0. All the densities gca, bx lead to determinate Hamburger moment problems.

The complex moment problem: determinacy and extendibility

Complex moment sequences are exactly those which admit positive definite extensions on the integer lattice points of the upper diagonal half-plane. Here we prove that the aforesaid extension is unique provided the complex moment sequence is determinate and its only representing measure has no atom at $0$. The question of converting the relation is posed as an open problem. A partial solution to this problem is established when at least one of representing measures is supported in a plane algebraic curve whose intersection with every straight line passing through $0$ is at most one point set. Further study concerns representing measures whose supports are Zariski dense in $\mathbb{C} $ as well as complex moment sequences which are constant on a family of parallel “Diophantine lines”. All this is supported by a bunch of illustrative examples.

Hamburger and Stieltjes Moment Problems for Operators

Solutions to some operator-valued, unidimensional, Hamburger and Stieltjes moment problems in this paper are given. Necessary and sufficient conditions on some sequences of bounded operators being Hamburger, respectively, Stieltjes operator-valued moment sequences are obtained. The determinateness of the operator-valued Hamburger and Stieltjes moment sequence is studied.

A generalization of Mehta-Wang determinant and Askey-Wilson polynomials

International audience Motivated by the Gaussian symplectic ensemble, Mehta and Wang evaluated the $n×n$ determinant $\det ((a+j-i)Γ (b+j+i))$ in 2000. When $a=0$, Ciucu and Krattenthaler computed the associated Pfaffian $\mathrm{Pf}((j-i)Γ (b+j+i))$ with an application to the two dimensional dimer system in 2011. Recently we have generalized the latter Pfaffian formula with a $q$-analogue by replacing the Gamma function by the moment sequence of the little $q$-Jacobi polynomials. On the other hand, Nishizawa has found a q-analogue of the Mehta–Wang formula. Our purpose is to generalize both the Mehta-Wang and Nishizawa formulae by using the moment sequence of the little $q$-Jacobi polynomials. It turns out that the corresponding determinant can be evaluated explicitly in terms of the Askey-Wilson polynomials.

Limiting Distributions for a Class Of Diminishing Urn Models

In this work we analyze a class of 2 × 2 Pólya-Eggenberger urn models with ball replacement matrix and c = pa with . We determine limiting distributions by obtaining a precise recursive description of the moments of the considered random variables, which allows us to deduce asymptotic expansions of the moments. In particular, we obtain limiting distributions for the pills problem a = c = d = 1, originally proposed by Knuth and McCarthy. Furthermore, we also obtain limiting distributions for the well-known sampling without replacement urn, a = d = 1 and c = 0, and generalizations of it to arbitrary and c = 0. Moreover, we obtain a recursive description of the moment sequence for a generalized problem.

Limiting Distributions for a Class Of Diminishing Urn Models

In this work we analyze a class of 2 × 2 Pólya-Eggenberger urn models with ball replacement matrix and c = pa with . We determine limiting distributions by obtaining a precise recursive description of the moments of the considered random variables, which allows us to deduce asymptotic expansions of the moments. In particular, we obtain limiting distributions for the pills problem a = c = d = 1, originally proposed by Knuth and McCarthy. Furthermore, we also obtain limiting distributions for the well-known sampling without replacement urn, a = d = 1 and c = 0, and generalizations of it to arbitrary and c = 0. Moreover, we obtain a recursive description of the moment sequence for a generalized problem.