A Noncommutative Enumeration Problem

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...

Full description

Saved in:
Bibliographic Details
Published in:International journal of combinatorics 2012, Vol.2011 (2011), p.1-9
Main Authors: Bernabei, Maria Simonetta, Thaler, Horst
Format: Article
Language:English
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1687-9163
1687-9171
DOI:10.1155/2011/403140