The Library
Enumeration of non-positive planar trivalent graphs
Tools
Tools
Tools
Westbury, Bruce W. (2007) Enumeration of non-positive planar trivalent graphs. Journal of Algebraic Combinatorics, Vol.25 (No.4). pp. 357-373. doi:10.1007/s10801-006-0041-4
Research output not available from this repository, contact author.
Official URL: http://dx.doi.org/10.1007/s10801-006-0041-4
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.
| Item Type: | Journal Article | ||||
|---|---|---|---|---|---|
| Subjects: | Q Science > QA Mathematics | ||||
| Divisions: | Faculty of Science > Mathematics | ||||
| Journal or Publication Title: | Journal of Algebraic Combinatorics | ||||
| Publisher: | Springer New York LLC | ||||
| ISSN: | 0925-9899 | ||||
| Official Date: | June 2007 | ||||
| Dates: |
|
||||
| Volume: | Vol.25 | ||||
| Number: | No.4 | ||||
| Number of Pages: | 17 | ||||
| Page Range: | pp. 357-373 | ||||
| DOI: | 10.1007/s10801-006-0041-4 | ||||
| Status: | Peer Reviewed | ||||
| Publication Status: | Published | ||||
| Access rights to Published version: | Restricted or Subscription Access |
Data sourced from Thomson Reuters' Web of Knowledge
Request changes or add full text files to a record
Repository staff actions (login required)
 |
View Item |
