permutation pattern combinatorics theoretical (2 Ergebnisse)

Taschenbuch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. n combinatorial mathematics and theoretical computer science, a permutation pattern is a sub-permutation of a longer permutation. The permutation written in the one-line notation is said to contain the permutation if there exists a subsequence of entries of that has the same relative order as , and in this case is said to be a pattern of , written . Otherwise, is said to avoid the permutation . The subsequence of need not consist of consecutive entries. For example, permutation = 391867452 (written in one-line notation) contains the pattern = 51342, as can be seen by considering the subsequence 91672. Such a subsequence is called a copy of .

Taschenbuch. Zustand: Neu. Permutation Pattern | Combinatorics, Theoretical Computer Science, Permutation | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786131287893 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.