The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We study the average number of powers and runs occurring in a word of length n drawn from an alphabet of size σ. We show that a word contains nσ(r−1)−1+o(n) powers of exponent r, at most nσ+o(n) runs, and also (1+2σ−1)n+o(n) palindromes. We also explore their abelian variants and prove that a binary word contains Θ(n32) abelian squares on the average, while its number of abelian cubes is related to...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.