Pages that link to "Item:Q1765607"
From MaRDI portal
The following pages link to Reduction of \(m\)-regular noncrossing partitions (Q1765607):
Displaying 19 items.
- Partitions and partial matchings avoiding neighbor patterns (Q412240) (← links)
- Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions (Q500971) (← links)
- Heisenberg characters, unitriangular groups, and Fibonacci numbers (Q765870) (← links)
- Walks, partitions, and normal ordering (Q888618) (← links)
- Extended set partitions with successions (Q925032) (← links)
- Enumeration of \((k,2)\)-noncrossing partitions (Q941401) (← links)
- Identities from weighted Motzkin paths (Q950409) (← links)
- On the combinatorics of the Pfaff identity (Q1025474) (← links)
- Identities involving Narayana polynomials and Catalan numbers (Q1043577) (← links)
- Partitions of a set satisfying certain set of conditions (Q1043979) (← links)
- On the Wadge reducibility of \(k\)-partitions (Q1044675) (← links)
- Combinatorics of contacts in protein contact maps (Q1742649) (← links)
- A simple bijection for enhanced, classical, and 2-distant \(k\)-noncrossing partitions (Q2174564) (← links)
- Fubini numbers and polynomials of graphs (Q2238749) (← links)
- Noncrossing normal ordering for functions of boson operators (Q2269943) (← links)
- Regular simple queues of protein contact maps (Q2362157) (← links)
- The research and progress of the enumeration of lattice paths (Q2689733) (← links)
- Partitions of vertices and facets in trees and stacked simplicial complexes (Q6580497) (← links)
- Explicit enumeration formulas for \(m\)-regular simple stacks (Q6658051) (← links)
