We show that $w\in W$ is boolean if and only if it avoids a set of Billey-Postnikov patterns, which we describe explicitly. Our proof is based on an analysis of inversion sets, and it is in large part type-uniform. We also introduce the notion of linear pattern avoidance, and show that boolean elements are characterized by avoiding just the $3$ linear patterns $s_1 s_2 s_1 \in W(A_2)$, $s_2 s_1 s_3 s_2 \in W(A_3)$, and $s_2 s_1 s_3 s_4 s_2 \in W(D_4)$. We also consider the more general case of $k$-boolean Weyl group elements. We say that $w\in W$ is $k$-boolean if every reduced expression for $w$ contains at most $k$ copies of each generator. We show that the $2$-boolean elements of the symmetric group $S_n$ are characterized by avoiding the patterns $3421,4312,4321,$ and $456123$, and give a rational generating function for the number of $2$-boolean elements of $S_n$.
Motivated by recent work with Mazorchuk, we characterize the conditions under which the intersection of two principal order ideals in the Bruhat order is boolean. That characterization is presented in three versions: in terms of reduced words, in terms of permutation patterns, and in terms of permutation support. The equivalence of these properties follows from an analysis of what it means to have a specific letter repeated in a permutation's reduced words; namely, that a specific 321-pattern appears.
The structure of order ideals in the Bruhat order for the symmetric group is elucidated via permutation patterns. A method for determining non-isomorphic principal order ideals is described and applied for small lengths. The permutations with boolean principal order ideals are characterized. These form an order ideal which is a simplicial poset, and its rank generating function is computed. Moreover, the permutations whose principal order ideals have a form related to boolean posets are also completely described. It is determined when the set of permutations avoiding a particular set of patter…
In this note we construct a poset map from a Boolean algebra to the Bruhat order which unveils an interesting connection between subword complexes, sorting orders, and certain totally nonnegative spaces. This relationship gives a new proof of Björner and Wachs' result \cite{BW} that the proper part of Bruhat order is homotopy equivalent to the proper part of a Boolean algebra --- that is, to a sphere. We also obtain a geometric interpretation for sorting orders. We conclude with two new results: that the intersection of all sorting orders is the weak order, and the union of sorting orders is t…
We show that the principal order ideal below an element w in the Bruhat order on involutions in a symmetric group is a Boolean lattice if and only if w avoids the patterns 4321, 45312 and 456123. Similar criteria for signed permutations are also stated. Involutions with this property are enumerated with respect to natural statistics. In this context, a bijective correspondence with certain Motzkin paths is demonstrated.
We give a criterion for Bruhat order on noncrossing partitions corresponding to the Coxeter element $c=s_1 s_2\cdots s_n$. Using it we prove that the Bruhat order endows noncrossing partitions with a lattice structure. We then explain what happens if we change the Coxeter element; in that case the lattice property fails and we explain which order to consider to get the same lattice structure as for the Coxeter element $c$. In particular we get bijections between noncrossing partitions associated to distinct Coxeter elements, which fix the set of reflections.
We prove that the restriction of Bruhat order to noncrossing partitions in type $A_n$ for the Coxeter element $c=s_1s_2 ...s_n$ forms a distributive lattice isomorphic to the order ideals of the root poset ordered by inclusion. Motivated by the change-of-basis from the graphical basis of the Temperley-Lieb algebra to the image of the simple elements of the dual braid monoid, we extend this bijection to other Coxeter elements using certain canonical factorizations. In particular, we give new bijections---fixing the set of reflections---between noncrossing partitions associated to distinct Coxet…
We prove that the grades of simple modules indexed by boolean permutations, over the incidence algebra of the symmetric group with respect to the Bruhat order, are given by Lusztig's a-function. Our arguments are combinatorial, and include a description of the intersection of two principal order ideals when at least one permutation is boolean. An important object in our work is a reduced word written as minimally many runs of consecutive integers, and one step of our argument shows that this minimal quantity is equal to the length of the second row in the permutation's shape under the Robinson…
In theory of Coxeter groups, bigrassmannian elements are well known as elements which have precisely one left descent and precisely one right descent. In this article, we prove formulas on enumeration of bigrassmannian permutations weakly below a permutation in Bruhat order in the symmetric groups. For the proof, we use equivalent characterizations of bigrassmannian permutations by Lascoux-Schutzenberger and Reading.
We study the appearance of notable interval structures -- lattices, modular lattices, distributive lattices, and boolean lattices -- in both the Bruhat and weak orders of Coxeter groups. We collect and expand upon known results for principal order ideals, including pattern characterizations and enumerations for the symmetric group. This segues naturally into a similar analysis for arbitrary intervals, although the results are less characterizing for the Bruhat order at this generality. In counterpoint, however, we obtain a full characterization for intervals starting at rank one in the symmetr…
A permutation is called smooth if the corresponding Schubert variety is smooth. Gilboa and Lapid prove that in the symmetric group, multiplying the reflections below a smooth element $w$ in Bruhat order in a compatible order yields back the element $w$. We strengthen this result by showing that such a product in fact determines a saturated chain $e \to w$ in Bruhat order, and that this property characterizes smooth elements.
In [Journal of Pure and Applied Algebra {224} (2020), no 12, 106449], V. Mazorchuk and R. Mrđen (with some help by A. Hultman) prove that, given a Weyl group, the intersection of a Bruhat interval with a parabolic coset has a unique maximal element and a unique minimal element. We show that such intersections are actually Bruhat intervals also in the case of an arbitrary Coxeter group.
In this paper, we extend Manin and Schechtman's higher Bruhat orders for the symmetric group to higher Bruhat orders for non-longest words $w$ in $S_n$. We prove that the higher Bruhat orders of non-longest words are ranked posets with unique minimal and maximal elements. As in Manin and Schechtman's original paper, the $k$-th Bruhat order for $w$ is created out of equivalence classes of maximal chains in its $(k-1)$-st Bruhat order. We also define the second and third Bruhat orders for arbitrary realizable k-sets, and prove that the second Bruhat order has a unique minimal and maximal element…
Beijing International Center for Mathematical Research, Peking University（北京大学北京国际数学研究中心）；Institute for Theoretical Sciences, Westlake University（西湖大学理论科学研究所）
In this paper, we study the decomposition of Bruhat intervals in a Coxeter group with respect to cosets of a parabolic subgroup. Our main result is that the intersection of a lower Bruhat interval with a parabolic coset contains a unique maximal element. As an application, we give a decomposition formula for the Poincaré polynomial of a Coxeter group element. We also show that the fibers of standard parabolic projection maps on Schubert varieties are themselves Schubert varieties.
In this article, we investigate the set of $γ$-sortable elements, associated with a Coxeter group $W$ and a Coxeter element $γ\in W$, under Bruhat order, and we denote this poset by $\mathcal{B}_γ$. We show that this poset belongs to the class of SB-lattices recently introduced by Hersh and Mészáros, by proving a more general statement, namely that all join-distributive lattices are SB-lattices. The observation that $\mathcal{B}_γ$ is join-distributive is due to Armstrong. Subsequently, we investigate for which finite Coxeter groups $W$ and which Coxeter elements $γ\in W$ the lattice $\mathcal…
We study the Ricci curvature of the Hasse diagrams of the Bruhat order of finite irreducible Coxeter groups. For this purpose we compute the maximum degree of these graphs for types $B_n$ and $D_n$. The proof uses a new graph $Γ(π)$ defined for any element $π$ in the corresponding group.
An element $w$ of the Weyl group is called rationally smooth if the corresponding Schubert variety is rationally smooth. This happens exactly when the lower interval $[id,w]$ in the Bruhat order is palindromic. For each element $w$ of the Weyl group, we construct a certain hyperplane arrangement. After analyzing the palindromic intervals inside the maximal quotients, we use this result to show that the generating function for regions of the arrangement coincides with the Poincaré polynomial of the corresponding Schubert variety if and only if the Schubert variety is rationally smooth.
We show that for the simple random walk on a Coxeter group generated by the Coxeter generators and identity, the likelihoods of being at any pair of states respect the weak Bruhat order. That is, after any number of steps, the most likely element is the identity, probabilities decrease along any geodesic from the identity, and the least likely element is the longest element, if the group is finite. The result remains true when different generators have different probabilities, so long as the identity is at least as likely as any other.
The rook monoid $R_n$ is the finite monoid whose elements are the 0-1 matrices with at most one nonzero entry in each row and column. The group of invertible elements of $R_n$ is isomorphic to the symmetric group $S_n$. The natural extension to $R_n$ of the Bruhat-Chevalley ordering on the symmetric group is defined in \cite{Renner86}. In this paper, we find an efficient, combinatorial description of the Bruhat-Chevalley ordering on $R_n$. We also give a useful, combinatorial formula for the length function on $R_n$.
We classify cocovers and covers of a given element of the double affine Weyl semigroup W with respect to the Bruhat order, specifically when W is associated to a finite root system that is irreducible and simply laced. We show two approaches: one extending the work of Lam and Shimozono, and its strengthening by Milicevic, where cocovers are characterized in the affine case using the quantum Bruhat graph of the finite Weyl group, and another, which takes a more geometrical approach by using the length difference set defined by Muthiah and Orr.
The Casselman basis of Iwahori fixed vectors in a principal series representation of a p-adic group G is dual to the standard intertwining operators. To compute it one must compute a matrix m(u,v) indexed by pairs of Weyl group elements. This matrix is upper triangular with respect to the Bruhat order. In general this matrix is difficult to compute but it is shown that certain elements have a nice expression. This is also true of the inverse matrix to m(u,v). This leads to interesting conjectures regarding the Bruhat order.
In this paper we study those generic intervals in the Bruhat order of the symmetric group that are isomorphic to the principal order ideal of a permutation w, and consider when the minimum and maximum elements of those intervals are related by a certain property of their reduced words. We show that the property does not hold when w is a decomposable permutation, and that the property always holds when w is the longest permutation.
We introduce and study a family of operators which act in the span of a Weyl group $W$ and provide a multi-parameter solution to the quantum Yang-Baxter equations of the corresponding type. Our operators generalize the "quantum Bruhat operators" that appear in the explicit description of the multiplicative structure of the (small) quantum cohomology ring of $G/B$. The main combinatorial applications concern the "tilted Bruhat order," a graded poset whose unique minimal element is an arbitrarily chosen element $w\in W$. (The ordinary Bruhat order corresponds to the case $w=1$.) Using the mixed …
The higher Bruhat order is a poset of cubical tilings of a cyclic zonotope whose covering relations are cubical flips. For a 2-dimensional zonotope, the higher Bruhat order is isomorphic to a poset on commutation classes of reduced words for the longest element of a type A Coxeter system. For this case, we prove that the noncontractible intervals are in natural correspondence with the zonogonal tilings of a zonogon. Our proof uses some tools developed by Felsner and Weil to show that the two standard orderings on the rhombic tilings of a zonogon are identical.
In any Coxeter group, the set of elements whose principal order ideals are boolean forms a simplicial poset under the Bruhat order. This simplicial poset defines a cell complex, called the boolean complex. In this paper it is shown that, for any Coxeter system of rank n, the boolean complex is homotopy equivalent to a wedge of (n-1)-dimensional spheres. The number of such spheres can be computed recursively from the unlabeled Coxeter graph, and defines a new graph invariant called the boolean number. Specific calculations of the boolean number are given for all finite and affine irreducible Co…
Let $W$ be a finite reflection group. For a given $w \in W$, the following assertion may or may not be satisfied: (*) The principal Bruhat order ideal of $w$ contains as many elements as there are regions in the inversion hyperplane arrangement of $w$. We present a type independent combinatorial criterion which characterises the elements $w\in W$ that satisfy (*). A couple of immediate consequences are derived: (1) The criterion only involves the order ideal of $w$ as an abstract poset. In this sense, (*) is a poset-theoretic property. (2) For $W$ of type $A$, another characterisation of (*), …
Let (W, S) be a Coxeter system. We investigate combinatorially certain partial orders, called extended Bruhat orders, on a (W x W)-set W(N,C), which depends on W, a subset N of S, and a component C of N. We determine the length of the maximal chains between two elements. These posets generalize W equipped with its Bruhat order. They include the (W x W)-orbits of the Renner monoids of reductive algebraic monoids and of some infinite dimensional generalizations which are equipped with the partial orders obtained by the closure relations of the Bruhat and Birkhoff cells. They also include the (W …
In this paper we introduce abstract string modules and give an explicit bijection between the submodule lattice of an abstract string module and the perfect matching lattice of the corresponding abstract snake graph. In particular, we make explicit the direct correspondence between a submodule of a string module and the perfect matching of the corresponding snake graph. For every string module, we define a Coxeter element in a symmetric group, and we establish a bijection between these lattices and the interval in the weak Bruhat order determined by the Coxeter element. Using the correspondenc…
When $G$ is a complex reductive algebraic group, MV polytopes are in bijection with the non-negative tropical points of the unipotent group of $G$. By fixing $w$ from the Weyl group, we can define MV polytopes whose highest vertex is labelled by $w$. We show that these polytopes are in bijection with the non-negative tropical points of the reduced double Bruhat cell labelled by $w^{-1}$. To do this, we define a collection of generalized minor functions $Δ_γ^\text{new}$ which tropicalize on the reduced Bruhat cell to the BZ data of an MV polytope of highest vertex $w$. We also describe the comb…
The (directed) Bruhat graph $\hatΓ(u,v)$ has the elements of the Bruhat interval $[u,v]$ as vertices, with directed edges given by multiplication by a reflection. Famously, $\hatΓ(e,v)$ is regular if and only if the Schubert variety $X_v$ is smooth, and this condition on $v$ is characterized by pattern avoidance. In this work, we classify when the undirected Bruhat graph $Γ(e,v)$ is vertex-transitive; surprisingly this class of permutations is also characterized by pattern avoidance and sits nicely between the classes of smooth permutations and self-dual permutations. This leads us to a genera…
To any saturated chain in the affine Weyl group whose translation parts are sufficiently regular, we associate a near path and a far path in the quantum Bruhat graph. Using this, working in the Bruhat order on the minimal-length representatives of the cosets in the affine Weyl group with respect to the finite Weyl group, we characterize the pairs of elements for which the Möbius function is nonzero. This is applied to obtain explicit expansions in the $K$-theory of affine Grassmannians, of the basis of ideal sheaves into the basis of structure sheaves of Schubert varieties.
We prove the conjecture of A. Postnikov that (A) the number of regions in the inversion hyperplane arrangement associated with a permutation $w\in \Sn$ is at most the number of elements below $w$ in the Bruhat order, and (B) that equality holds if and only if $w$ avoids the patterns 4231, 35142, 42513 and 351624. Furthermore, assertion (A) is extended to all finite reflection groups. A byproduct of this result and its proof is a set of inequalities relating Betti numbers of complexified inversion arrangements to Betti numbers of closed Schubert cells. Another consequence is a simple combinator…
We characterise the permutations pi such that the elements in the closed lower Bruhat interval [id,pi] of the symmetric group correspond to non-taking rook configurations on a skew Ferrers board. It turns out that these are exactly the permutations pi such that [id,pi] corresponds to a flag manifold defined by inclusions, studied by Gasharov and Reiner. Our characterisation connects the Poincare polynomials (rank-generating function) of Bruhat intervals with q-rook polynomials, and we are able to compute the Poincare polynomial of some particularly interesting intervals in the finite Weyl grou…
We give closed combinatorial product formulas for Kazhdan-Lusztig poynomials and their parabolic analogue of type q in the case of boolean elements, introduced in [M. Marietti, Boolean elements in Kazhdan-Lusztig theory, J. Algebra 295 (2006)], in Coxeter groups whose Coxeter graph is a tree.
Let $(π_{\mathbf{z}},V_{\mathbf{z}})$ be an unramified principal series representation of a reductive group over a nonarchimedean local field, parametrized by an element $\mathbf{z}$ of the maximal torus in the Langlands dual group. If $v$ is an element of the Weyl group $W$, then the standard intertwining integral $\mathcal{A}_v$ maps $V_{\mathbf{z}}$ to $V_{v\mathbf{z}}$. Letting $ψ^{\mathbf{z}}_w$ with $w\in W$ be a suitable basis of the Iwahori fixed vectors in $V_{\mathbf{z}}$, and $\widehatψ^{\mathbf{z}}_w$ a basis of the contragredient representation, we define $σ(u,v,w)$ (for $u,v,w\in…
Westwood High School（韦斯特伍德高中）；Cranbrook Kingswood Upper School（克兰布鲁克金伍兹高中部）；Oklahoma State University（俄克拉荷马州立大学）；Texas State University（德克萨斯州立大学）；West Windsor-Plainsboro High School North（西温莎-普莱恩斯伯勒北高中）；Seven Lakes High School（七湖高中）
We construct a family of integrable Hamiltonian systems generalizing the relativistic periodic Toda lattice, which is recovered as a special case. The phase spaces of these systems are double Bruhat cells corresponding to pairs of Coxeter elements in the affine Weyl group. In the process we extend various results on double Bruhat cells in simple algebraic groups to the setting of Kac-Moody groups. We also generalize some fundamental results in Poisson-Lie theory to the setting of ind-algebraic groups, which is of interest beyond our immediate applications to integrable systems.
Hultman, Linusson, Shareshian, and Sjöstrand gave a pattern avoidance characterization of the permutations for which the number of chambers of its associated inversion arrangement is the same as the size of its lower interval in Bruhat order. Hultman later gave a characterization, valid for an arbitrary finite reflection group, in terms of distances in the Bruhat graph. On the other hand, the pattern avoidance criterion for permutations had earlier appeared in independent work of Sjöstrand and of Gasharov and Reiner. We give characterizations of the elements of the hyperoctahedral groups satis…
Let G be a finite Chevalley group and B a Borel subgroup. Then the interval [B,G] in L(G) is Boolean. We prove, using Zsigmondy's theorem, that for any element P in the open interval (B,G), its lattice-complement P^c is not a group-complement.
Björner-Ekedahl prove that general intervals $[e,w]$ in Bruhat order are "top-heavy", with at least as many elements in the $i$-th corank as the $i$-th rank. Well-known results of Carrell and of Lakshmibai-Sandhya give the equality case: $[e,w]$ is rank-symmetric if and only if the permutation $w$ avoids the patterns $3412$ and $4231$ and these are exactly those $w$ such that the Schubert variety $X_w$ is smooth. In this paper we study the finer structure of rank-symmetric intervals $[e,w]$, beyond their rank functions. In particular, we show that these intervals are still "top-heavy" if one c…
Motivated by the geometry of certain hyperplane arrangements, Manin and Schechtman defined for each positive integer n 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). Elias has demonstrated a striking connection between the posets B(n, k) for k = 2 and the diagrammatics of B…
Let u and v be permutations on n letters, with u <= v in Bruhat order. A Bruhat interval polytope 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 and longest elements of the symmetric group, Q_{e,w_0} is the classical permutohedron. Bruhat interval polytopes were studied recently by Kodama and the second author, in the context of the Toda lattice and the moment map on the flag variety. In this paper we study combinatorial aspects of Bruhat interval polytopes. For example, we give an inequality descr…
We make explict a description in terms of convex geometry of the higher Bruhat orders B(n,d) sketched by Kapranov and Voevodsky. We give an analogous description of the higher Stasheff-Tamari poset S_1(n,d). We show that the map f sketched by Kapranov and Voevodsky from B(n,d) to S([0,n+1],d+1) coincides with the map constructed by Rambau, and is a surjection for d<=2. We construct a map analogous to f from S_1(n,d) to B(n-1,d), and show that it is always a poset embedding. We also give an explicit criterion to determine if an element of B(n-1,d) is in the image of this map.
The classical Ehresmann-Bruhat order describes the possible degenerations of a pair of flags in a finite-dimensional vector space V; or, equivalently, the closure of an orbit of the group GL(V) acting on the direct product of two full flag varieties. We obtain a similar result for triples consisting of two subspaces and a partial flag in V; this is equivalent to describing the closure of a GL(V)-orbit in the product of two Grassmannians and one flag variety. We give a rank criterion to check whether such a triple can be degenerated to another one, and we classify the minimal degenerations. Our…
Let $(W,S)$ be an arbitrary Coxeter system. For each word $ω$ in the generators we define a partial order--called the {\sf $ω$-sorting order}--on the set of group elements $W_ω\subseteq W$ that occur as subwords of $ω$. We show that the $ω$-sorting order is a supersolvable join-distributive lattice and that it is strictly between the weak and Bruhat orders on the group. Moreover, the $ω$-sorting order is a "maximal lattice" in the sense that the addition of any collection of Bruhat covers results in a nonlattice. Along the way we define a class of structures called {\sf supersolvable antimatro…
Let $G$ be a reductive algebraic group and let $Z$ be the stabilizer of a nilpotent element $e$ of the Lie algebra of $G$. We consider the action of $Z$ on the flag variety of $G$, and we focus on the case where this action has a finite number of orbits (i.e., $Z$ is a spherical subgroup). This holds for instance if $e$ has height $2$. In this case we give a parametrization of the $Z$-orbits and we show that each $Z$-orbit has a structure of algebraic affine bundle. In particular, in type $A$, we deduce that each orbit has a natural cell decomposition. In the aim to study the (strong) Bruhat o…
The classical Ehresmann-Bruhat order describes the possible degenerations of a pair of flags in a linear space V under linear transformations of V; or equivalently, it describes the closure of an orbit of GL(V) acting diagonally on the product of two flag varieties. We consider the degenerations of a triple consisting of two flags and a line, or equivalently the closure of an orbit of GL(V) acting diagonally on the product of two flag varieties and a projective space. We give a simple rank criterion to decide whether one triple can degenerate to another. We also classify the minimal degenerati…
