Enumeration Schemes in Patterns Occurrences in Aunu Permutations
Versandkostenfrei!
Versandfertig in 6-10 Tagen
26,99 €
inkl. MwSt.
PAYBACK Punkte
13 °P sammeln!
We find generating functions for the number of strings (words) containing a specified number of occurrences of certain types of order-isomorphic classes of substrings called Aunu patterns. In particular, we find generating functions for the number of strings containing a specified number of occurrences of a given 3-letter subword pattern. We say that permutation is an Aunu permutation if its first element is one and its length is a prime number.
Andere Kunden interessierten sich für
