Bijective Enumeration of 3-Factorizations of an N-Cycle

Research output: Contribution to journalArticlepeer-review

Abstract

This paper is dedicated to the factorizations of the symmetric group. Introducing a new bijection for partitioned 3-cacti, we derive an elegant 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.

Original languageEnglish
Pages (from-to)367-387
Number of pages21
JournalAnnals of Combinatorics
Volume16
Issue number2
DOIs
Publication statusPublished - 1 Jun 2012

Keywords

  • Harer-Zagier formula
  • Jackson formula
  • cacti
  • cactus trees
  • permutations

Fingerprint

Dive into the research topics of 'Bijective Enumeration of 3-Factorizations of an N-Cycle'. Together they form a unique fingerprint.

Cite this