Related papers: Two-stack-sorting with pop stacks
We classify all bi-vincular patterns of length two and three according to the number of permutations avoiding them. These patterns were recently defined by Bousquet-Melou et. al., and are natural generalizations of Babson and…
Define a permutation to be any sequence of distinct positive integers. Given two permutations p and s on disjoint underlying sets, we denote by p sh s the set of shuffles of p and s (the set of all permutations obtained by interleaving the…
We present the poset of Borel congruence classes of anti-symmetric matrices ordered by containment of closures. We show that there exists a bijection between the set of these classes and the set of involutions of the symmetric group. We…
A di-sk tree is a rooted binary tree whose nodes are labeled by $\oplus$ or $\ominus$, and no node has the same label as its right child. The di-sk trees are in natural bijection with separable permutations. We construct a combinatorial…
We introduce the notion of n-mating in this work, which includes the classical mating of polynomials as a special case. The new notion brings further links between the polynomial world and the rational world than the classical one, as well…
We study the compositional inverses of some general classes of permutation polynomials over finite fields. We show that we can write these inverses in terms of the inverses of two other polynomials bijecting subspaces of the finite field,…
We apply ideas from the cluster method to q-count the permutations of a multiset according to the number of occurrences of certain generalized patterns, as defined by Babson and Steingrimsson. In particular, we consider those patterns with…
We define two new families of polynomials that generalize permanents and prove upper and lower bounds on their determinantal complexities comparable to the known bounds for permanents. One of these families is obtained by replacing…
We study iterations of two classical constructions, the evolutes and involutes of plane curves, and we describe the limiting behavior of both constructions on a class of smooth curves with singularities given by their support functions.…
Arc permutations, which were originally introduced in the study of triangulations and characters, have recently been shown to have interesting combinatorial properties. The first part of this paper continues their study by providing signed…
Bivariate generating functions for various subsets of the class of permutations containing no descending sequence of length three or more are determined. The notion of absolute indecomposability of a permutation is introduced, and used in…
An algorithm is presented for unranking permutations in transposition order: Given a seed s\in N, the algorithm produces a permutation P(s) that differs from the permutation P(s+1) by the transposition of two elements.
A class of probability distributions is characterized via equalities in law between two order statistics shifted by independent exponential variables. An explicit formula for the quintile function of the identified family of distributions…
A systematic construction of higher order splines using two hierarchies of polynomials is presented. Explicit instructions on how to implement one of these hierarchies are given. The results are limited to interpolations on regular,…
We generalize principal bundles and quotient stacks to the two-categorical context of bisites. We introduce a notion of principal 2-bundle that makes sense for a 2-category with finite flexible limits, endowed with a bitopology. We then use…
In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…
A $k$-Stirling permutation of order $n$ is said to be "flattened" if the leading terms of its increasing runs are in ascending order. We show that flattened $k$-Stirling permutations of order $n+1$ are in bijection correspondence with a…
We study the factorizations of the permutation $(1,2,...,n)$ into $k$ factors of given cycle types. Using representation theory, Jackson obtained for each $k$ an elegant formula for counting these factorizations according to the number of…
This paper is continuation of the study of the 1-box pattern in permutations introduced by the authors in \cite{kitrem4}. We derive a two-variable generating function for the distribution of this pattern on 132-avoiding permutations, and…
We characterize separable multidimensional permutations in terms of forbidden patterns and enumerate them by means of generating function, recursive formula and explicit formula. We find a connection between multidimensional permutations…