Enumeration of non-positive planar trivalent graphs |
| |
Authors: | Bruce W Westbury |
| |
Institution: | (1) Mathematics Institute, University of Warwick, Coventry, CV4 7AL, UK |
| |
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. In 13] it is 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 G
2. However in this account we have emphasised the combinatorics. |
| |
Keywords: | Planar graphs Lattice paths Invariant tensors |
本文献已被 SpringerLink 等数据库收录! |