OpenAlex
A Noncommutative Enumeration Problem
Work
Year: 2011
Type: article
Abstract: 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 treatmen... more
Cites: 6
Cited by: 2
Related to: 10
FWCI: 0.212
Citation percentile (by year/subfield): 44.24
Open Access status: gold