Nestings of matchings and permutations and north steps in PDSAWs

zbMATH Open1393.05053arXiv0712.2804MaRDI QIDQ4584079FDOQ4584079

Authors: Martin Rubey 

Publication date: 29 August 2018

Abstract: We present a simple bijective proof of the fact that matchings of [2n] with N nestings are equinumerous to partially directed self avoiding walks confined to the symmetric wedge defined by y=+-x, with n east steps and N north steps. A very similar construction connects permutations with N nestings and PDSAWs remaining below the x-axis, again with N north steps. Furthermore, both bijections transport several combinatorially meaningful parameters.

Full work available at URL: https://arxiv.org/abs/0712.2804

Recommendations

• A bijection between partially directed paths in the symmetric wedge and matchings
• Crossings and nestings of matchings and partitions
• Partitions and partial matchings avoiding neighbor patterns
• $n!$ matchings, $n!$ posets
• \(n!\) matchings, \(n!\) posets (extended abstract)

zbMATH Keywords

nestings and crossings of matchings and permutationsPDSAWs

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial identities, bijective combinatorics (05A19)

Cited In (4)

• On the number of walks in a triangular domain
• Major index for 01-fillings of moon polyominoes
• Tiling bijections between paths and Brauer diagrams
• A bijection between partially directed paths in the symmetric wedge and matchings

This page was built for publication: Nestings of matchings and permutations and north steps in PDSAWs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4584079)