International Journal of Combinatorics
Volume 2011 (2011), Article ID 403140, 9 pages
Research Article

A Noncommutative Enumeration Problem

Department of Mathematics and Informatics, University of Camerino, Via Madonna delle Carceri 9, 62032 Camerino (MC), Italy

Received 28 April 2011; Accepted 6 October 2011

Academic Editor: Alois Panholzer

Copyright © 2011 Maria Simonetta Bernabei and Horst Thaler. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


We tackle the combinatorics of coloured hard-dimer objects. This is achieved by identifying coloured hard-dimer configurations with a certain class of rooted trees that allow for an algebraic treatment in terms of noncommutative formal power series. A representation in terms of matrices then allows to find the asymptotic behaviour of these objects.

1. Introduction

The aim is to count coloured hard-dimer configurations which are objects as shown in Figure 1.

Figure 1: A coloured hard-dimer configuration with 2 blue dimers, 1 red dimer, and 3 inner vertices.

More precisely, we define a coloured hard-dimer configuration (CHDC) to be a finite sequence , of blue and red vertices, together with coloured dimers on which must not intersect. Here a coloured dimer is an edge connecting two nearest vertices of the same colour see Figure 1. The dimer’s colour is given by the colour of its boundary vertices. In graph-theoretic language CHDCs are a subclass of labeled graphs whose vertices and edges carry one of two possible labels. Without loss of generality, we may assume that a CHDC is a subset of and its vertices belong to . We include also the empty CHDC, that is, the configuration when no dimers are present.

The enumeration problem we have in mind goes as follows: given a sequence and a triple of nonnegative integers , where count the numbers of blue, red dimers and the number of inner vertices, that is, vertices that are connected to their left and right vertex. How many CHDCs of a given type are there on , where as well as may be arbitrary?

The strategy is to identify the set of CHDCs with a certain class of trees the elements of which can be encoded into monomials of a noncommutative formal power series , where the ’s are words over the alphabet . This means that the indeterminates and are supposed to be noncommutative and a particular word just corresponds to a particular sequence of blue and red vertices . The coefficients collect the information of CHDCs of a given type on .

The motivation for studying this kind of objects is due to their appearance in causally triangulated -dimensional gravity. It was shown in [1], by using special triangulations of spacetime, that the discrete Laplace transform of the one-step propagator can be expressed as follows: with The parameters are related to physical and geometrical constants. Now, the exponents just count, for a given CHDC , the number of blue dimers, red dimers, and inner vertices, respectively. A glance at shows that it involves precisely the combinatorial numbers we are after in this paper.

In Section 2, we show how to make CHDCs into monomials, and thereby solve the enumeration problem from above. In Section 3, we give an alternative way to express the coefficients by means of a linear representation of the indeterminates . The formal power series that allow such a representation are called recognizable. Finally, we use this result to investigate the growth behaviour of the number of CHDCs.

2. From CHDCs to Noncommutative Series

In this section we will establish a bijection between CHDCs and a certain class of trees. This is achieved by first identifying CHDCs with a particular class of graphs denoted which in turn will be identified with the corresponding class of trees denoted .

Bijection   : for a given CHDC, we endow its vertices with the order inherited from . An extra vertex × is added in the first place, which becomes the root of the graph. Then, all the vertices which are next neighbors are connected through an edge. Finally, the vertices which in the original CHDC are the starting and end points of a dimer are linked via an extra edge to the right, as seen from the root (see Figure 2(a)). We note that only the closest vertices of the same colour may get an extra link and that these become trivalent, unless we consider the last vertex, in which case it becomes bivalent. The set of rooted graphs we obtain in this manner is denoted as , and it is obvious that we have established a bijection between the latter and the set of CHDCs.

Figure 2: Illustration of the one-to-one correspondence between a coloured hard-dimer, its graph, and its tree.

Bijection : when a graph in is given, we move beginning from the root in clockwise direction and cut an edge if the graph remains connected. The cut edge is replaced by two edges ending in univalent vertices called buds (black arrow) and leafs (white arrow), respectively. The procedure is repeated until we reach the last vertex (see Figure 2(b)). We note that buds and three vertices are always connected by one edge only, whereas leafs and three vertices may be interlaced by a certain number of bivalent red or blue vertices. The set of rooted trees we obtain following this procedure is denoted as . Vice versa, when a tree in is given, we may, starting from the root, move in clockwise direction and merge the bud leave pairs to edges getting a graph in .

We have thus established a bijection between the set of CHDCs and the set . The next goal is to find an algebraic formulation of the enumeration problem for elements in . For this, we adapt ideas from [2] and assign the charges , −1 and 0 to leaves, buds and univalent coloured vertices, respectively. With this choice any tree has charge 0 and any subtree different from a bud has charge 0 or +1. For this reason, we distinguish between (resp., ) trees, if and only if(a)their total charge is 0 (resp., 1),(b)any descendant subtree different from a bud has charge 0 or 1.

Furthermore, we subdivide these two groups into , and , trees depending on whether the first vertex after the root is blue or red.

Now, we are able to write down a system of equations for the four types of trees which will turn out to be linear. Since we are interested in counting the number of CHDCs on a fixed sequence of blue and red vertices we assign noncommutative variables and to blue and red vertices, respectively. Furthermore, for a given sequence we group together all CHDCs with the same numbers , , and . This can be achieved by encoding a blue or red dimer through the assignment of commutative variables and , respectively. Particularly, the variables and are assigned to those trivalent blue and red vertices, respectively, which possess a bud leg pair as subtree. Finally, to every bivalent vertex sitting in between a three vertex and a leaf, we assign a commutative variable .

We are thus naturally led to consider the trees , , , and as elements of the noncommutative algebra of formal power series, where is the commutative polynomial ring . A formal series will be written in the form , where the sum runs over all words of the alphabet with coefficients . For example, the tree and the corresponding graph in Figure 2 read where stands for the noncommutative product in . As we can read in Figure 3 below, our trees have to satisfy the following consistency equations: Substituting the expressions of and into the equations for and , we get by elementary algebra the following system of equations: that is, The system (2.4) can be solved easily with the result By symmetry, we also get

Figure 3: The possible building blocks from the perspective of an arbitrary vertex. The corresponding building blocks for are obtained by exchanging colors and variables ().

Theorem 2.1. Let be the formal series given as part of the unique solution of (2.4) in . Then, all coefficients of words starting with letter are zero and the nontrivial coefficients are given as finite sums where the multiplicities count the number of coloured hard-dimer configurations on with fixed . In particular, the evaluation gives the number of CHDCs on the sequence corresponding to . The symmetric assertion holds for .

Remark 2.2. It is clear from (2.4) that solves the equation with solution given by . Moreover, for , the evaluation gives the number of CHDCs on irrespective of whether it starts with or .

Proof of Theorem 2.1. Let be one of the subscripts , and decompose , where comprises the sum of terms in with length . In the same manner, we write . An elementary computation shows that and likewise for , which implies that a solution to (2.4) gives rise to sequences and obeying the following recursive equations (): with initial conditions , for and . Vice versa, for sequences , obeying (2.8) and related initial conditions, their sums and will satisfy (2.4). Therefore, we may equivalently look at the system (2.8). But the elements contain precisely the sum of those terms from which are algebraic counterparts of trees in that have coloured vertices the first one of which is . This is due to the fact that there is a one-to-one correspondence between trees from and trees of charge 0 that are constructed recursively according to the building blocks from Figure 3. For a fixed , the coefficient is a sum of elements in which stem from trees that are constructible for the particular sequence of blue and red vertices given by . Since the indeterminates , , are commutative, trees will contribute the same term , whenever the numbers of vertices corresponding to a , , indeterminate, coincide. Therefore, the integer in front of gives the number of CHDCs with blue dimers, red dimers, and inner vertices fixed.

3. The Solution as a Recognizable Series

Here, we show in addition that is a recognizable series. Let be a finite alphabet, the corresponding free monoid of words, and a semiring. A formal series with is called recognizable if there is some , a homomorphism of semirings (or simply a representation) where carries its multiplicative structure and tuples such that for all words Further material on recognizable series is exposed in [3, 4].

In order to find a representation for , we look at the prefixes of a given and note that for a given prefix of , we may decompose the set of CHDCs on into three disjoint subsets by looking at the restriction of a CHDC to .: the boundary points of dimers (if any) either lie entirely inside or outside of ,: a blue dimer starts in and ends outside of ,: a red dimer starts in and ends outside of .

Strictly speaking, we consider, in the above decomposition, the larger set of uncompleted CHDCs, meaning that the last vertex of a CHDC may be the starting or inner point of an uncompleted dimer; see Figure 4.

Figure 4: Two examples of uncompleted CHDCs.

Now, the three sets are identified with the canonical basis elements of the -module ; that is, , . If the last vertex of is blue or red, we assign matrices or to the latter. For this, let be the last letter of . Then, the matrix entries are nonzero according to whether , , holds or does not hold. In accordance with the assignments of variables made in Section 2, we now choose entries when a dimer of colour is being completed and when a dimer gets an additional inner vertex. The entries 1 indicate either that a single vertex is added or that a vertex becomes the starting point of a dimer. Explicitly, the matrices read We choose which means that we start from the empty CHDC. In the end, the (complete) CHDCs can be read off by setting . We may summarize this discussion in the following.

Proposition 3.1. The noncommutative formal series is a recognizable series with representation given by , and tuples , .

The result above allows to study the asymptotic behaviour of the number of CHDCs on when tends to infinity. According to Proposition 3.1,   is a recognizable series, and the evaluation at again gives a recognizable series. Namely, for the corresponding representation is given by through and the tuples are Note that according to Remark 2.2,   counts the number of CHDCs on the sequence of blue and red sites corresponding to .

It is convenient to discuss the asymptotics of CHDCs within the framework of ergodic dynamical systems. To be precise, let , and define as the probability measure on given by . Then, as ergodic dynamical system , we choose the following., that is, the set of sequences with . If denotes the coordinate maps then should be the -algebra generated by the ’s. is the product measure . is the shift operator .

Upon turning into a probability space that is isomorphic to , we may state the following theorem.

Theorem 3.2. For , let , and let denote the number of CHDCs on . There exists a finite constant random variable on such that for almost all This means that the number of CHDCs grows exponentially and that asymptotically this growth rate is the same for almost all .

Proof. If we define the matrix-valued random variables by then defines a subadditive sequence of random variables; that is, To see subadditivity, we first note that with the natural identifications we may write . Writing , with and , subadditivity follows from the combinatorial fact that . Now, Kingman’s subadditive ergodic theorem, see [5] and [6, Theorem  IV.1.2], applied to our ergodic dynamical system implies that there exists a random variable such that In addition, one has . If convergence holds also in . A priori, it is not clear whether which we clarify now. By Jensen’s inequality, we find where . The eigenvalues of the matrix are , and the diagonalization of shows that . This in turn implies ., for all , for some -independent finite constant, and consequently . We have thus established almost sure convergence of

Remark 3.3. We conjecture that from Theorem 3.2 is given by . This conjecture is based on the following heuristic argument. From the explicit diagonalization of , we find that and from (3.14), we deduce . Moreover, by (3.8), we may write , with ln-a.s. Now, assuming , it would follow that , with , for which there is no evidence as far as numerical calculations are concerned.


H. Thaler is grateful for the financial support through the program “Rientro dei Cervelli” of the Italian MIUR.


  1. D. Benedetti, R. Loll, and F. Zamponi, “(2+1)-dimensional quantum gravity as the continuum limit of causal dynamical triangulations,” Physical Review D, vol. 76, no. 10, Article ID 104022, 26 pages, 2007. View at Google Scholar
  2. J. Bouttier, P. Di Francesco, and E. Guitter, “Census of planar maps: from the one-matrix model solution to a combinatorial proof,” Nuclear Physics B, vol. 645, no. 3, pp. 477–499, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  3. J. Berstel and C. Reutenauer, Rational Series and Their Languages, vol. 12 of EATCS Monographs on Theoretical Computer Science, Springer, Berlin, Germany, 1988.
  4. A. Salomaa and M. Soittola, Automata-Theoretic Aspects of Formal Power Series, Texts and Monographs in Computer Science, Springer, New York, NY, USA, 1978.
  5. J. F. C. Kingman, “The ergodic theory of subadditive stochastic processes,” Journal of the Royal Statistical Society. Series B, vol. 30, pp. 499–510, 1968. View at Google Scholar · View at Zentralblatt MATH
  6. R. Carmona and J. Lacroix, Spectral Theory of Random Schrödinger Operators, Probability and Its Applications, Birkhäuser, Boston, Mass, USA, 1990.