WorksMathematics
Min-plus Bruhat decomposition
Abstract · v1
We study min-plus Bruhat cells , where denotes the set of all upper-triangular matrices over \RR \cup \{\infty\}, and is a permutation. It is proved that , where is the length of in Coxeter generators. Also we provide an explicit description of the cell B_{trop}^{(n)}(\RR) \odot p_0\odot B_{trop}^{(n)}(\RR) (up to a subset of dimension less than ) for the highest in Bruhat order permutation . Finally, it is shown that for a tropically non-singular matrix for at most one permutation it can hold .
Review conversation
Reviews are not available for this work yet.