Words restricted by patterns with at most 2 distinct letters

Alexander Burstein; Toufik Mansour

doi:10.37236/1675

Words restricted by patterns with at most 2 distinct letters

Research output: Contribution to journal › Article › peer-review

Abstract

We find generating functions for the number of words avoiding certain patterns or sets of patterns with at most 2 distinct letters and determine which of them are equally avoided. We also find exact numbers of words avoiding certain patterns and provide bijective proofs for the resulting formulae.

Original language	English
Journal	Electronic Journal of Combinatorics
Volume	9
Issue number	2 R
DOIs	https://doi.org/10.37236/1675
State	Published - 31 Oct 2002
Externally published	Yes

ASJC Scopus subject areas

Theoretical Computer Science
Geometry and Topology
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics
Applied Mathematics

Access to Document

10.37236/1675

Cite this

@article{78b32b28ba964e6883267c3170a2bb41,

title = "Words restricted by patterns with at most 2 distinct letters",

abstract = "We find generating functions for the number of words avoiding certain patterns or sets of patterns with at most 2 distinct letters and determine which of them are equally avoided. We also find exact numbers of words avoiding certain patterns and provide bijective proofs for the resulting formulae.",

author = "Alexander Burstein and Toufik Mansour",

year = "2002",

month = oct,

day = "31",

doi = "10.37236/1675",

language = "English",

volume = "9",

journal = "Electronic Journal of Combinatorics",

issn = "1077-8926",

publisher = "Electronic Journal of Combinatorics",

number = "2 R",

}

TY - JOUR

T1 - Words restricted by patterns with at most 2 distinct letters

AU - Burstein, Alexander

AU - Mansour, Toufik

PY - 2002/10/31

Y1 - 2002/10/31

N2 - We find generating functions for the number of words avoiding certain patterns or sets of patterns with at most 2 distinct letters and determine which of them are equally avoided. We also find exact numbers of words avoiding certain patterns and provide bijective proofs for the resulting formulae.

AB - We find generating functions for the number of words avoiding certain patterns or sets of patterns with at most 2 distinct letters and determine which of them are equally avoided. We also find exact numbers of words avoiding certain patterns and provide bijective proofs for the resulting formulae.

UR - http://www.scopus.com/inward/record.url?scp=3042536898&partnerID=8YFLogxK

U2 - 10.37236/1675

DO - 10.37236/1675

M3 - Article

AN - SCOPUS:3042536898

SN - 1077-8926

VL - 9

JO - Electronic Journal of Combinatorics

JF - Electronic Journal of Combinatorics

IS - 2 R

ER -

Words restricted by patterns with at most 2 distinct letters

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this