Related papers: Enumeration of bigrassmannian permutations below a…

We study permutations on n elements preserving orientation (parity) of every subset of size k. We describe all groups of these permutations. Unexpectedly, these groups (except for some special cases) are either trivial, cyclic or dihedral.…

We show that the order dimension of the weak order on a Coxeter group of type A, B or D is equal to the rank of the Coxeter group, and give bounds on the order dimensions for the other finite types. This result arises from a unified…

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…

Recall that a Stirling permutation is a permutation on the multiset $\{1,1,2,2,\ldots,n,n\}$ such that any numbers appearing between repeated values of $i$ must be greater than $i$. We call a Stirling permutation ``flattened'' if the…

Reifegerste and independently, Petersen and Tenner studied a statistic $\mathrm{drops}()$ on permutations in $\mathfrak{S}_n$. Two other studied statistics on $\mathfrak{S}_n$ are $\mathrm{depth}$ and $\mathrm{exc}$. Using descents in ${\it…

We introduce two order relations on finite Coxeter groups which refine the absolute and the Bruhat order, and establish some of their main properties. In particular we study the restriction of these orders to noncrossing partitions and show…

We present a simplified variant of Biane's bijection between permutations and 3-colored Motzkin paths with weight that keeps track of the inversion number, excedance number and a statistic so-called depth of a permutation. This generalizes…

Elizalde (2011) characterized which permutations can be obtained by ordering consecutive elements in the trajectories of (positive) beta-transformations and beta-shifts. We prove similar results for negative bases beta.

In this article, we investigate the existence of joins in the weak order of an infinite Coxeter group W. We give a geometric characterization of the existence of a join for a subset X in W in terms of the inversion sets of its elements and…

We present a finite algorithm for computing the set of irreducible unitary representations of a real reductive group G. The Langlands classification, as formulated by Knapp and Zuckerman, exhibits any representation with an invariant…

We study two related probabilistic models of permutations and trees biased by their number of descents. Here, a descent in a permutation $\sigma$ is a pair of consecutive elements $\sigma(i), \sigma(i+1)$ such that $\sigma(i) >…

A permutation is called {\it {block-wise simple}} if it contains no interval of the form $p_1\oplus p_2$ or $p_1 \ominus p_2$. We present this new set of permutations and explore some of its combinatorial properties. We present a generating…

In this paper we introduce {\em weak ascent sequences}, a class of number sequences that properly contains ascent sequences. We show how these sequences uniquely encode each of the following objects: permutations avoiding a particular…

In this paper, we introduce a weakening of the Freiman isomorphisms between subsets of non necessarily abelian groups. Inspired by the breakthrough result of Kravitz, [14], on cyclic groups, as a first application, we prove that any subset…

In this paper we consider arbitrary intervals in the left weak order on the symmetric group $S_n$. We show that the Lehmer codes of permutations in an interval form a distributive lattice under the product order. Furthermore, the…

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…

Theorems relating permutations with objects in other fields of mathematics are often stated in terms of avoided patterns. Examples include various classes of Schubert varieties from algebraic geometry (Billey and Abe 2013), commuting…

Let $(W,S)$ be a Coxeter system of type $A$, so that $W$ can be identified with the symmetric group $\mathrm{Sym}(n)$ for some positive integer $n$ and $S$ with the set of simple transpositions $\{\,(i,i+1)\mid 1\leqslant i\leqslant…

A base for a permutation group $G$ acting on a set $\Omega$ is a sequence $\mathcal{B}$ of points of $\Omega$ such that the pointwise stabiliser $G_{\mathcal{B}}$ is trivial. The base size of $G$ is the size of a smallest base for $G$.…

Let $s$ denote West's stack-sorting map. A permutation is called $t-\textit{sorted}$ if it is of the form $s^t(\mu)$ for some permutation $\mu$. We prove that the maximum number of descents that a $t$-sorted permutation of length $n$ can…