Enumeration of non-positive planar trivalent graphs
Combinatorics
2011-04-08 v1 Representation Theory
Abstract
In this paper we construct inverse bijections between two sequences of finite sets. One sequence is defined by planar diagrams and the other by lattice walks. G. Kuperberg has shown that the number of elements in these two sets are equal. This problem and the methods we use are motivated by the representation theory of the exceptional simple Lie algebra . However in this account we have emphasised the combinatorics.
Cite
@article{arxiv.math/0507112,
title = {Enumeration of non-positive planar trivalent graphs},
author = {Bruce W. Westbury},
journal= {arXiv preprint arXiv:math/0507112},
year = {2011}
}