#### Filter Results:

- Full text PDF available (28)

#### Publication Year

1998

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- William Y.C. Chen, Eva Y.P. Deng, Rosena R.X. Du, Richard P. Stanley, Catherine H. Yan
- 2005

We present results on the enumeration of crossings and nestings for matchings and set partitions. Using a bijection between partitions and vacillating tableaux, we show that if we fix the sets of minimal block elements and maximal block elements, the crossing number and the nesting number of partitions have a symmetric joint distribution. It follows that… (More)

Apollonian circle packings arise by repeatedly filling the interstices between mutually tangent circles with further tangent circles. It is possible for every circle in such a packing to have integer radius of curvature, and we call such a packing an integral Apollonian circle packing. This paper studies number-theoretic properties of the set of integer… (More)

We show that there are precisely two, up to conjugation, anti-involutions σ ± of the algebra of differential operators on the circle preserving the principal gradation. We classify the irreducible quasifinite highest weight representations of the central extension D ± of the Lie subalgebra of this algebra fixed by −σ ± , and find the unitary ones. We… (More)

- Robert B. Ellis, Jeremy L. Martin, Catherine H. Yan
- Algorithmica
- 2007

The unit ball random geometric graph G = G d p (λ, n) has as its vertices n points distributed independently and uniformly in the unit ball in R d , with two vertices adjacent if and only if their ℓp-distance is at most λ. Like its cousin the Erd˝ os-Rényi random graph, G has a connectivity threshold: an asymptotic value for λ in terms of n, above which G… (More)

- Joseph P. S. Kung, Catherine H. Yan
- J. Comb. Theory, Ser. A
- 2003

- Ronald L. Graham, Jeffrey C. Lagarias, Colin L. Mallows, Allan R. Wilks, Catherine H. Yan
- Discrete & Computational Geometry
- 2006

A Descartes configuration is a set of four mutually tangent circles in the Riemann sphere, having disjoint interiors. Apollonian circle packings arise by repeatedly filling the interstices between four mutually tangent circles with further tangent circles. Such packings can be described in terms of the Descartes configurations they contain. Part I shoewed… (More)

- William Y. C. Chen, Susan Y. J. Wu, Catherine H. Yan
- Eur. J. Comb.
- 2008

The notion of noncrossing linked partition arose from the study of certain transforms in free probability theory. It is known that the number of noncrossing linked partitions of [n+1] is equal to the n-th large Schröder number r n , which counts the number of Schröder paths. In this paper we give a bijective proof of this result. Then we introduce the… (More)

- Ronald L. Graham, Jeffrey C. Lagarias, Colin L. Mallows, Allan R. Wilks, Catherine H. Yan
- Discrete & Computational Geometry
- 2006

This paper gives n-dimensional analogues of the Apollonian circle packings in Parts I and II. Those papers considered circle packings described in terms of their Descartes configurations, which are sets of four mutually touching circles. They studied packings that had integrality properties in terms of the curvatures and centers of the circles. Here we… (More)

- Ronald L. Graham, Jeffrey C. Lagarias, Colin L. Mallows, Allan R. Wilks, Catherine H. Yan
- Discrete & Computational Geometry
- 2005

Apollonian circle packings arise by repeatedly filling the interstices between four mutually tangent circles with further tangent circles. We observe that there exist Apollonian packings which have strong integrality properties, in which all circles in the packing have integer curvatures and rational centers such that (curvature)×(center) is an integer… (More)