Bijective Enumeration of 3-Factorizations of an N-Cycle
Combinatorics
2012-12-03 v1
Abstract
This paper is dedicated to the factorizations of the symmetric group. Introducing a new bijection for partitioned 3-cacti, we derive an el- egant formula for the number of factorizations of a long cycle into a product of three permutations. As the most salient aspect, our construction provides the first purely combinatorial computation of this number.
Keywords
Cite
@article{arxiv.1211.7329,
title = {Bijective Enumeration of 3-Factorizations of an N-Cycle},
author = {E. A. Vassilieva},
journal= {arXiv preprint arXiv:1211.7329},
year = {2012}
}