2018/10/15 by Mahir Bilen Can, Can, Mahir Bilen, Tien Nam Le +1
Mathematics · Computer Science · #Advanced Combinatorial Mathematics #Algebraic Geometry and Number Theory #Coding theory and cryptography
paper · pdf · doi:10.48550/arxiv.1810.06513
We continue our study of the inclusion posets of diagonal SL(n)-orbit closures in a product of two partial flag varieties. We prove that, if the diagonal action is of complexity one, then the poset is isomorphic to one of the 28 posets that we determine explicitly. Furthermore, our computations show that the number of diagonal SL(n)-orbits in any of these posets is at most 10 for any positive integer n. This is in contrast with the complexity 0 case, where, in some cases, the resulting posets attain arbitrary heights.