The following pages link to Sherry H. F. Yan (Q326656):
Displaying 45 items.
- The Raney numbers and \((s,s+1)\)-core partitions (Q326657) (← links)
- On Wilf equivalence for alternating permutations (Q396905) (← links)
- Self-dual interval orders and row-Fishburn matrices (Q426862) (← links)
- Alternating permutations with restrictions and standard Young tableaux (Q456305) (← links)
- On a conjecture about enumerating \((2+2)\)-free posets (Q616386) (← links)
- Equidistributed statistics on Fishburn matrices and permutations (Q668059) (← links)
- Cycles in the graph of overlapping permutations avoiding barred patterns (Q727057) (← links)
- A bijective enumeration of tiered trees (Q776308) (← links)
- Matchings avoiding partial patterns and lattice paths (Q870005) (← links)
- Matchings avoiding partial patterns (Q870038) (← links)
- Matrix identities on weighted partial Motzkin paths (Q875057) (← links)
- Identities from weighted Motzkin paths (Q950409) (← links)
- Minimal permutations with \(d\) descents (Q976167) (← links)
- Bijective proofs of identities from colored binary trees (Q1010676) (← links)
- The second largest number of maximal independent sets in graphs with at most \(k\) cycles (Q1039521) (← links)
- 2-noncrossing trees and 5-ary trees (Q1045110) (← links)
- A new decomposition of ascent sequences and Euler-Stirling statistics (Q2010641) (← links)
- Partial \(\gamma \)-positivity for quasi-Stirling permutations of multisets (Q2065916) (← links)
- Proving identities on weight polynomials of tiered trees via Tutte polynomials (Q2084993) (← links)
- The Gessel correspondence and the partial \(\gamma \)-positivity of the Eulerian polynomials on multiset Stirling permutations (Q2111192) (← links)
- Further extensions of Haglund-Remmel-Wilson identity (Q2111201) (← links)
- Statistics on quasi-Stirling permutations of multisets (Q2141087) (← links)
- On a conjecture concerning shuffle-compatible permutation statistics (Q2153397) (← links)
- Quasi-Stirling polynomials on multisets (Q2168570) (← links)
- Pattern-avoiding inversion sequences and open partition diagrams (Q2202026) (← links)
- On a refinement of Wilf-equivalence for permutations (Q2256116) (← links)
- Bijections for inversion sequences, ascent sequences and 3-nonnesting set partitions (Q2279227) (← links)
- On self-conjugate \((s,s + 1,\dots,s + k)\)-core partitions (Q2280365) (← links)
- Vincular patterns in inversion sequences (Q2284074) (← links)
- A new encoding of permutations by Laguerre histories (Q2325747) (← links)
- On lattice paths with four types of steps (Q2354618) (← links)
- Bijective counting of humps and peaks in \((k, a)\)-paths (Q2355745) (← links)
- Counting subwords in a partition of a set (Q2380451) (← links)
- On \((2 k + 1, 2 k + 3)\)-core partitions with distinct parts (Q2400550) (← links)
- Ascent sequences and 3-nonnesting set partitions (Q2441950) (← links)
- Counting occurrences of 231 in an involution (Q2488929) (← links)
- Noncrossing trees and noncrossing graphs (Q2501001) (← links)
- Self-conjugate \(( s , s + d , s + 2 d )\)-core partitions and free Motzkin paths (Q2659211) (← links)
- Cycles on a multiset with only even-odd drops (Q2666580) (← links)
- Combinatorics of integer partitions with prescribed perimeter (Q2700960) (← links)
- (Q3011821) (← links)
- Schr\"oder Paths and Pattern Avoiding Partitions (Q3551423) (← links)
- On refinements of Wilf-equivalence for involutions (Q6116561) (← links)
- Equidistribution of set-valued statistics on standard Young tableaux and transversals (Q6153617) (← links)
- Further refinements of Wilf-equivalence for patterns of length 4 (Q6201501) (← links)
