Enumeration Schemes in Patterns Occurrences in Aunu Permutations - Abba, Sani
29,99 €
inkl. MwSt.
Versandkostenfrei*
Versandfertig in 1-2 Wochen
payback
15 °P sammeln
  • Broschiertes Buch

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 auch für
Produktbeschreibung
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.
Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.
Autorenporträt
Born on 25/05/1964. Indigence of Danmusa LGA of Katsina State in Nigeria. Obtained a first degree at the University of Abuja, Nigeria in 1998 & a Master degree in Mathematics from Usmanu Danfodiyo University, Sokoto, Nigeria in 2013 and currently pursuing PhD program in Mathematics at the same institution.