A simple bijection for enhanced, classical, and 2-distant k-noncrossing partitions

DOI10.1016/J.DISC.2019.111705zbMATH Open1437.05020OpenAlexW2987522878MaRDI QIDQ2174564FDOQ2174564

Authors: Juan B. Gil, Jordan Olliver Tirrell 

Publication date: 21 April 2020

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2019.111705

Recommendations

• \(k\)-distant crossings and nestings of matchings and partitions
• On trees and noncrossing partitions
• Crossings and nestings of matchings and partitions
• Bijections for inversion sequences, ascent sequences and 3-nonnesting set partitions

zbMATH Keywords

\(k\)-noncrossing partitionenhanced \(k\)-noncrossing partition

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18)

Cites Work

• The on-line encyclopedia of integer sequences
• Title not available (Why is that?)
• Crossings and nestings of matchings and partitions
• Crossings and nestings in colored set partitions
• Combinatorics of RNA structures with pseudoknots
• Set Partitions with No m-Nesting
• A generating tree approach to \(k\)-nonnesting partitions and permutations
• On partitions avoiding 3-crossings
• Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes
• Reduction of \(m\)-regular noncrossing partitions
• Enumeration of non-positive planar trivalent graphs
• Front representation of set partitions
• \(k\)-distant crossings and nestings of matchings and partitions
• A note on 2-distant noncrossing partitions and weighted Motzkin paths
• \(d\)-regular set partitions and rook placements
• Bijections for inversion sequences, ascent sequences and 3-nonnesting set partitions
• On some combinatorial sequences associated to invariant theory
• A combinatorial bijection on \(k\)-noncrossing partitions
• Restricted inversion sequences and enhanced 3-noncrossing partitions

Cited In (7)

• A bijection between the \(d\)-dimensional simplices with distances in \(\{1,2\}\) and the partitions of \(d+1\)
• On some combinatorial sequences associated to invariant theory
• A note on 2-distant noncrossing partitions and weighted Motzkin paths
• \(k\)-distant crossings and nestings of matchings and partitions
• Enumeration of bilaterally symmetric 3-noncrossing partitions
• A combinatorial bijection on \(k\)-noncrossing partitions
• Enumeration of bilaterally symmetric 3-noncrossing partitions

Uses Software

• OEIS

This page was built for publication: A simple bijection for enhanced, classical, and 2-distant \(k\)-noncrossing partitions

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