A bijection between well-labelled positive paths and matchings

zbMath1234.05036arXiv0903.5379MaRDI QIDQ624822

Philippe Nadeau, Bertrand Duplantier, Olivier Bernardi

Publication date: 9 February 2011

Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

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

zbMATH Keywords

matchingsubpolytopes partitioningwell-labelled positive path

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05)

Related Items (8)

A decomposition of ballot permutations, pattern avoidance and Gessel walks ⋮ Ballot permutations and odd order permutations ⋮ A complete enumeration of Ballot permutations avoiding sets of small patterns ⋮ The peak and descent statistics over ballot permutations ⋮ Refined Eulerian numbers and ballot permutations ⋮ A Toeplitz property of ballot permutations and odd order permutations ⋮ Arcsine laws for random walks generated from random permutations with applications to genomics ⋮ The symplectic geometry of closed equilateral random walks in 3-space

This page was built for publication: A bijection between well-labelled positive paths and matchings