Words restricted by patterns with at most 2 distinct letters

Simple item page
dc.creatorBurstein, Alexander
dc.creatorMansour, Toufik
dc.date2001-10-04
dc.date.accessioned2026-07-07T04:43:40Z
dc.date.available2026-07-07T04:43:40Z
dc.descriptionWe find generating functions for the number of words avoiding certain patterns or sets of patterns on at most 2 distinct letters and determine which of them are equally avoided. We also find the exact number of words avoiding certain patterns and provide bijective proofs for the resulting formulas.
dc.description15 pages, LaTeX2e
dc.identifierhttps://arxiv.org/abs/math/0110056
dc.identifierhttp://arxiv.org/abs/math/0110056
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/62327
dc.subjectCombinatorics
dc.subject05A05; 05A15
dc.titleWords restricted by patterns with at most 2 distinct letters
dc.typetext

Files

Collections

arXiv