Separable \(d\)-permutations and guillotine partitions
From MaRDI portal
Publication:659578
DOI10.1007/s00026-010-0043-8zbMath1233.05004arXiv0803.3414WikidataQ60691900 ScholiaQ60691900MaRDI QIDQ659578
Andrei Asinowski, Toufik Mansour
Publication date: 24 January 2012
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0803.3414
binary trees; Schröder paths; separable permutations; guillotine partitions; \(d\)-permutations; patterns in permutations
05A15: Exact enumeration problems, generating functions
05A19: Combinatorial identities, bijective combinatorics
05A17: Combinatorial aspects of partitions of integers
05A05: Permutations, words, matrices
Related Items
Unnamed Item, Unnamed Item, Unnamed Item, Enumeration and Asymptotic Formulas for Rectangular Partitions of the Hypercube, Combinatorial generation via permutation languages. III: Rectangulations, Cut equivalence of \(d\)-dimensional guillotine partitions, Aspect ratio universal rectangular layouts
Uses Software
Cites Work
- Pattern matching for permutations
- The X-class and almost-increasing permutations
- The number of guillotine partitions in \(d\) dimensions
- Restricted permutations and the wreath product
- A bijection between permutations and floorplans, and its applications
- Bootstrap Percolation, the Schröder Numbers, and theN-Kings Problem
- Graph Classes: A Survey
- Unnamed Item
- Unnamed Item