Partitions with k crossings

DOI10.1023/A:1006901625470zbMATH Open0933.05003OpenAlexW1571912376MaRDI QIDQ1306585FDOQ1306585

Miklós Bóna

Publication date: 4 April 2000

Published in: The Ramanujan Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1006901625470

zbMATH Keywords

generating functionCatalan numbersset partitioncounting problems

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18)

Cited In (6)

• Analytic combinatorics of chord and hyperchord diagrams with \(k\) crossings
• On partitions with \(k\) corners not containing the staircase with one more corner
• Enumeration of \((k,2)\)-noncrossing partitions
• Counting pattern-free set partitions. I: A generalization of Stirling numbers of the second kind
• A combinatorial bijection on \(k\)-noncrossing partitions
• Crossings and nestings in set partitions of classical types

Recommendations

• Title not available (Why is that?) 👍 👎
• Crossings and nestings of matchings and partitions 👍 👎
• Some properties of crossings and partitions 👍 👎
• On the number of crossing-free partitions 👍 👎
• Partitions into \(k\) parts 👍 👎
• Crossings and nestings in set partitions of classical types 👍 👎
• Enumeration of \((k,2)\)-noncrossing partitions 👍 👎
• A combinatorial bijection on \(k\)-noncrossing partitions 👍 👎
• \(k\)-indivisible noncrossing partitions 👍 👎
• k-gon partitions 👍 👎

This page was built for publication: Partitions with \(k\) crossings

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