2000 character limit reached
Permanental inequalities for totally positive matrices
Published 3 Jun 2024 in math.CO | (2406.00963v1)
Abstract: We characterize ratios of permanents of (generalized) submatrices which are bounded on the set of all totally positive matrices. This provides a permanental analog of results of Fallat, Gekhtman, and Johnson [{\em Adv.\ Appl.\ Math.} {\bf 30} no.\ 3, (2003) pp.\ 442--470] concerning ratios of matrix minors. We also extend work of Drake, Gerrish, and the first author [{\em Electron.\ J.\ Combin.,} {\bf 11} no.\ 1, (2004) Note 6] by characterizing the differences of monomials in $\mathbb{Z}[x_{1,1},x_{1,2},...,x_{n,n}]$ which evaluate positively on the set of all totally positive $n \times n$ matrices.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.