Bruhat interval polytopes
Let $u$ and $v$ be permutations on $n$ letters, with $u$ ≤ $v$ in Bruhat order. A <i>Bruhat interval polytope</i> $Q_{u,v}$ is the convex hull of all permutation vectors $z=(z(1),z(2),...,z(n))$ with $u$ ≤ $z$ ≤ $v$. Note that when $u=e$ and $v=w_0$ are the shortest...
Main Authors: | Emmanuel Tsukerman, Lauren Williams |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2015-01-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/2507/pdf |
Similar Items
-
Intervals and factors in the Bruhat order
by: Bridget Eileen Tenner
Published: (2015-06-01) -
The Bruhat order on conjugation-invariant sets of involutions in the symmetric group
by: Mikael Hansson
Published: (2015-01-01) -
On the number of factors in codings of three interval exchange
by: Petr Ambrož, et al.
Published: (2011-11-01) -
The Cerný conjecture for automata respecting intervals of a directed graph
by: Mariusz Grech, et al.
Published: (2013-11-01) -
From Bruhat intervals to intersection lattices and a conjecture of Postnikov
by: Axel Hultman, et al.
Published: (2008-01-01)