Prolific Compositions
Discrete mathematics & theoretical computer science, Permutation Patters 2018, Tome 21 (2019) no. 2
Voir la notice de l'article provenant de la source Episciences
Under what circumstances might every extension of a combinatorial structure contain more copies of another one than the original did? This property, which we call prolificity, holds universally in some cases (e.g., finite linear orders) and only trivially in others (e.g., permutations). Integer compositions, or equivalently layered permutations, provide a middle ground. In that setting, there are prolific compositions for a given pattern if and only if that pattern begins and ends with 1. For each pattern, there is an easily constructed automaton that recognises prolific compositions for that pattern. Some instances where there is a unique minimal prolific composition for a pattern are classified.
@article{DMTCS_2019_21_2_a9,
author = {Tannock, Murray and Albert, Michael},
title = {Prolific {Compositions}},
journal = {Discrete mathematics & theoretical computer science},
publisher = {mathdoc},
volume = {21},
number = {2},
year = {2019},
doi = {10.23638/DMTCS-21-2-10},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-21-2-10/}
}
TY - JOUR AU - Tannock, Murray AU - Albert, Michael TI - Prolific Compositions JO - Discrete mathematics & theoretical computer science PY - 2019 VL - 21 IS - 2 PB - mathdoc UR - http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-21-2-10/ DO - 10.23638/DMTCS-21-2-10 LA - en ID - DMTCS_2019_21_2_a9 ER -
Tannock, Murray; Albert, Michael. Prolific Compositions. Discrete mathematics & theoretical computer science, Permutation Patters 2018, Tome 21 (2019) no. 2. doi: 10.23638/DMTCS-21-2-10
Cité par Sources :