On the Number of Rational Power Factors in a Finite Word

TL;DR

This paper investigates the maximum number of distinct rational power factors in finite words, establishing an upper bound of approximately n^2, and introduces a graph-theoretic approach to pattern counting.

Contribution

It provides the first upper bound on the number of rational power factors in words and presents a novel graph-based method for pattern-counting problems.

Findings

Maximum rational power factors n^2 + O(n) in words.

Introduced a graph-theoretic approach to pattern counting.

Connected rational powers to extremal graph problems.

Abstract

Let $w$ be a finite word of length $n$. In this paper, we study the maximum possible number of distinct rational power factors in a finite word. A rational power is a word of the form $u=p^kp'$, where $p$ is a nonempty finite word, $k$ is an integer larger than $1$, $p^k$ is a concatenation of $k$ copies of $p$ and $p'$ is a prefix of $p$. The rational powers can be recognized as a generalization of $k$-powers, and it is proved in [Li,Pachocki,Radoszewski 24] that, the number $C_k(w)$ of distinct $k$-powers in $w$ satisfies $C_k(w) \leq \frac{n-1}{k-1}$. However, the number of rational powers has not been studied in the literature. In this article, we prove that the number $\mathrm{RP}(w)$ of distinct rational power factors of $w$ satisfies $\mathrm{RP}(w)\le\frac18n^2+O(n)$. We also illustrate a novel approach to study pattern-counting problems: using a graph-theoretic representation of words and a few word equations, we transform the traditional pattern-counting problems into a constrained extremal problem.