LABELED TREES AND FACTORIZATIONS OF A CYCLE INTO TRANSPOSITIONS

被引：19

作者：

GOULDEN, IP

PEPPER, S

机构：

[1] Department of Combinatorics and Optimization, University of Waterloo, Waterloo

来源：

DISCRETE MATHEMATICS | 1993年 / 113卷 / 1-3期

关键词：

D O I：

10.1016/0012-365X(93)90522-U

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Moszkowski has previously given a direct bijection between labelled trees on n vertices and factorizations of the cycle (12...n) in S(n) into n-1 transpositions. By considering a quadratic recurrence equation and its combinatorial interpretation for trees and for transposition factorizations, we derive another such bijection in a straightforward manner.

引用

页码：263 / 268

页数：6

共 4 条

[1]

Cayley C, 1889, Q J MATH, V23, P376, DOI [10.1017/cbo9780511703799.010, DOI 10.1017/CBO9780511703799]

[2]

Denes J., 1959, PUBL MATH I HUNG, V4, P63

[3] SOME COMBINATORIAL PROBLEMS ASSOCIATED WITH PRODUCTS OF CONJUGACY CLASSES OF THE SYMMETRIC GROUP [J].

JACKSON, DM .

JOURNAL OF COMBINATORIAL THEORY SERIES A, 1988, 49 (02) :363-369

[4] A SOLUTION TO A PROBLEM OF DENES - A BIJECTION BETWEEN TREES AND FACTORIZATIONS OF CYCLIC PERMUTATIONS [J].

MOSZKOWSKI, P .

EUROPEAN JOURNAL OF COMBINATORICS, 1989, 10 (01) :13-16

← 1 →