Prolific Compositions
From MaRDI portal
Publication:6317045
DOI10.23638/DMTCS-21-2-10arXiv1904.05533MaRDI QIDQ6317045FDOQ6317045
Authors: Murray Tannock, Michael Albert 
Publication date: 11 April 2019
Abstract: 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.
This page was built for publication: Prolific Compositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6317045)
