The following pages link to William Y. C. Chen (Q214543):
Displaying 50 items.
- Vacillating Hecke tableaux and linked partitions (Q897490) (← links)
- Community structures of networks (Q926319) (← links)
- Linked partitions and linked cycles (Q932823) (← links)
- A major index for matchings and set partitions (Q941320) (← links)
- On Postnikov's hook length formula for binary trees (Q942125) (← links)
- Identities from weighted Motzkin paths (Q950409) (← links)
- Converging to Gosper's algorithm (Q950412) (← links)
- Set systems with \(\mathcal L\)-intersections modulo a prime number (Q1003627) (← links)
- The skew and relative derangements of type B (Q1010598) (← links)
- Crossings and nestings in tangled diagrams (Q1010810) (← links)
- Efficient counting and asymptotics of \(k\)-noncrossing tangled diagrams (Q1010947) (← links)
- The \(q\)-WZ method for infinite series (Q1023261) (← links)
- Partitions of \(\mathbb Z_n\) into arithmetic progressions (Q1024267) (← links)
- On the combinatorics of the Pfaff identity (Q1025474) (← links)
- Faulhaber's theorem on power sums (Q1025909) (← links)
- Extended Zeilberger's algorithm for identities on Bernoulli and Euler polynomials (Q1026880) (← links)
- Hook length formulas for trees by Han's expansion (Q1028843) (← links)
- Pairs of noncrossing free Dyck paths and noncrossing partitions (Q1043635) (← links)
- Labeled partitions with colored permutations (Q1045018) (← links)
- (Q1106245) (redirect page) (← links)
- A short proof of Kundu's k-factor theorem (Q1106246) (← links)
- On joint realization of (0,1) matrices (Q1115506) (← links)
- The skew, relative, and classical derangements (Q1126298) (← links)
- Maximum \((g,f)\)-factors of a general graph (Q1179272) (← links)
- \(q\)-analogs of the inclusion-exclusion principle and permutations with restricted position (Q1197002) (← links)
- Integral matrices with given row and column sums (Q1199992) (← links)
- A coding algorithm for Rényi trees (Q1207762) (← links)
- The pessimistic search and the straightening involution for trees (Q1266368) (← links)
- The combinatorics of a class of representation functions (Q1281887) (← links)
- Enumeration of cubic graphs by inclusion-exclusion (Q1284476) (← links)
- The theory of compositionals (Q1313850) (← links)
- Compositional calculus (Q1318365) (← links)
- A bijection for enriched trees (Q1332356) (← links)
- Implication algebras and the Metropolis-Rota axioms for cubic lattices (Q1346091) (← links)
- Parameter augmentation for basic hypergeometric series. II (Q1374181) (← links)
- An involution for the Gauss identity (Q1395818) (← links)
- Motzkin paths and reduced decompositions for permutations with forbidden patterns (Q1408518) (← links)
- Adjacency and parity relations of words in discrete dynamical systems (Q1584668) (← links)
- Decomposition of necklaces (Q1600816) (← links)
- Nearly equal distributions of the rank and the crank of partitions (Q1644610) (← links)
- A Franklin type involution for squares (Q1761473) (← links)
- Matrix method for linear sequential dynamical systems on digraphs (Q1765409) (← links)
- Equivalence classes of matchings and lattice-square designs (Q1765511) (← links)
- Reduction of \(m\)-regular noncrossing partitions (Q1765607) (← links)
- The flagged Cauchy determinant (Q1777241) (← links)
- Derangements on the \(n\)-cube (Q1801689) (← links)
- Discrete dynamical systems on graphs and Boolean functions (Q1877717) (← links)
- The skew Schubert polynomials (Q1888294) (← links)
- The combinatorial power of the companion matrix (Q1906799) (← links)
- Interpolation for symmetric functions (Q1909942) (← links)
