Related papers: Boolean intersection ideals of permutations in the…
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…
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…
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…
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…
The boolean elements of a Coxeter group have been characterized and shown to possess many interesting properties and applications. Here we introduce "prism permutations," a generalization of those elements, characterizing the prism…
The poset of permutations of [n] under Bruhat ordering is studied. We give nontrivial upper and lower bounds for the number of comparable pairs of permutations in both the weak and strong versions of this order. In light of numerical…
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…
The (strong) Bruhat order for permutations provides a partial ordering defined as follows: two permutations are comparable if one can be obtained from the other by a sequence of adjacent transpositions that each increase the number of…
In this article, we study the metacommutation problem in locally Eichler orders. From this arises a permutation of the set of locally principal left ideals of a given prime reduced norm. Previous results on the cycle structure were…
Among reduced Noetherian prime characteristic commutative rings, we prove that a regular ring is precisely one where finite intersection of ideals commutes with taking bracket powers. However, reducedness is essential for this equivalence.…
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…
We define a partial order $\mathcal{P}_n$ on permutations of any given size $n$, which is the image of a natural partial order on inversion sequences. We call this the ``middle order''. We demonstrate that the poset $\mathcal{P}_n$ refines…
The Bruhat order on a Coxeter group is often described by examining subexpressions of a reduced expression. We prove that an analogous description applies to the Bruhat order on double cosets. This establishes the compatibility of the…
We characterize monomial ideals which are intersections of monomial prime ideals and study classes of ideals with this property, among them polymatroidal ideals.
The higher Bruhat orders are partial orders that generalize the weak order on the symmetric group $S_n$, and the second higher Bruhat order is a poset on commutation classes of reduced words for the longest element in $S_n$, where covering…
Let $\mathfrak{S}_n$ and $\mathfrak{B}_n$ denote the respective sets of ordinary and bigrassmannian (BG) permutations of order $n$, and let $(\mathfrak{S}_n,\leq)$ denote the Bruhat ordering permutation poset. We study the restricted poset…
An occurrence of a classical pattern p in a permutation \pi is a subsequence of \pi whose letters are in the same relative order (of size) as those in p. In an occurrence of a generalized pattern, some letters of that subsequence may be…
The goal of this short note is to prove that when $A$ is a closed *-subalgebra of a C*-algebra $B$ satisfying the ideal intersection property plus a mild axiom (INV), then the map $J\mapsto J\cap A$ establishes an isomorphism from the…
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…
For certain weak versions of the Axiom of Choice (most notably, the Boolean Prime Ideal theorem), we obtain equivalent formulations in terms of partial orders, and filter-like objects within them intersecting certain dense sets or…