Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2006.14485

Total positivity from the exponential Riordan arrays

Bao-Xuan Zhu
View original source ↗Read source document ↗Export metadata ↓

Abstract

Log-concavity and almost log-convexity of the cycle index polynomials were proved by Bender and Canfield [J. Combin. Theory Ser. A 74 (1996)]. Schirmacher [J. Combin. Theory Ser. A 85 (1999)] extended them to $q$-log-concavity and almost $q$-log-convexity. Motivated by these, we consider the stronger properties total positivity from the Toeplitz matrix and Hankel matrix. By using exponential Riordan array methods, we give some criteria for total positivity of the triangular matrix of coefficients of the generalized cycle index polynomials, the Toeplitz matrix and Hankel matrix of the polynomial sequence in terms of the exponential formula, the logarithmic formula and the fractional formula, respectively. Finally, we apply our criteria to some triangular arrays satisfying some recurrence relations, including Bessel triangles of two kinds and their generalizations, the Lah triangle and its generalization, the idempotent triangle and some triangles related to binomial coefficients, rook polynomials and Laguerre polynomials. We not only get total positivity of these lower-triangles, and $q$-Stieltjes moment properties and $3$-$q$-log-convexity of their row-generating functions, but also prove that their triangular convolutions preserve Stieltjes moment property. In particular, we solve a conjecture of Sokal on $q$-Stieltjes moment property of rook polynomials.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bao-Xuan Zhu. 2021-10-10. Total positivity from the exponential Riordan arrays. https://arxiv.org/abs/2006.14485

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗