The following pages link to Lun Lv (Q405063):
Displaying 13 items.
- A decomposition algorithm for noncrossing trees (Q405065) (← links)
- Reduced decompositions of matchings (Q540112) (← links)
- A unified elementary approach to the Dyson, Morris, Aomoto, and Forrester constant term identities (Q958748) (← links)
- A family of \(q\)-Dyson style constant term identities (Q1003617) (← links)
- Two coefficients of the Dyson product (Q1010746) (← links)
- A refinement of leaves on noncrossing trees (Q1938892) (← links)
- A new approach to the Dyson coefficients (Q1960264) (← links)
- Decomposition and merging algorithms for noncrossing forests (Q2062886) (← links)
- The greatest lower bound of a Boros-Moll sequence (Q2113404) (← links)
- A short proof of Moll's minimal conjecture (Q2409839) (← links)
- (Q2804773) (← links)
- (Q5033155) (← links)
- (Q5206390) (← links)
