activity
19942016
most citedA generating tree approach to k-nonnesting partitions and permutations

8 citations · 26 across the 8 of their papers we have counts for

collaborators

8 papers

math.CO2016★ 1 cited

An infinite family of strongly unextendible mutually unbiased bases in

Jonathan Jedwab, Lily Yen

A set of mutually unbiased bases (MUBs) in (for ) comprises vectors in , partitioned into orthogonal bases for such…

cs.SC2013

On the length of integers in telescopers for proper hypergeometric terms

Manuel Kauers, Lily Yen

We show that the number of digits in the integers of a creative telescoping relation of expected minimal order for a bivariate proper hypergeometric term has essentially cubic grow…

math.CO2013★ 2 cited

Constructing Skolem sequences via generating trees

Sophie Burrill, Lily Yen

A Skolem sequence is a linear arrangement of the multiset, {1, 1, 2, 2, ..., n, n} such that if r in [n] appears in positions i and j, then |i-j| = r. We first translate the proble…

math.CO2012★ 7 cited

Crossings and Nestings for Arc-Coloured Permutations

Lily Yen

The equidistribution of many crossing and nesting statistics exists in several combinatorial objects like matchings, set partitions, permutations, and embedded labelled graphs. The…

math.CO2012★ 1 cited

A Bijection for Crossings and Nestings

Lily Yen

For a subclass of matchings, set partitions, and permutations, we describe a direct bijection involving only arc annotated diagrams that not only interchanges maximum nesting and c…

math.CO2011★ 8 cited

A generating tree approach to k-nonnesting partitions and permutations

Sophie Burrill, Sergi Elizalde, Marni Mishna +1

We describe a generating tree approach to the enumeration and exhaustive generation of k-nonnesting set partitions and permutations. Unlike previous work in the literature using th…

math.CO2011★ 7 cited

Set partitions with no m-nesting

Marni Mishna, Lily Yen

A partition on [n] has an m-nesting if there exists i_1 < i_2 < ... < i_m < j_m < j_{m-1} < ... < j_1, where i_l and j_l are in the same block for all 1 <= l <= m. We use generatin…

math.CO1994

Counting pairs of lattice paths by intersections

Ira Gessel, Wayne Goddard, Walter Shur +2

On an lattice rectangle, we first consider walks that begin at the SW corner, proceed with unit steps in either of the directions E or N, and terminate at the NE co…