Related papers: Pattern avoidance and the Bruhat order on involuti…

In their paper \cite{DokosDwyer:Permutat12}, Dokos et al. conjecture that the major index statistic is equidistributed among 1423-avoiding, 2413-avoiding, and 2314-avoiding permutations. In this paper we confirm this conjecture by…

A pattern class is a set of permutations closed under the formation of subpermutations. Such classes can be characterised as those permutations not involving a particular set of forbidden permutations. A simple collection of necessary and…

We introduce ballot matrices, a signed combinatorial structure whose definition naturally follows from the generating function for labeled interval orders. A sign reversing involution on ballot matrices is defined. We show that matrices…

We show that the leading coefficient of the Kazhdan--Lusztig polynomial $P_{x,w}(q)$ known as $\mu(x,w)$ is always either 0 or 1 when $w$ is a Deodhar element of a finite Weyl group. The Deodhar elements have previously been characterized…

The purpose of this article is to initiate a combinatorial study of the Bruhat-Chevalley ordering on certain sets of permutations obtained by omitting the parentheses from their standard cyclic notation. In particular, we show that these…

We show that any smooth permutation $\sigma\in S_n$ is characterized by the set ${\mathbf{C}}(\sigma)$ of transpositions and $3$-cycles in the Bruhat interval $(S_n)_{\leq\sigma}$, and that $\sigma$ is the product (in a certain order) of…

The purpose of this article is to show how the isotropy subgroup of leaf permutations on binary trees can be used to systematically identify tree-informative invariants relevant to models of phylogenetic evolution. In the quartet case, we…

This short paper is concerned with the enumeration of permutations avoiding the following four patterns: $2431$, $4231$, $1432$ and $4132$. Using a bijective construction, we prove that these permutations are counted by the central binomial…

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…

Rothe diagrams are diagrams which track inversions of a permutation. We define six main properties that Rothe diagrams fulfill: the southwest, dot, popping, numbering, step-out avoiding, and empty cell gap rules. We prove that -- given an…

The higher Bruhat orders $\mathcal{B}(n,k)$ were introduced by Manin-Schechtman to study discriminantal hyperplane arrangements and subsequently studied by Ziegler, who connected $\mathcal{B}(n,k)$ to oriented matroids. In this paper, we…

In this article, we investigate the set of $\gamma$-sortable elements, associated with a Coxeter group $W$ and a Coxeter element $\gamma\in W$, under Bruhat order, and we denote this poset by $\mathcal{B}_{\gamma}$. We show that this poset…

Given a permutation pattern p and an equivalence relation on permutations, we study the corresponding equivalence classes all of whose members avoid p. Four relations are studied: Conjugacy, order isomorphism, Knuth-equivalence and toric…

The number of inversion sequences avoiding two patterns $101$ and $102$ is known to be the same as the number of permutations avoiding three patterns $2341$, $2431$, and $3241$. This sequence also counts the number of Schr\"{o}der paths…

The aim of this article is to present a smoothness criterion for Schubert varieties in generalized flag manifolds $G/B$ in terms of patterns in root systems. We generalize Lakshmibai-Sandhya's well-known result that says that a Schubert…

In the set of all patterns in $S_n$, it is clear that each k-pattern occurs equally often. If we instead restrict to the class of permutations avoiding a specific pattern, the situation quickly becomes more interesting. Mikl\'os B\'ona…

In a quaternion order of class number one, an element can be factored in multiple ways depending on the order of the factorization of its reduced norm. The fact that multiplication is not commutative causes an element to induce a…

Permutations that avoid given patterns are among the most classical objects in combinatorics and have strong connections to many fields of mathematics, computer science and biology. In this paper we study the scaling limits of a random…

A word $w=w_1w_2\cdots w_n$ is alternating if either $w_1<w_2>w_3<w_4>\cdots$ (when the word is up-down) or $w_1>w_2<w_3>w_4<\cdots$ (when the word is down-up). The study of alternating words avoiding classical permutation patterns was…

We investigate permutations in terms of their cycle structure and descent set. To do this, we generalize the classical bijection of Gessel and Reutenauer to deal with permutations that have some ascending and some descending blocks. We then…