Lecture Hall Partitions II

For a non-decreasing integer sequence a=(a₁,...,a_n) we define L_a to be the set of n-tuples of integers = (₁,...,_n) satisfying . This generalizes the so-called lecture hall partitions corresponding to a_i=i and previously studied by the authors and by Andrews. We find sequences a such that the weight generating function for these a-lecture hall partitions has the remarkable form In the limit when n tends to infinity, we obtain a family of identities of the kind the number of partitions of an integer m such that the quotient between consecutive parts is greater than is equal to the number of partitions of m into parts belonging to the set P, for certain real numbers and integer sets P. We then underline the connection between lecture hall partitions and Ehrhart theory and discuss some reciprocity results.     

Clique partitions of complements of forests and bounded degree graphs

In this paper, we prove that for any forest F⊂K_n, the edges of E(K_n)?E(F) can be partitioned into O(nlogn) cliques. This extends earlier results on clique partitions of the complement of a perfect matching and of a hamiltonian path in K_n.In the second part of the paper, we show that for n sufficiently large and any ε∈(0,1], if a graph G has maximum degree O(n^1-ε), then the edges of E(K_n)?E(G) can be partitioned into cliques provided there exist certain Steiner systems. Furthermore, we show that there are such graphs G for which Ω(ε²n^2-2ε) cliques are required in every clique partition of E(K_n)?E(G).     

The completion of locally refined simplicial partitions created by bisection

Recently, in [Found. Comput. Math., 7(2) (2007), 245-269], we proved that an adaptive finite element method based on newest vertex bisection in two space dimensions for solving elliptic equations, which is essentially the method from [SINUM, 38 (2000), 466-488] by Morin, Nochetto, and Siebert, converges with the optimal rate.The number of triangles in the output partition of such a method is generally larger than the number of triangles that in all intermediate partitions have been marked for bisection, because additional bisections are needed to retain conforming meshes.A key ingredient to our proof was a result from [Numer. Math., 97(2004), 219-268] by Binev, Dahmen and DeVore saying that for some absolute constant , where is the number of triangles from the initial partition that have never been bisected. In this paper, we extend this result to bisection algorithms of -simplices, with that generalizing the result concerning optimality of the adaptive finite element method to general space dimensions.

     

Divided differences of inverse functions and partitions of a convex polygon

We derive a formula for an -th order divided difference of the inverse of a function. The formula has a simple and surprising structure: it is a sum over partitions of a convex polygon with vertices. The formula provides a numerically stable method of computing divided differences of -th roots. It also provides a new way of enumerating all partitions of a convex polygon of a certain type, i.e., with a specified number of triangles, quadrilaterals, and so on, which includes Catalan numbers as a special case.

     

Double Aztec rectangles

We investigate the connection between lozenge tilings and domino tilings by introducing a new family of regions obtained by attaching two different Aztec rectangles. We prove a simple product formula for the generating functions of the tilings of the new regions, which involves the statistics as in the Aztec diamond theorem (Elkies et al. (1992) [2], [3]). Moreover, we consider the connection between the generating function and MacMahon's q-enumeration of plane partitions fitting in a given box     

Two-Dimensional Potts Model and Annular Partitions

Using the random cluster expansion, correlations of the Potts model on a graph can be expressed as sums over partitions of the vertices where the spins are fixed. For a planar graph, only certain partitions can occur in these sums. For example, when all fixed spins lie on the boundary of one face, only noncrossing partitions contribute. In this paper we examine the partitions which occur when fixed spins lie on the boundaries of two disjoint faces. We call these the annular partitions, and we establish some of their basic properties. In particular we demonstrate a partial duality for these partitions, and show some implications for correlations of the Potts model.     

A theorem on the cores of partitions

If s and t are relatively prime positive integers we show that the s-core of a t-core partition is again a t-core partition. A similar result is proved for bar partitions under the additional assumption that s and t are both odd.     

Exact asymptotics of the characteristic polynomial of the symmetric Pascal matrix

We have obtained the exact asymptotics of the determinant . Inverse symbolic computing methods were used to obtain exact analytical expressions for all terms up to relative order L⁻¹⁴ to the leading term. This determinant is known to give weighted enumerations of cyclically symmetric plane partitions, weighted enumerations of certain families of vicious walkers and it has been conjectured to be proportional to the one point function of the O(1) loop model on a cylinder of circumference L. We apply our result to the loop model and give exact expressions for the asymptotics of the average of the number of loops surrounding a point and the fluctuation in this number. For the related bond percolation model at the critical point, we give exact expressions for the asymptotics of the probability that a point is on a cluster that wraps around a cylinder of even circumference and the probability that a point is on a cluster spanning a cylinder of odd circumference.