betaFeedback

WorksMathematics

Coefficientwise Hankel-total positivity from a universal cumulant lifting

Abstract

Using probabilistic methods, we establish universal cumulant lifting criteria for Stieltjes and Hamburger moment sequences. In the Stieltjes case, we characterize coefficientwise Hankel total positivity after convolution with every initial moment sequence by requiring each once-shifted cumulant sequence to be Stieltjes. We also prove equivalence with the numerical moment property at every nonnegative intensity. In the Hamburger case, we use twice-shifted cumulants to obtain coefficientwise-positive leading Hankel determinants, a degree bound, an explicit highest-degree component, and drift invariance. We work with formal series and require neither exponential moments nor moment determinacy. We establish composition, binomial-convolution, and substitution results, and apply them to implicit equations and autonomous differential equations, tree and forest families, and lognormal compound-Poisson moments in a unified approach. From known moment sequences, we obtain general coefficientwise Hankel-totally positive families containing the classical Bessel, Lah, and Laguerre polynomials. We not only give new proofs of coefficientwise Hankel-total positivity of many combinatorial polynomials, but also prove coefficientwise Hankel total positivity for the component polynomials of functional digraphs confirming a conjecture of Sokal and establish fixed-shape Schläfli–Gessel–Seo polynomials positivity supporting another conjecture of Sokal.

2020 MSC: 05A15; 05A20; 15B48; 44A60.

Introduction

Total positivity of matrices has been deeply studied in various branches of mathematics. For example, Brenti [4] developed total positivity to study unimodality and log-concavity of sequences. Lusztig extended total positivity to reductive groups [24]. Fomin and Zelevinsky [11] studied totally nonnegative parts of double Bruhat cells and their parametrizations. Rietsch related totally positive Toeplitz matrices to the quantum cohomology of partial flag varieties [34]. Kodama and Williams [19] connected the totally nonnegative Grassmannian with regular soliton solutions of the Kadomtsev–Petviashvili equation. Belton, Guillot, Khare and Putinar [2] obtained a classification for entrywise polynomial preservers of positive semidefiniteness in fixed dimension. In their work on moment-sequence transforms [3], they classified entrywise maps preserving moment sequences and totally nonnegative Hankel matrices, and also treated multivariable transforms. We also refer the reader to monographs [18, 32] for more details.

Recent years, there many important progress on coefficientwise Hankel-total positivity. For example, in [31], Pétréolle, Sokal and Zhu developed the theory for coefficientwise Hankel-total positivity based on lattice paths and branched continued fractions. See Zhu [48, 49] for methods from production matrices and Riordan arrays in combinatorics. There are still many difficult open problems on coefficientwise total positivity. We also refer the reader to [7, 31, 38, 30, 31, 44, 45, 46, 48, 49] for more details. In this present paper, we will develop the probabilistic method to prove coefficientwise Hankel-total positivity. We address the functional-digraph problem within this development by characterizing the exponential cumulant families for which a universal coefficientwise lifting property holds.

Functional digraphs and Sokal’s conjecture

A functional digraph on [n]={1,…,n}[n] = \{1, \ldots, n\} is the directed graph of a map from [n][n] to itself: every vertex has out-degree one. Each weakly connected component consists of a directed cycle with rooted trees attached to its cyclic vertices. Let ψn,k\psi_{n,k} be the number of such digraphs with kk components, and put

ψn(y)=∑k=0nψn,kyk,ψ0(y)=1.(1)\psi_n(y) = \sum_{k=0}^{n} \psi_{n,k} y^k,\qquad\psi_0(y) = 1. \tag*{(1)}

We call ψn(y)\psi_n(y) the functional digraph component polynomial. For rooted labeled trees on nn vertices, we write T(t)T(t) for the corresponding exponential generating function. It is known that

T(t)=∑n≥1nn−1tnn!,T(t)=teT(t).(2)T(t) = \sum_{n\geq1} n^{n-1}\frac{t^n}{n!},\qquad T(t) = t e^{T(t)}. \tag*{(2)}

By the exponential formula [41 Corollary 5.1.6], we obtain

∑n≥0ψn(y)tnn!=(1−T(t))−y.(3)\sum_{n\geq0}\psi_n(y)\frac{t^n}{n!}=(1-T(t))^{-y}. \tag*{(3)}

Sokal studied these functional digraph component polynomials and proposed the next conjecture [39 Conjecture 6.9(b)].

Conjecture 1.1 ([39]). The functional digraph component polynomial sequence (ψn(y))n≥0(\psi_n(y))_{n\geq0} is coefficientwise Hankel-totally positive in yy.

Chen and Sokal [5] studied related row-generating polynomials associated with the entries (nk)nn−k\binom{n}{k}n^{n-k}, using a model of partial functional digraphs. To describe the progress on this conjecture, we assign an additional weight qq to each cyclic vertex and denote the resulting polynomials by ψn(q,y)\psi_n(q,y). Their generating functions are

∑n≥0ψn(q,y)tnn!=(1−qT(t))−y,(4)\sum_{n\geq0}\psi_n(q,y)\frac{t^n}{n!}=(1-qT(t))^{-y}, \tag*{(4)}
Cq(t):=−log⁡(1−qT(t))=∑n≥1cn(q)tnn!.(5)C_q(t):=-\log(1-qT(t))=\sum_{n\geq1}c_n(q)\frac{t^n}{n!}. \tag*{(5)}

By (22), we extract the coefficient of yy in ψn(q,y)\psi_n(q,y) to select precisely the digraphs with one weakly connected component. Hence cn(q)=[y]ψn(q,y)c_n(q)=[y]\psi_n(q,y). At q=1q=1, we recover ψn(1,y)=ψn(y)\psi_n(1,y)=\psi_n(y). Conjecture 1.1 was also stated as Conjecture 6.16(ii) in [48] and the following result was proved in [48 Proposition 6.18].

Theorem 1.2 ([48]). For fixed q,y≥0q,y\geq0, the sequence (ψn(q,y))n≥0(\psi_n(q,y))_{n\geq0} is a numerical Stieltjes moment sequence. In particular, for each fixed q≥0q\geq0, (cn+1(q))n≥0(c_{n+1}(q))_{n\geq0} is a Stieltjes moment sequence.

The result concerns fixed nonnegative parameter values. Coefficientwise Hankel-total positivity is stronger than Stieltjes moment property. In Conjecture 1.1, we require every coefficient of each Hankel minor to be nonnegative. We extend Theorem 1.2 to the following result for coefficientwise Hankel-total positivity, which in particular implies Conjecture 1.1.

Theorem 1.3 (Functional-digraph Hankel-total positivity). For every fixed q≥0q\geq0, the sequence (ψn(q,y))n≥0(\psi_n(q,y))_{n\geq0} is coefficientwise Hankel-totally positive in yy. In particular, (ψn(y))n≥0(\psi_n(y))_{n\geq0} is coefficientwise Hankel-totally positive in yy.

We will extend Theorem 1.3 by assigning independent variables to different component colors.

Definition 1.4. Fix m≥1m \ge1 and q=(q1,…,qm)∈[0,∞)m\mathbf{q}=(q_1,\ldots,q_m)\in[0,\infty)^m. Assign one color ℓ∈{1,…,m}\ell\in\{1,\ldots,m\} to each component of a functional digraph. Give that component weight yℓy_\ell and each of its cyclic vertices weight qℓq_\ell. The weight of a colored digraph is the product of its component and vertex weights. Let Ψn(q;y)\Psi_n(\mathbf{q};\mathbf{y}) be the sum of these weights over all digraphs on [n][n] and all component colorings, where y=(y1,…,ym)\mathbf{y}=(y_1,\ldots,y_m). We call Ψn(q;y)\Psi_n(\mathbf{q};\mathbf{y}) the colored functional digraph polynomial.

By the exponential formula, we obtain the generating function

∑n≥0Ψn(q;y)tnn!=∏ℓ=1m(1−qℓT(t))−yℓ=exp⁡(∑ℓ=1myℓCqℓ(t)).(6)\sum_{n\ge0}\Psi_n(\mathbf{q};\mathbf{y})\frac{t^n}{n!}=\prod_{\ell=1}^{m}(1-q_\ell T(t))^{-y_\ell}=\exp\left(\sum_{\ell=1}^{m}y_\ell C_{q_\ell}(t)\right). \tag*{(6)}

Taking m=1m=1, q1=qq_1=q, and y1=yy_1=y, we obtain Ψn((q);(y))=ψn(q,y)\Psi_n((q);(y))=\psi_n(q,y). We extend Theorem 1.3 to the following joint positivity for the colored model.

Theorem 1.5 (Colored functional-digraph Hankel-total positivity). For every fixed q∈[0,∞)m\mathbf{q}\in[0,\infty)^m, (Ψn(q;y))n≥0(\Psi_n(\mathbf{q};\mathbf{y}))_{n\ge0} is coefficientwise Hankel-totally positive jointly in y1,…,ymy_1,\ldots,y_m.

Theorems 1.3 and 1.5 follow from the Stieltjes lifting criterion below; their proof is given in § 6.

A universal lifting criterion for coefficientwise Hankel-total positivity

We will use Stieltjes moment property to present a new universal lifting criterion for coefficientwise Hankel-total positivity. To place the lifting criterion in context, we first recall the role of classical cumulants in probability and statistics. For a real random variable XX with finite absolute moments of every order, we define the moment and cumulant formal power series by

AX(t)=∑n≥0E[Xn]tnn!,KX(t)=log⁡AX(t)=∑n≥1κn(X)tnn!.(7)A_X(t)=\sum_{n\ge0}\mathbb{E}[X^n]\frac{t^n}{n!},\qquad K_X(t)=\log A_X(t)=\sum_{n\ge1}\kappa_n(X)\frac{t^n}{n!}. \tag*{(7)}

We use the normalization AX(0)=1A_X(0)=1, and require no convergence of either formal power series. In particular, κ1(X)=E[X]\kappa_1(X)=\mathbb{E}[X] and κ2(X)=E[X2]−(E[X])2\kappa_2(X)=\mathbb{E}[X^2]-(\mathbb{E}[X])^2; thus the first two cumulants are the mean and variance. For independent random variables X,YX,Y with all absolute moments finite, we have KX+Y(t)=KX(t)+KY(t)K_{X+Y}(t)=K_X(t)+K_Y(t), as a formal identity, and hence κn(X+Y)=κn(X)+κn(Y)\kappa_n(X+Y)=\kappa_n(X)+\kappa_n(Y). For the classical theory and its formulation through partition lattices, see [40].

In enumerative combinatorics, we use the same moment–cumulant relation to pass between arbitrary labeled structures and their connected components. By summing products of cumulants over set partitions, we recover the moments and give the independently colored version in (29). By the exponential formula [41 Corollary 5.1.6], we may therefore regard the connected-component coefficients cn(q)c_n(q) in (5) as cumulants of the functional-digraph family. In this way, we connect Sokal’s conjecture with the positivity properties of moment–cumulant transformations.

In the classical moment problem, for a real sequence, it is a Stieltjes moment sequence, that is,

an=∫0∞xn dμ(x)(n≥0)(8)a_n = \int_0^\infty x^n\,d\mu(x) \quad(n \ge0) \tag*{(8)}

for a nonnegative measure with all moments finite, where the zero measure is allowed. For Stieltjes moment sequences, one requires support in [0,∞)[0,\infty); for Hamburger moments, one allows support on R\mathbb{R}. One also studies these questions through the linear functional L(xn)=an\mathcal{L}(x^n)=a_n: for a Stieltjes representation, one requires L(p(x)2)≥0\mathcal{L}(p(x)^2)\ge0 and L(xp(x)2)≥0\mathcal{L}(xp(x)^2)\ge0 for every real polynomial p(x)p(x). We recall the equivalent matrix criteria in Lemma 2.1; see Schmüdgen [36 Chapter 3].

In probability, one encounters the shifted cumulant condition through compound-Poisson distributions. Let d,λ≥0d,\lambda\ge0, let NyN_y have Poisson distribution with mean λy\lambda y, and let J1,J2,…J_1,J_2,\ldots be independent copies of a nonnegative random variable JJ, independent of NyN_y, with all moments finite. For y≥0y\ge0, set Xy=dy+∑h=1NyJhX_y=dy+\sum_{h=1}^{N_y}J_h, where an empty sum equals zero. By the standard compound-Poisson cumulant formula [22 Chapter 15], we have

κn(Xy)=y(d 1{n=1}+λE[Jn])(n≥1).(9)\kappa_n(X_y)=y\left(d\,1_{\{n=1\}}+\lambda\mathbb{E}[J^n]\right) \quad(n\ge1). \tag*{(9)}

References

  1. [1]C. Andréief, Note sur une relation entre les intégrales définies des produits des fonctions, Mém. Soc. Sci. Phys. Nat. Bordeaux (3) 2 (1886), 1–14.
  2. [2]A. Belton, D. Guillot, A. Khare and M. Putinar, Matrix positivity preservers in fixed dimension. I, Adv. Math. 298 (2016), 325–368.DOI
  3. [3]A. Belton, D. Guillot, A. Khare and M. Putinar, Moment-sequence transforms, J. Eur. Math. Soc. 24 (2022), no. 9, 3109–3160.
  4. [4]F. Brenti, Unimodal, log-concave, and Pólya frequency sequences in combinatorics, Mem. Amer. Math. Soc. 413 (1989).DOI
  5. [5]X. Chen and A. D. Sokal, Total positivity of some polynomial matrices that enumerate labeled trees and forests. II. Rooted labeled trees and partial functional digraphs, Adv. Appl. Math. 157 (2024), 102703.DOI
  6. [6]L. Comtet, Advanced Combinatorics, D. Reidel, Dordrecht, 1974.
  7. [7]B. Deb, A. Dyachenko, M. Păltîrà lIe, A. D. Sokal, Lattice paths and branched continued fractions. III. Generalizations of the Laguerre, rook and Lah polynomials, arXiv:2312.11081 (2023).arxiv.org/abs/2312.11081
  8. [8]M.-J. Ding and J. Zeng, Proof of an explicit formula for a series from Ramanujan’s Notebooks via tree functions, Discrete Math. 347 (2024), no. 6, 113953.arxiv.org/abs/2307.00566
  9. [9]A. Elvey Price and A. D. Sokal, Phylogenetic trees, augmented perfect matchings, and a Thron-type continued fraction (T-fraction) for the Ward polynomials, Electron. J. Combin. 27 (2020), no. 4, Paper 4.6, 36 pp.DOI
  10. [11]S. Fomin and A. Zelevinsky, Double Bruhat cells and total positivity, J. Amer. Math. Soc. 12 (1999), no. 2, 335–380.DOI
  11. [12]H. L. Gan and E. D. Kolaczyk, Approximation of the difference of two Poisson-like counts with Skellam, arXiv:1708.04018 (2017).arxiv.org/abs/1708.04018
  12. [13]G. Giner and G. K. Smyth, statmod: Probability calculations for the inverse Gaussian distribution, The R Journal 8 (2016), no. 1, 339–351.DOI
  13. [14]C. Goldie, A class of infinitely divisible random variables, Proc. Cambridge Philos. Soc. 63 (1967), 1141–1143.DOI
  14. [15]R. A. Horn and C. R. Johnson, Matrix Analysis, 2nd ed., Cambridge University Press, Cambridge, 2013.
  15. [17]M. Josuat-Vergès, Derivatives of the tree function, Ramanujan J. 38 (2015), no. 1, 1–15; arXiv:1310.7531.
  16. [18]S. Karlin, Total Positivity, Vol. I, Stanford University Press, Stanford, CA, 1968.
  17. [19]Y. Kodama and L. K. Williams, KP solitons and total positivity for the Grassmannian, Invent. Math. 198 (2014), no. 3, 637–699.arxiv.org/abs/1106.0023
  18. [20]M. Konvalinka, Non-commutative Sylvester’s determinantal identity, Electron. J. Combin. 14 (2007), no. 1, Research Paper 42.arxiv.org/abs/math/0703213
  19. [21]G. Last and M. D. Penrose, Poisson process Fock space representation, chaos expansion and covariance inequalities, Probab. Theory Related Fields 150 (2011), 663–690.arxiv.org/abs/0909.3205
  20. [22]G. Last and M. Penrose, Lectures on the Poisson Process, Cambridge University Press, Cambridge, 2017.DOI
  21. [23]J. W. Layman, The Hankel transform and some of its properties, J. Integer Seq. 4 (2001), Article 01.1.5.
  22. [24]G. Lusztig, Total positivity in reductive groups, in Lie Theory and Geometry, J.-L. Brylinski, R. Brylinski, V. Guillemin and V. Kac (eds.), Progress in Mathematics 123, Birkhäuser, Boston, MA, 1994, pp. 531–568.DOI
  23. [25]I. G. Macdonald, Symmetric Functions and Hall Polynomials, 2nd ed., Oxford University Press, Oxford, 1995.DOI
  24. [26]W. Młotkowski, Fuss-Catalan numbers in noncommutative probability, Doc. Math. 15 (2010), 939–955.
  25. [27]NIST Digital Library of Mathematical Functions, Gamma function: integrals and rising factorials, Eqs. 5.2.1, 5.2.5 and 5.9.1, dlmf.nist.gov/5.2 and 5.9.
  26. [28]NIST Digital Library of Mathematical Functions, Laguerre polynomials: orthogonality, finite formulas and generating functions, Table 18.3.1, Eqs. 18.5.12 and 18.12.13, dlmf.nist.gov/18.3#T1, 18.5#E12 and 18.12#E13.
  27. [29]NIST Digital Library of Mathematical Functions, Orthogonality, norms and moment determinants, Section 18.2(ix), Tables 18.3.1 and 18.19.1, dlmf.nist.gov/18.2(ix), 18.3.1 and 18.19.1.
  28. [30]M. Pétréolle, A.D. Sokal, Lattice paths and branched continued fractions. II. Multivariate Lah polynomials and Lah symmetric functions, European J. Combin. 92, Article 103235.
  29. [31]M. Pétréolle, A. D. Sokal and B.-X. Zhu, Lattice paths and branched continued fractions: An infinite sequence of generalizations of the Stieltjes–Rogers and Thron–Rogers polynomials, with coefficientwise Hankel-total positivity, Mem. Amer. Math. Soc. 291 (2023), no. 1450, 154 pp.arxiv.org/abs/1807.03271
  30. [32]A. Pinkus, Totally Positive Matrices, Cambridge University Press, Cambridge, 2010.DOI
  31. [33]G. Pólya, G. Szegő, Problems and Theorems in Analysis, Vol. II, Springer-Verlag, Berlin, 1976.
  32. [34]K. Rietsch, Totally positive Toeplitz matrices and quantum cohomology of partial flag varieties, J. Amer. Math. Soc. 16 (2003), no. 2, 363–392.DOI
  33. [35]R. L. Schilling, R. Song and Z. Vondrač̌ek, Bernstein Functions: Theory and Applications, 2nd ed., de Gruyter Studies in Mathematics 37, Walter de Gruyter, Berlin, 2012.
  34. [36]K. Schmüdgen, The Moment Problem, Graduate Texts in Mathematics 277, Springer, Cham, 2017.DOI
  35. [37]B. Simon, The classical moment problem as a self-adjoint finite difference operator, Adv. Math. 137 (1998), 82–203.arxiv.org/abs/math-ph/9906008
  36. [38]A.D. Sokal, Coefficientwise total positivity (via continued fractions) for some Hankel matrices of combinatorial polynomials, in preparation.
  37. [39]A. D. Sokal, Total positivity of some polynomial matrices that enumerate labeled trees and forests. I. Forests of rooted labeled trees, Monatsh. Math. 200 (2023), 389–452.DOI
  38. [40]T. P. Speed, Cumulants and partition lattices, Austral. J. Statist. 25 (1983), no. 2, 378–388.
  39. [41]R. P. Stanley, Enumerative Combinatorics, Volume 2, Cambridge University Press, 1999, Sections 5.1, 5.4, 7.10 and 7.15.
  40. [42]Y. Wang and B.-X. Zhu, Log-convex and Stieltjes moment sequences, Adv. Appl. Math. 81 (2016), 115–127.arxiv.org/abs/1612.04114
  41. [43]J. Zeng, A Ramanujan sequence that refines the Cayley formula for trees, Ramanujan J. 3 (1999), no. 1, 45–54.
  42. [44]B.-X. Zhu, A generalized Eulerian triangle from staircase tableaux and tree-like tableaux, J. Combin. Theory Ser. A 172 (2020), Article 105206, 32 pp.DOI
  43. [45]B.-X. Zhu, Stieltjes moment properties and continued fractions from combinatorial triangles, Adv. in Appl. Math. 130 (2021), Article 102232, 33 pp.arxiv.org/abs/2007.14924
  44. [46]B.-X. Zhu, On a Stirling-Whitney-Riordan triangle, J. Algebraic Combin. 54 (2021) 999–1019.arxiv.org/abs/2008.04120
  45. [47]B.-X. Zhu, Total positivity from the exponential Riordan arrays, SIAM J. Discrete Math. 35 (2021), 2971–3003.arxiv.org/abs/2006.14485
  46. [48]B.-X. Zhu, Coefficientwise Hankel-total positivity of the row-generating polynomials for the output matrices of certain production matrices, Adv. Math. 447 (2024), 109695.arxiv.org/abs/2202.03793
  47. [49]B.-X. Zhu, Coefficientwise total positivity and Stieltjes moment properties from Riordan arrays, J. Lond. Math. Soc. (2) 113 (2026), no. 2, e70450.DOI

Paper details

vlnc:W_a6jejg6x
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC0-1.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents