AbstractThe structure of order ideals in the Bruhat order for the symmetric group is elucidated via permutation patterns. 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 patterns is an order ideal, and the rank generating functions of these ideals are computed. Finally, the Bruhat order in types B and D is studied, and the elements with boolean principal order ideals are characterized and enumerated by length
Abstract. The purpose of this work is to initiate a combinatorial study of the Bruhat-Chevalley orde...
AbstractLet W be a finite Coxeter group. For a given w∈W, the following assertion may or may not be ...
AbstractIt is shown that the Bruhat partial order on permutations is equivalent to a certain natural...
AbstractThe structure of order ideals in the Bruhat order for the symmetric group is elucidated via ...
We show that the principal order ideal below an element w in the Bruhat order on involutions in a sy...
We prove that the grades of simple modules indexed by boolean permutations, over the incidence algeb...
AbstractFor any permutation v, we show that the special matchings of v generate a Coxeter system. Th...
For any permutation v, we show that the special matchings of v generate a Coxeter system. This gives...
Thesis (Ph.D.)--University of Washington, 2022Fubini words are generalized permutations, allowing fo...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2006.Includes bibliogr...
We extend the concept of pattern avoidance in permutations on a totally ordered set to pattern avoid...
Define a partial order ≤B on the symmetric group Sn as follows: given pi, σ ∈ Sn, we say pi ≤B σ if ...
This thesis is concerned with problems involving permutations. The main focus is on connections betw...
The weak and strong Bruhat orders are classical and rich combinatorial objects, with connections to ...
We study the poset structure on row-convex permutominides induced by the Bruhat order on permutation...
Abstract. The purpose of this work is to initiate a combinatorial study of the Bruhat-Chevalley orde...
AbstractLet W be a finite Coxeter group. For a given w∈W, the following assertion may or may not be ...
AbstractIt is shown that the Bruhat partial order on permutations is equivalent to a certain natural...
AbstractThe structure of order ideals in the Bruhat order for the symmetric group is elucidated via ...
We show that the principal order ideal below an element w in the Bruhat order on involutions in a sy...
We prove that the grades of simple modules indexed by boolean permutations, over the incidence algeb...
AbstractFor any permutation v, we show that the special matchings of v generate a Coxeter system. Th...
For any permutation v, we show that the special matchings of v generate a Coxeter system. This gives...
Thesis (Ph.D.)--University of Washington, 2022Fubini words are generalized permutations, allowing fo...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2006.Includes bibliogr...
We extend the concept of pattern avoidance in permutations on a totally ordered set to pattern avoid...
Define a partial order ≤B on the symmetric group Sn as follows: given pi, σ ∈ Sn, we say pi ≤B σ if ...
This thesis is concerned with problems involving permutations. The main focus is on connections betw...
The weak and strong Bruhat orders are classical and rich combinatorial objects, with connections to ...
We study the poset structure on row-convex permutominides induced by the Bruhat order on permutation...
Abstract. The purpose of this work is to initiate a combinatorial study of the Bruhat-Chevalley orde...
AbstractLet W be a finite Coxeter group. For a given w∈W, the following assertion may or may not be ...
AbstractIt is shown that the Bruhat partial order on permutations is equivalent to a certain natural...