Zobrazeno 1 - 10
of 65
pro vyhledávání: '"Yen, Lily"'
Autor:
Jedwab, Jonathan, Yen, Lily
A Costas array is a permutation array for which the vectors joining pairs of $1$s are all distinct. We propose a new three-dimensional combinatorial object related to Costas arrays: an order $n$ Costas cube is an array $(d_{i,j,k})$ of size $n \times
Externí odkaz:
http://arxiv.org/abs/1702.05473
Autor:
Jedwab, Jonathan, Yen, Lily
A set of $b$ mutually unbiased bases (MUBs) in $\mathbb{C}^d$ (for $d > 1$) comprises $bd$ vectors in $\mathbb{C}^d$, partitioned into $b$ orthogonal bases for $\mathbb{C}^d$ such that the pairwise angle between all vectors from distinct bases is $\a
Externí odkaz:
http://arxiv.org/abs/1604.04797
Autor:
Kauers, Manuel, Yen, Lily
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 growth with the problem size. For telescopers of higher order but lower de
Externí odkaz:
http://arxiv.org/abs/1311.3720
Autor:
Burrill, Sophie, Yen, Lily
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 problem to a particular set of perfect matchings, then apply the method of g
Externí odkaz:
http://arxiv.org/abs/1301.6424
Autor:
Yen, Lily
Publikováno v:
DMTCS Proceedings, 0(01):743-754, 2013
The equidistribution of many crossing and nesting statistics exists in several combinatorial objects like matchings, set partitions, permutations, and embedded labelled graphs. The involutions switching nesting and crossing numbers for set partitions
Externí odkaz:
http://arxiv.org/abs/1211.3472
Autor:
Yen, Lily
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 crossing numbers, but also all refinements of crossing and nesting numb
Externí odkaz:
http://arxiv.org/abs/1209.3082
Publikováno v:
DMTCS Proceedings, 0(01):409-420, 2012
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 the connections of these objects to Young tableaux and restricted lattic
Externí odkaz:
http://arxiv.org/abs/1108.5615
Autor:
Mishna, Marni, Yen, Lily
Publikováno v:
In Ilias S. Kotsireas and Eugene V. Zima, editors, Advances in Combinatorics, pages 249-258. Springer Berlin Heidelberg, 2013
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 generating trees to construct the class of partitions with no m-nesting and det
Externí odkaz:
http://arxiv.org/abs/1106.5036
On an $r\times (n-r)$ 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 corner of the rectangle. For each integer $k$ we ask for $N_k^{n,r}$, th
Externí odkaz:
http://arxiv.org/abs/math/9409212
Autor:
Kauers, Manuel, Yen, Lily
Publikováno v:
In Journal of Symbolic Computation January-February 2015 66:21-33