Separable \(d\)-permutations and guillotine partitions

DOI10.1007/s00026-010-0043-8zbMath1233.05004arXiv0803.3414OpenAlexW1987361949WikidataQ60691900 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

zbMATH Keywords

binary treesSchröder pathsseparable permutationsguillotine partitions\(d\)-permutationspatterns in permutations

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Combinatorial aspects of partitions of integers (05A17) Permutations, words, matrices (05A05)

Related Items (8)

Enumeration and Asymptotic Formulas for Rectangular Partitions of the Hypercube ⋮ Aspect ratio universal rectangular layouts ⋮ Cut equivalence of \(d\)-dimensional guillotine partitions ⋮ Singleton mesh patterns in multidimensional permutations ⋮ Combinatorial generation via permutation languages. III: Rectangulations ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Separable \(d\)-permutations and guillotine partitions