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

DOI10.1016/J.DISC.2019.111705MaRDI QIDQ2174564zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• A combinatorial bijection on \(k\)-noncrossing partitions
• A generating tree approach to k-nonnesting partitions and permutations
• A note on 2-distant noncrossing partitions and weighted Motzkin paths
• Bijections for inversion sequences, ascent sequences and 3-nonnesting set partitions
• Combinatorics of RNA structures with pseudoknots
• Crossings and nestings in colored set partitions
• Crossings and nestings of matchings and partitions
• Enumeration of non-positive planar trivalent graphs
• Front representation of set partitions
• Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes
• On partitions avoiding 3-crossings
• On some combinatorial sequences associated to invariant theory
• Reduction of \(m\)-regular noncrossing partitions
• Restricted inversion sequences and enhanced 3-noncrossing partitions
• Set Partitions with No m-Nesting
• The on-line encyclopedia of integer sequences
• \(d\)-regular set partitions and rook placements
• \(k\)-distant crossings and nestings of matchings and 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
• Enumeration of bilaterally symmetric 3-noncrossing partitions
• \(k\)-distant crossings and nestings of matchings and partitions
• A combinatorial bijection on \(k\)-noncrossing partitions
• Enumeration of bilaterally symmetric 3-noncrossing partitions

Describes a project that uses

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)