Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

13 relations
Binary treeBootstrap percolationCographForbidden graph characterization

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Bijective proofs of recurrences involving two Schröder triangles
2019
2019
Separable elements in Weyl groups
2018
2018
The Eulerian distribution on involutions is indeed γ-positive
2017
2017
Universal limits of substitution-closed permutation classes
We consider uniform random permutations in proper substitution-closed classes and study their limiting behavior in the sense of… 
2016
2016
A sextuple equidistribution arising in Pattern Avoidance
2014
2014
A General Theory of Wilf-Equivalence for Catalan Structures
The existence of apparently coincidental equalities (also called Wilf-equivalences) between the enumeration sequences, or… 
2010
2010
The Weak Bruhat Order and Separable Permutations
  • F. Wei
  • 2010
  • Corpus ID: 118684709
In this paper we consider the rank generating function of a separable permutation $\pi$ in the weak Bruhat order on the two… 
2010
2010
Separable permutations and Greene's Theorem
In this paper, we study the shape of separable (3142 and 2413-avoiding) permutations under RSK in light of Greene's theorem. We… 
2006
2006
On the number of rectangulations of a planar point set
Highly Cited
2005
Highly Cited
2005
The Insertion Encoding of Permutations
We introduce the insertion encoding , an encoding of finite permutations. Classes of permutations whose insertion encodings form… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)