A noncommutative enumeration problem
Maria Simonetta Bernabei, Horst Thaler · arXiv (Cornell University) · 2010
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.