Enumeration Schemes in Patterns Occurrences in Aunu Permutations

By Sani Abba

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.

• Format: Paperback
• Language: English
• ISBN: 6138389190
• ISBN13: 9786138389194
• Release Date: September 2019
• Publisher: LAP Lambert Academic Publishing
• Length: 84 Pages
• Weight: 0.30 lbs.
• Dimensions: 0.2" x 6.0" x 9.0"