Boolean elements in the Bruhat order

arXiv2007.08490MaRDI QIDQ6345247FDOQ6345247

Authors: Yi-Bo Gao, Kaarel Hänni 

Publication date: 16 July 2020

Abstract: We show that $winW$ 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}inW(A_2)$, $s_2{s}_1{s}_3{s}_{2}inW(A_3)$, and $s_2{s}_1{s}_3{s}_4{s}_{2}inW(D_4)$. We also consider the more general case of $k$-boolean Weyl group elements. We say that $winW$ 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$.

Mathematics Subject Classification ID

Combinatorial aspects of groups and algebras (05E16)

This page was built for publication: Boolean elements in the Bruhat order

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6345247)