Skip to content

Min-plus Bruhat decomposition

Dima Grigoriev

math.AGarXiv:2611.03896

Abstract

We study min-plus Bruhat cells Btrop(n) p Btrop(n), where Btrop(n) denotes the set of all upper-triangular matrices over \∞\, and p is a permutation. It is proved that (Btrop(n) p Btrop(n))= n(n+1)2 + l(p), where l(p) is the length of p in Coxeter generators. Also we provide an explicit description of the cell Btrop(n)() p0 Btrop(n)() (up to a subset of dimension less than n2) for the highest in Bruhat order permutation p0. Finally, it is shown that for a tropically non-singular matrix A for at most one permutation pA it can hold A∈ Btrop(n) pA Btrop(n).

Create a lesson