Given an matrix and sets , of , let denote the -submatrix of . We consider a class of - totally nonnegative (TNN) matrices arising as antiadjacency matrices of unit interval orders, and show that for each matrix in this class, the inequalities \begin{equation} \operatorname{perm}(A_{[1,h],[1,h]}) \operatorname{perm}(A_{[h+1,n],[h+1,n]}) ;\geq; \operatorname{perm}(A_{[1,n] \cap 2\mathbb Z, [1,n] \cap 2\mathbb Z}) \operatorname{perm}(A_{[1,n] \smallsetminus 2\mathbb Z, [1,n] \smallsetminus 2\mathbb Z}) \label{eq:absmain} \end{equation} hold for . Let be the Young subgroup , and be the parity-alternating permutations \{w = w_1\cdots w_n \in \mathfrak{S}_n \ | \ \text{iw_ihave the same parity} \}. We find a bijective map such that under the Bruhat order for all . The existence of such a bijective map ensures that inequalities are satisfied for all TNN matrices when . We also conjecture the inequalities to hold for all totally nonnegative matrices and all

生成讲解博客的中文版本

生成AI智能校验的中文版本