A noncommutative enumeration problem
arXiv:1004.1738
Abstract
In this article 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.
14 pages, 3 figures, section 3 extended