A probabilistic characterization of the dominance order on partitions

DOI10.1007/S11083-017-9438-ZzbMATH Open1409.05026OpenAlexW2288378091MaRDI QIDQ722597FDOQ722597

Authors Clifford Smyth

Publication date 27 July 2018

Published in Order (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1512.04084

zbMATH Keywords

dominance orderRiordan matricesmajorization ordertotal non-negativityPólya frequency sequences

Mathematics Subject Classification ID

Combinatorial probability (60C05) Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81)

Abstract: A probabilistic characterization of the dominance partial order on the set of partitions is presented. This extends work in "Symmetric polynomials and symmetric mean inequalities". Electron. J. Combin., 20(3): Paper 34, 2013. Let $n$ be a positive integer and let $u$ be a partition of $n$. Let $F$ be the Ferrers diagram of $u$. Let $m$ be a positive integer and let $pin(0,1)$. Fill each cell of $F$ with balls, the number of which is independently drawn from the random variable $X=Bin(m,p)$. Given non-negative integers $j$ and $t$, let $P(u,j,t)$ be the probability that the total number of balls in $F$ is $j$ and that no row of $F$ contains more that $t$ balls. We show that if $u$ and $mu$ are partitions of $n$, then $u$ dominates $mu$, i.e. $su{m}_{i=1}^{k}u(i)geqsu{m}_{i=1}^{k}mu(i)$ for all positive integers $k$, if and only if $P(u,j,t)leqP(mu,j,t)$ for all non-negative integers $j$ and $t$. It is also shown that this same result holds when $X$ is replaced by any one member of a large class of random variables. Let $p={p_n}_{n=0}^{i}nfty$ be a sequence of real numbers. Let ${calT}_p$ be the $mathbbN$ by $mathbbN$ matrix with $({calT}_p{)}_{i,j}=p_{j-i}$ for all $i,jinmathbbN$ where we take $p_n=0$ for $n<0$. Let $(p^i{)}_j$ be the coefficient of $x^j$ in $(p(x){)}^i$ where $p(x)=su{m}_{n=0}^{i}nfty{p}_n{x}^n$ and $p^0(x)=1$. Let ${calS}_p$ be the $mathbbN$ by $mathbbN$ matrix with $({calS}_p{)}_{i,j}=(p^i{)}_j$ for all $i,jinmathbbN$. We show that if ${calT}_p$ is totally non-negative of order $k$ then so is ${calS}_p$. The case $k=2$ of this result is a key step in the proof of the result on domination. We also show that the case $k=2$ would follow from a combinatorial conjecture that might be of independent interest.

Recommendations

• Confirming two conjectures about the integer partitions
• Random partitions with non-negative \(r\)th differences
• Zwei Extreme in der Zinnchemie: Ein nichtbindender Sn–Sn‐Abstand von 285 pm und eine ¹¹⁹ Sn‐NMR‐Verschiebung δ = 3301 in metallorganischen Derivaten von Sn(0)
• Probabilistic analysis for random integer partitions
• Asymptotic joint distribution of the extremities of a random Young diagram and enumeration of graphical partitions

Cites work

• scientific article; zbMATH DE number 3771876 (Why is no real title available?)
• scientific article; zbMATH DE number 3348831 (Why is no real title available?)
• Inequalities: theory of majorization and its applications
• Symmetric polynomials and symmetric mean inequalities
• The Riordan group
• Total positivity of Riordan arrays
• Totally nonnegative matrices

Cited in

(7)

• Characterizations of exchangeable partitions and random discrete distributions by deletion properties
• Yet another criterion for the total positivity of Riordan arrays
• Some properties of combinatorial triangles related to Horadam polynomials
• scientific article; zbMATH DE number 5117130 (Why is no real title available?)
• Characterizing the supernorm partition statistic
• Parity theorems for statistics on domino arrangements
• Total positivity from the exponential Riordan arrays

This page was built for publication: A probabilistic characterization of the dominance order on partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q722597)