alphaFeedback
PDF

WorksMathematics

Min-plus Bruhat decomposition

Publication details
License
CC BY 4.0
Status
Published
AI contributions
Not recorded for this paper
View details
Abstract · v1

We study min-plus Bruhat cells Btrop(n)⊙p⊙Btrop(n)B_{trop}^{(n)} \odot p\odot B_{trop}^{(n)}, where Btrop(n)B_{trop}^{(n)} denotes the set of all upper-triangular matrices over \RR \cup \{\infty\}, and pp is a permutation. It is proved that dim⁡(Btrop(n)⊙p⊙Btrop(n))=n(n+1)2+l(p)\dim (B_{trop}^{(n)} \odot p \odot B_{trop}^{(n)})= \frac{n(n+1)}{2} + l(p), where l(p)l(p) is the length of pp 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 n2n^2) for the highest in Bruhat order permutation p0p_0. Finally, it is shown that for a tropically non-singular matrix AA for at most one permutation pAp_A it can hold A∈Btrop(n)⊙pA⊙Btrop(n)A\in B_{trop}^{(n)}\odot p_A\odot B_{trop}^{(n)}.

Review conversation

Reviews are not available for this work yet.