Skip to main content
SpringerLink
Log in

Permutation Factorizations and Prime Parking Functions

  • Original Paper
  • Published:
Annals of Combinatorics Aims and scope Submit manuscript

Abstract.

Permutation factorizations and parking functions have some parallel properties. Kim and Seo exploited these parallel properties to count the number of ordered, minimal factorizations of permutations of cycle type (n) and (1, n − 1). In this paper, we use parking functions, new tree enumerations and other necessary tools, to extend the techniques of Kim and Seo to the cases (2, n − 2) and (3, n − 3).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Combinatorics and Optimization, University of Waterloo, Waterloo, ON, N2L 3G1, Canada

    Amarpreet Rattan

Authors
  1. Amarpreet Rattan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Amarpreet Rattan.

Additional information

Received October 13, 2004

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rattan, A. Permutation Factorizations and Prime Parking Functions. Ann. Comb. 10, 237–254 (2006). https://doi.org/10.1007/s00026-006-0285-7

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00026-006-0285-7

Keywords.

AMS Subject Classification.

Search

Navigation