Refined Enumeration of Minimal Transitive Factorizations of Permutations

Abstract

Minimal transitive cycle factorizations, parking functions and labeled trees are related very closely. Using the correspondences between them, we find a refined enumeration of minimal transitive factorizations of permutations of type (1, n− 1) and (2, n− 2). 

3 Figures and Tables

Topics

  • Presentations referencing similar topics