Avoiding substrings in compositions

Silvia Heubach, Sergey Kitaev

Research output: Contribution to journalArticle

Abstract

A classical result by Guibas and Odlyzko obtained in 1981 gives the generating function for the number of strings that avoid a given set of substrings with the property that no substring is contained in any of the others. In this paper, we give an analogue of this result for the enumeration of compositions that avoid a given set of prohibited substrings, subject to the compositions’ length and weight.
Original languageEnglish
Pages (from-to)87-95
Number of pages9
JournalCongressus Numerantium
Volume202
Publication statusPublished - 2010

Fingerprint

Enumeration
Generating Function
Strings
Analogue

Keywords

  • compositions
  • strings
  • avoidance

Cite this

Heubach, Silvia ; Kitaev, Sergey. / Avoiding substrings in compositions. In: Congressus Numerantium. 2010 ; Vol. 202. pp. 87-95.
@article{a57ed45b95c046e79b56d169637351f9,
title = "Avoiding substrings in compositions",
abstract = "A classical result by Guibas and Odlyzko obtained in 1981 gives the generating function for the number of strings that avoid a given set of substrings with the property that no substring is contained in any of the others. In this paper, we give an analogue of this result for the enumeration of compositions that avoid a given set of prohibited substrings, subject to the compositions’ length and weight.",
keywords = "compositions, strings, avoidance",
author = "Silvia Heubach and Sergey Kitaev",
year = "2010",
language = "English",
volume = "202",
pages = "87--95",
journal = "Congressus Numerantium",
issn = "0384-9864",

}

Avoiding substrings in compositions. / Heubach, Silvia; Kitaev, Sergey.

In: Congressus Numerantium, Vol. 202, 2010, p. 87-95.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Avoiding substrings in compositions

AU - Heubach, Silvia

AU - Kitaev, Sergey

PY - 2010

Y1 - 2010

N2 - A classical result by Guibas and Odlyzko obtained in 1981 gives the generating function for the number of strings that avoid a given set of substrings with the property that no substring is contained in any of the others. In this paper, we give an analogue of this result for the enumeration of compositions that avoid a given set of prohibited substrings, subject to the compositions’ length and weight.

AB - A classical result by Guibas and Odlyzko obtained in 1981 gives the generating function for the number of strings that avoid a given set of substrings with the property that no substring is contained in any of the others. In this paper, we give an analogue of this result for the enumeration of compositions that avoid a given set of prohibited substrings, subject to the compositions’ length and weight.

KW - compositions

KW - strings

KW - avoidance

UR - https://personal.cis.strath.ac.uk/sergey.kitaev/index_files/Papers/avoiding-substrings-comps.pdf

M3 - Article

VL - 202

SP - 87

EP - 95

JO - Congressus Numerantium

JF - Congressus Numerantium

SN - 0384-9864

ER -