Skip to main content
Springer Nature Link
Log in

Words Restricted by 3-Letter Generalized Multipermutation Patterns

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

Abstract.

We find exact formulas and/or generating functions for the number of words avoiding 3-letter generalized multipermutation patterns and find which of them are equally avoided.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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 Mathematics, Iowa State University, Ames, IA 50011-2064, USA, [email protected] , , , , , , US

    Alexander Burstein

  2. Department of Mathematics, Chalmers Univeristy of Technology, 412 96 Göteborg, Sweden, [email protected], , , , , , SE

    Toufik Mansour

Authors
  1. Alexander Burstein
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Toufik Mansour
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Burstein, A., Mansour, T. Words Restricted by 3-Letter Generalized Multipermutation Patterns. Annals of Combinatorics 7, 1–14 (2003). https://doi.org/10.1007/s000260300000

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s000260300000

Search

Navigation