A Noncommutative Enumeration Problem

الملخص EN

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.