Related papers: The depth of a permutation

We define and study a variant of the \emph{Stanley depth} which we call \emph{total depth} for partially ordered sets (posets). This total depth is the most natural variant of Stanley depth from $\llbracket S_k\rrbracket$ -- the poset of…

We extend the usual notion of fully commutative elements from the Coxeter groups to the complex reflection groups. Then we decompose the sets of fully commutative elements into natural subsets according to their combinatorial properties,…

We give a direct combinatorial proof that the product of two descent classes in a symmetric group is a sum of descent classes. The proof is based on the fact that the group product gives a covering map when descent classes are endowed with…

We rigorously quantify the improvement in the sample complexity of variational divergence estimations for group-invariant distributions. In the cases of the Wasserstein-1 metric and the Lipschitz-regularized $\alpha$-divergences, the…

Using a result of Gessel and Reutenauer, we find a simple formula for the number of cyclic permutations with a given descent set, by expressing it in terms of ordinary descent numbers (i.e., those counting all permutations with a given…

We establish a weak form of Carlson's conjecture on the depth of the mod-p cohomology ring of a p-group. In particular, Duflot's lower bound for the depth is tight if and only if the cohomology ring is not detected on a certain family of…

A generalized Catalan matrix $(a_{n,k})_{n,k\ge 0}$ is generated by two seed sequences $\mathbf{s}=(s_0,s_1,\ldots)$ and $\mathbf{t}=(t_1,t_2,\ldots)$ together with a recurrence relation. By taking $s_\ell=2\ell+1$ and $t_\ell=\ell^2$ we…

The notion of a mesh pattern was introduced recently, but it has already proved to be a useful tool for description purposes related to sets of permutations. In this paper we study eight mesh patterns of small lengths. In particular, we…

This survey of alternating permutations and Euler numbers includes refinements of Euler numbers, other occurrences of Euler numbers, longest alternating subsequences, umbral enumeration of classes of alternating permutations, and the…

We consider two families of spaces, $X$ : the closed orientable Riemann surfaces of genus $g>0$ and the classifying spaces of right-angled Artin groups. In both cases we compare the depth of the fundamental group with the depth of an…

Louis Solomon showed that the group algebra of the symmetric group $\mathfrak{S}_{n}$ has a subalgebra called the descent algebra, generated by sums of permutations with a given descent set. In fact, he showed that every Coxeter group has…

Danz computes the depth of certain twisted group algebra extensions in Comm. Alg. (2011), which are less than the values of the depths of the corresponding untwisted group algebra extensions in Burciu et al, I.E.J.A. (2011). In this paper,…

An (n,d)-permutation code is a subset C of Sym(n) such that the Hamming distance d_H between any two distinct elements of C is at least equal to d. In this paper, we use the characterisation of the isometry group of the metric space…

We analyze the structure and enumerate Dumont permutations of the first and second kinds avoiding certain patterns or sets of patterns of length 3 and 4. Some cardinalities are given by Catalan numbers, powers of 2, little Schroeder…

Let W be a Coxeter group. In this paper, we establish that, up to going to some finite index normal subgroup W_0 of W, any two cyclically reduced expressions of conjugate elements of W_0 only differ by a sequence of braid relations and…

We recognise that an entropy inequality akin to the main intermediate goal of recent works (Gowers, Green, Manners, Tao [3],[2]) regarding a conjecture of Marton provides a black box from which we can also through a short deduction recover…

A permutation of the positive integers avoiding monotone arithmetic progressions of length $4$ with odd common difference was constructed in (LeSaulnier and Vijay, 2011). We generalise this result and show that for each $k\geq 1$, there…

We prove that if a set is `large' in the sense of Erd\H{o}s, then it approximates arbitrarily long arithmetic progressions in a strong quantitative sense. More specifically, expressing the error in the approximation in terms of the gap…

We define and study odd analogues of classical geometric and combinatorial objects associated to permutations, namely odd Schubert varieties, odd diagrams, and odd inversion sets. We show that there is a bijection between odd inversion sets…

Let B be the generalized braid group associated to some finite complex reflection group. We define a representation of B of dimension the number of reflections of the corresponding reflection group, which generalizes the Krammer…