The following pages link to (Q3726126):
Displaying 50 items.
- Free rises, restricted partitions, and \(q\)-Fibonacci polynomials (Q384775) (← links)
- Some enumerative results related to ascent sequences (Q393161) (← links)
- Stanley decompositions and Hilbert depth in the Koszul complex (Q412506) (← links)
- Catalan numbers and pattern restricted set partitions (Q456885) (← links)
- Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions (Q500971) (← links)
- Restricted partitions and \(q\)-Pell numbers (Q539195) (← links)
- Dyck paths of knight moves (Q582294) (← links)
- Tiling bijections between paths and Brauer diagrams (Q633279) (← links)
- The complexity of Euler's integer partition theorem (Q714811) (← links)
- Generalized Dyck paths (Q757416) (← links)
- \(p,q\)-Stirling numbers and set partition statistics (Q809080) (← links)
- Faster combinatorial algorithms for determinant and Pfaffian (Q848938) (← links)
- A bijection from ordered trees to binary trees that sends the pruning order to the Strahler number (Q913810) (← links)
- A bijective proof of Jackson's formula for the number of factorizations of a cycle (Q941309) (← links)
- Combinatorial proofs of inverse relations and log-concavity for Bessel numbers (Q942123) (← links)
- Block-connected set partitions (Q966144) (← links)
- Skew Dyck paths (Q972821) (← links)
- Raney and Catalan (Q998368) (← links)
- RNA secondary structure, permutations, and statistics (Q1028137) (← links)
- The Gram determinant of the type B Temperley-Lieb algebra (Q1030690) (← links)
- Gray codes, loopless algorithm and partitions (Q1040787) (← links)
- The coolest way to generate combinations (Q1044892) (← links)
- Classical partition functions and the \(U(n+1)\) Rogers-Selberg identity (Q1191954) (← links)
- Identities of Rothe-Abel-Schläfli-Hurwitz-type (Q1191959) (← links)
- Lattice path enumeration by formal schema (Q1197397) (← links)
- A unified combinatorial approach for \(q\)- (and \(p,q\)-) Stirling numbers (Q1209642) (← links)
- Dyck path enumeration (Q1300974) (← links)
- Reduced decompositions of permutations in terms of star transpositions, generalized Catalan numbers and \(k\)-ary trees (Q1300984) (← links)
- The strong Hall property and symmetric chain orders (Q1301661) (← links)
- Descent classes of permutations with a given number of fixed points (Q1318370) (← links)
- Average cost of Duval's algorithm for generating Lyndon words (Q1334678) (← links)
- Duality of graded graphs (Q1337042) (← links)
- Interpolating set partition statistics (Q1337170) (← links)
- \(\sigma\)-restricted growth functions and \(p,q\)-Stirling numbers (Q1337181) (← links)
- Listing graphs that satisfy first-order sentences (Q1337473) (← links)
- Generalization of Dyson's rank and non-Rogers-Ramanujan partitions (Q1340661) (← links)
- Schensted algorithms for dual graded graphs (Q1344189) (← links)
- Off-line algorithms for the list update problem (Q1350929) (← links)
- A bijection between Proctor's and Sundaram's odd orthogonal tableaux (Q1356415) (← links)
- Finding parity difference by involutions (Q1356534) (← links)
- Lattice path matroids: Enumerative aspects and Tutte polynomials (Q1417949) (← links)
- Integrals over Grassmannians and random permutations. (Q1421398) (← links)
- A combinatorial interpretation of the inverse \(t\)-Kostka matrix. (Q1584471) (← links)
- Generalized rook polynomials (Q1584670) (← links)
- Tree-like properties of cycle factorizations (Q1601424) (← links)
- Log concavity of a sequence in a conjecture of Simion (Q1604573) (← links)
- Kontsevich-Witten model from \(2+1\) gravity: new exact combinatorial solution (Q1611773) (← links)
- The odd-even invariant and Hamiltonian circuits in tope graphs (Q1686251) (← links)
- Dual-antiprisms and partitions of powers of 2 into powers of 2 (Q1731454) (← links)
- Factorial characters of the classical Lie groups (Q1746589) (← links)
