scholarly journals Higher Bruhat Orders in Type B

10.37236/5620 ◽  
2016 ◽  
Vol 23 (3) ◽  
Author(s):  
Seth Shelley-Abrahamson ◽  
Suhas Vijaykumar

Motivated by the geometry of hyperplane arrangements, Manin and Schechtman defined for each integer $n \geq 1$ a hierarchy of finite partially ordered sets $B(n, k),$ indexed by positive integers $k$, called the higher Bruhat orders.  The poset $B(n, 1)$ is naturally identified with the weak left Bruhat order on the symmetric group $S_n$, each $B(n, k)$ has a unique maximal and a unique minimal element, and the poset $B(n, k + 1)$ can be constructed from the set of maximal chains in $B(n, k)$.  Ben Elias has demonstrated a striking connection between the posets $B(n, k)$ for $k = 2$ and the diagrammatics of Bott-Samelson bimodules in type A, providing significant motivation for the development of an analogous theory of higher Bruhat orders in other Cartan-Killing types, particularly for $k = 2$.  In this paper we present a partial generalization to type B, complete up to $k = 2$, prove a direct analogue of the main theorem of Manin and Schechtman, and relate our construction to the weak Bruhat order and reduced expression graph for Weyl group $B_n$.

2015 ◽  
Vol DMTCS Proceedings, 27th... (Proceedings) ◽  
Author(s):  
Soojin Cho ◽  
Kyoungsuk Park

International audience Alignments, crossings and inversions of signed permutations are realized in the corresponding permutation tableaux of type $B$, and the cycles of signed permutations are understood in the corresponding bare tableaux of type $B$. We find the relation between the number of alignments, crossings and other statistics of signed permutations, and also characterize the covering relation in weak Bruhat order on Coxeter system of type $B$ in terms of permutation tableaux of type $B$. De nombreuses statistiques importantes des permutations signées sont réalisées dans les tableaux de permutations ou ”bare” tableaux de type $B$ correspondants : les alignements, croisements et inversions des permutations signées sont réalisés dans les tableaux de permutations de type $B$ correspondants, et les cycles des permutations signées sont comprises dans les ”bare” tableaux de type $B$ correspondants. Cela nous mène à relier le nombre d’alignements et de croisements avec d’autres statistiques des permutations signées, et aussi de caractériser la relation de couverture dans l’ordre de Bruhat faible sur des systèmes de Coxeter de type $B$ en termes de tableaux de permutations de type $B$.


10.37236/1459 ◽  
1999 ◽  
Vol 6 (1) ◽  
Author(s):  
Patricia Hersh

A symmetric group action on the maximal chains in a finite, ranked poset is local if the adjacent transpositions act in such a way that $(i,i+1)$ sends each maximal chain either to itself or to one differing only at rank $i$. We prove that when $S_n$ acts locally on a lattice, each orbit considered as a subposet is a product of chains. We also show that all posets with local actions induced by labellings known as $R^* S$-labellings have symmetric chain decompositions and provide $R^* S$-labellings for the type B and D noncrossing partition lattices, answering a question of Stanley.


1991 ◽  
Vol 44 (1) ◽  
pp. 91-103 ◽  
Author(s):  
D. Duffus ◽  
V. Rodl ◽  
N. Sauer ◽  
R. Woodrow

AbstractThis paper is devoted to settling the following problem on (infinite, partially) ordered sets: Is there always a partition (2-coloring) of an ordered set X so that all nontrivial maximal chains of X meet both classes (receive both colors)? We show this is true for all countable ordered sets and provide counterexamples of cardinality N3. Variants of the problem are also considered and open problems specified.


10.37236/1554 ◽  
2000 ◽  
Vol 8 (1) ◽  
Author(s):  
Stefan Felsner

Stanley conjectured that the number of maximal chains in the weak Bruhat order of $S_n$, or equivalently the number of reduced decompositions of the reverse of the identity permutation $ w_0 = n,n-1,n-2,\ldots,2,1$, equals the number of standard Young tableaux of staircase shape $s=\{n-1,n-2,\ldots,1\}$. Originating from this conjecture remarkable connections between standard Young tableaux and reduced words have been discovered. Stanley proved his conjecture algebraically, later Edelman and Greene found a bijective proof. We provide an extension of the Edelman and Greene bijection to a larger class of words. This extension is similar to the extension of the Robinson-Schensted correspondence to two line arrays. Our proof is inspired by Viennot's planarized proof of the Robinson-Schensted correspondence. As it is the case with the classical correspondence the planarized proofs have their own beauty and simplicity.


2018 ◽  
Vol 60 (3) ◽  
pp. 578-598
Author(s):  
Yu. L. Ershov ◽  
M. V. Schwidefsky

Sign in / Sign up

Export Citation Format

Share Document