Min-plus Bruhat decomposition
Dima Grigoriev
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
Related papers
Conjecture B for X10 and its genus-two mirror
Alex Junior Gomez Saltachin
A Bubble Compactification of KSBA Moduli Space of Surfaces of General Type
Yunfeng Jiang
Admissible extremal rays and the anticanonical minimal model program
Sung Rak Choi, Sungwook Jang, Dae-Won Lee
Global vector fields and the automorphism group of regular semisimple Hessenberg varieties
Mikiya Masuda, Takashi Sato, Haozhi Zeng
D-equivalence conjecture for hyperkähler varieties of generalized Kummer type
Will Donovan, Chengxi Wang, Nantao Zhang
Seshadri constants of singular loci of line arrangements with at most twelve lines
Marcin Dumnicki, Łucja Farnik, Krishna Hanumanthu et al.