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.
Piracy-free
Assured Quality
Secure Transactions
Delivery Options
Please enter pincode to check delivery time.
*COD & Shipping Charges may apply on certain items.