Mathematics – Combinatorics
Scientific paper
2011-08-03
Mathematics
Combinatorics
Scientific paper
We show that every infinite word $\omega$ on a finite subset of $\mathbb{Z}$
must contain arbitrarily large factors $B_1B_2$ which are "close" to being
\textit{additive squares}. We also show that for all $k>1, \ \omega$ must
contain a factor $U_1U_2 ... U_k$ where $U_1,U_2,..., U_k$ all have the same
\textit{average.}
No associations
LandOfFree
Approximations of additive squares in infinite words does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Approximations of additive squares in infinite words, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximations of additive squares in infinite words will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-663385