2000 character limit reached
Bijective Enumeration of 3-Factorizations of an N-Cycle (1211.7329v1)
Published 30 Nov 2012 in math.CO
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.