Catherine H. Yan

Crossings and nestings of matchings and partitions

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 the crossing numbers and the nesting numbers are distributed symmetrically over all partitions of [n], as well as over all matchings on [2n]. As a corollary, the number of k-noncrossing partitions is equal to the number of k-nonnesting partitions. The same is also true for matchings. An application is given to the enumeration of matchings with no k-crossing (or with no k-nesting). Mathematics Subject Classification. Primary 05A18, secondary 05E10, 05A15.

Apollonian circle packings: Number theory

Abstract 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 curvatures appearing in such packings. Each Descartes quadruple of four tangent circles in the packing gives an integer solution to the Descartes equation, which relates the radii of curvature of four mutually tangent circles: x 2 +y 2 +z 2 +w 2 = 1 2 (x+y+z+w) 2 . Each integral Apollonian circle packing is classified by a certain root quadruple of integers that satisfies the Descartes equation, and that corresponds to a particular quadruple of circles appearing in the packing. We express the number of root quadruples with fixed minimal element − n as a class number, and give an exact formula for it. We study which integers occur in a given integer packing, and determine congruence restrictions which sometimes apply. We present evidence suggesting that the set of integer radii of curvatures that appear in an integral Apollonian circle packing has positive density, and in fact represents all sufficiently large integers not excluded by congruence conditions. Finally, we discuss asymptotic properties of the set of curvatures obtained as the packing is recursively constructed from a root quadruple.

Apollonian Circle Packings: Geometry and Group Theory II. Super-Apollonian Group and Integral Packings

AbstractApollonian 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, where a Descartes configuration is a set of four mutually tangent circles in the Riemann sphere, having disjoint interiors. Part I showed there exists a discrete group, the Apollonian group, acting on a parameter space of (ordered, oriented) Descartes configurations, such that the Descartes configurations in a packing formed an orbit under the action of this group. It is observed there exist infinitely many types of integral Apollonian packings in which all circles had integer curvatures, with the integral structure being related to the integral nature of the Apollonian group. Here we consider the action of a larger discrete group, the super-Apollonian group, also having an integral structure, whose orbits describe the Descartes quadruples of a geometric object we call a super-packing. The circles in a super-packing never cross each other but are nested to an arbitrary depth. Certain Apollonian packings and super-packings are strongly integral in the sense that the curvatures of all circles are integral and the curvature x centers of all circles are integral. We show that (up to scale) there are exactly eight different (geometric) strongly integral super-packings, and that each contains a copy of every integral Apollonian circle packing (also up to scale). We show that the super-Apollonian group has finite volume in the group of all automorphisms of the parameter space of Descartes configurations, which is isomorphic to the Lorentz group O(3, 1).

Random Geometric Graph Diameter in the Unit Ball

The unit ball random geometric graph

Quasifinite highest weight modules over the Lie algebra of matrix differential operators on the circle

G=G^d_p(\lambda,n)

Crossings and Nestings of Two Edges in Set Partitions

has as its vertices n points distributed independently and uniformly in the unit ball in

Commuting quasi-order relations

{\Bbb R}^d

Distributive laws for commuting equivalence relations

, with two vertices adjacent if and only if their ℓp-distance is at most λ. Like its cousin the Erdos-Renyi random graph, G has a connectivity threshold: an asymptotic value for λ in terms of n, above which G is connected and below which G is disconnected. In the connected zone we determine upper and lower bounds for the graph diameter of G. Specifically, almost always,

Ulam's pathological liar game with one half-lie

{\rm diam}_p({\bf B})(1-o(1))/\lambda\leq {\rm diam}(G) \leq {\rm diam}_p({\bf B})(1+O((\ln \ln n/{\rm ln}\,n)^{1/d}))/\lambda

Major index for 01-fillings of moon polyominoes

, where