On a class of linked diagrams,I. Enumeration |
| |
| Authors: | Paul R Stein |
| |
| Affiliation: | Los Alamos Scientific Laboratory, University of California, Los Alamos, New Mexico 87544 USA |
| |
| Abstract: | Recurrence rules are derived for enumerating the linked diagrams first encountered by Touchard in 1952. These may be characterized as the subclass of irreducible diagrams in the full set of (2n ? 1)!! complete pairings on 2n points. In addition, a recurrence rule is given for the number of symmetric irreducible diagrams. This enables one to calculate the number of symmetry-reduced irreducible diagrams. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
