Related papers: Intervals and factors in the Bruhat order
We study the partial orders induced on Wachs and signed Wachs permutations by the Bruhat and weak orders of the symmetric and hyperoctahedral groups. We show that these orders are graded, determine their rank function, characterize their…
The set of all permutations, ordered by pattern containment, forms a poset. This paper presents the first explicit major results on the topology of intervals in this poset. We show that almost all (open) intervals in this poset have a…
This paper provides a unifying and simplifying approach to Bruhat order in which the usual Bruhat order, parabolic Bruhat order, and Bruhat order for symmetric pairs are shown to have combinatorially analogous and relatively simple…
A poset $P = (X,\prec)$ has an interval representation if each $x \in X$ can be assigned a real interval $I_x$ so that $x \prec y$ in $P$ if and only if $I_x$ lies completely to the left of $I_y$. Such orders are called \emph{interval…
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…
We introduce a definition of admissibility for subintervals in interval exchange transformations. Using this notion, we prove a property of the natural codings of interval exchange transformations, namely that any derived set of a regular…
Any permutation in the finite symmetric group can be written as a product of simple transpositions $s_i = (i~i+1)$. For a fixed permutation $\sigma \in \mathfrak{S}_n$ the products of minimal length are called reduced decompositions or…
The relationship between the length of a word and the maximum length of its unbordered factors is investigated in this paper. Consider a finite word w of length n. We call a word bordered, if it has a proper prefix which is also a suffix of…
A string $w$ is called a minimal absent word (MAW) for another string $T$ if $w$ does not occur in $T$ but the proper substrings of $w$ occur in $T$. For example, let $\Sigma = \{\mathtt{a, b, c}\}$ be the alphabet. Then, the set of MAWs…
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…
Bj\"orner and Ekedahl [Ann. of Math. (2), 170.2(2009), pp. 799--817] pioneered the study of length-counting sequences associated with parabolic lower Bruhat intervals in crystallographic Coxeter groups. In this paper, we study the…
We show that the order complex of intervals of a poset, ordered by inclusion, is a Tchebyshev triangulation of the order complex of the original poset. Besides studying the properties of this transformation, we show that the dual of the…
Gauge symmetries lead to first-class constraints. This assertion is of course true only for non trivial gauge symmetries, i.e., gauge symmetries that act non trivially on-shell on the dynamical variables. We illustrate this well-appreciated…
In this paper we consider the rank generating function of a separable permutation $\pi$ in the weak Bruhat order on the two intervals $[\text{id}, \pi]$ and $[\pi, w_0]$, where $w_0 = n,(n-1),..., 1$. We show a surprising result that the…
We study the group of all interval exchange transformations (IETs). We show that for every IET $S$, there exists a dense open set of admissible IETs that share a relation with $S$. This is an extension of a result published by Dahmani,…
A sequence of reversals that takes a signed permutation to the identity is perfect if at no step a common interval is broken. Determining a parsimonious perfect sequence of reversals that sorts a signed permutation is NP-hard. Here we show…
We show that an element $w$ of a finite Weyl group $W$ is rationally smooth if and only if the hyperplane arrangement $I$ associated to the inversion set of $w$ is inductively free, and the product $(d_1+1) \cdots (d_l+1)$ of the…
The set of all permutations, ordered by pattern containment, is a poset. We present an order isomorphism from the poset of permutations with a fixed number of descents to a certain poset of words with subword order. We use this bijection to…
Given a permutation w, we look at the range of how often a simple reflection s_k appears in reduced decompositions of w. We compute the minimum and give a sharp upper bound on the maximum. That bound is in terms of 321- and 3412-patterns in…
Let G be the group preserving a nondegenerate sesquilinear form on a vector space V, and H a symmetric subgroup of G of the type G1 x G2. We explicitly parameterize the H-orbits in the Grassmannian of r-dimensional isotropic subspaces of V…