Separable permutation

Known as: Separable permutations

In combinatorial mathematics, a separable permutation is a permutation that can be obtained from the trivial permutation 1 by direct sums and skew…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2019

Let $r(n,k)$ (resp. $s(n,k)$) be the number of Schroder paths (resp. little Schroder paths) of length $2n$ with $k$ hills, and…

2017

In this paper, we give a polynomial (O(n)) algorithm for finding a longest common pattern between two permutations of size n…

2015

AbstractThe weakBruhatorderon S n is the partial order ≺ so that σ ≺ τwhenever the set of inversions of σ is a subset of the set…

2012

This paper presents a pattern matching algorithm for super4 4 positional graphs which counts a number of matches with time…

2011

The separable permutations are those that can be obtained from the trivial permutation by two operations called direct sum and…

2010

In this paper we consider the rank generating function of a separable permutation $\pi$ in the weak Bruhat order on the two…

2010

In this paper, we study the shape of separable (3142 and 2413-avoiding) permutations under RSK in light of Greene's theorem. We…