Lily Yen
List of Publications

Current research interests.

[18] Jonathan Jedwab and Lily Yen. Costas cubes. Preprint, February 2017. [ bib | arXiv ]
[17] Sophie Burrill, Sergi Elizalde, Marni Mishna, and Lily Yen. A generating tree approach to k-nonnesting partitions and permutations. Annals of Combinatorics, pages 1–33, June 2016. [ bib | DOI ]
Keywords: enumeration; generating tree; partition; permutation; nonnesting
[16] Jonathan Jedwab and Lily Yen. An infinite family of strongly unextendible mutually unbiased bases in C2^2h. Preprint, April 2016. [ bib | arXiv ]
[15] Lily Yen. Crossings and nestings for arc-coloured permutations and automation. The Electronic Journal of Combinatorics, 22(1):#P1.14, 2015. [ bib | http ]
Keywords: arc-coloured permutation; crossing; nesting; bijection; enumeration; tableau; generating tree; finite state automaton; transfer matrix; automation
[14] Manuel Kauers and Lily Yen. On the length of integers in telescopers for proper hypergeometric terms. Journal of Symbolic Computation, 66:21–33, 2015. [ bib | DOI | arXiv | http ]
Keywords: symbolic summation; hypergeometric identities; Zeilberger's algorithm
[13] Sophie Burrill and Lily Yen. Constructing Skolem sequences via generating trees. Preprint, January 2013. [ bib | arXiv ]
[12] Lily Yen. Crossings and nestings for arc-coloured permutations. DMTCS Proceedings, 0(01):743–754, 2013. [ bib | arXiv | http ]
[11] Lily Yen. A bijection for crossings and nestings. Preprint, September 2012. [ bib | arXiv ]
[10] Sophie Burrill, Sergi Elizalde, Marni Mishna, and Lily Yen. Generating trees for partitions and permutations with no k-nestings. DMTCS Proceedings, 0(01):409–420, 2012. [ bib | arXiv | http ]
[9] Marni Mishna and Lily Yen. Set partitions with no m-nesting. In Ilias S. Kotsireas and Eugene V. Zima, editors, Advances in Combinatorics, pages 249–258. Springer Berlin Heidelberg, 2013. [ bib | DOI | arXiv | http ]
Keywords: Set partition; Nesting; Pattern avoidance; Generating tree; Algebraic kernel method; Coefficient extraction; Enumeration
[8] Lily Yen. A combinatorial proof for Stockhausen's problem. SIAM Journal on Discrete Mathematics, 10(3):499–504, August 1997. [ bib | DOI | arXiv | http ]
[7] Ronald C. Read and Lily Yen. A note on the Stockhausen problem. Journal of Combinatorial Theory, Series A, 76(1):1–10, October 1996. [ bib | DOI ]
[6] Ira Gessel, Wayne Goddard, Walter Shur, Herbert S. Wilf, and Lily Yen. Counting pairs of lattice paths by intersections. Journal of Combinatorial Theory, Series A, 74(2):173–187, May 1996. [ bib | DOI | arXiv ]
[5] Lily Yen. A two-line algorithm for proving q-hypergeometric identities. Journal of Mathematical Analysis and Applications, 213(1):1–14, 1997. [ bib | DOI ]
[4] Lily Yen. A symmetric functions approach to Stockhausen's problem. The Electronic Journal of Combinatorics, 3(R7):2, 1996. [ bib | http ]
[3] Lily Yen. A two-line algorithm for proving terminating hypergeometric identities. Journal of Mathematical Analysis and Applications, 198(3):856–878, 1996. [ bib | DOI ]
[2] Lily Yen. A note on multiset permutations. SIAM Journal on Discrete Mathematics, 7(1):152–155, February 1994. [ bib | DOI ]
Keywords: bisection, multiset, permutations, recurrence
[1] Lily Yen. Contributions to the Proof Theory of Hypergeometric Identities. PhD thesis, University of Pennsylvania, 1993. [ bib | http ]

This page is maintained by Lily Yen. Last revised August 3rd, 2017. Validate.