Abstract
Let P(n)P(n) be a polynomial with irrational greatest coefficient. Let also a superword WW (W=(wn),n∈N)(W=(wn),n∈N) be the sequence of first binary digits of {P(n)}{P(n)}, i.e. wn=[2{P(n)}]wn=[2{P(n)}], and T(k)T(k) be the number of different subwords of WW whose length is equal to kk. The main result of the paper is the following:
Theorem 1.1. For any nn there exists a polynomial Q(k)Q(k) such that if deg(P)=ndeg(P)=n, then T(k)=Q(k)T(k)=Q(k) for all sufficiently large kk.
| Original language | American English |
|---|---|
| Pages (from-to) | 71-79 |
| Journal | Fundamentalnaya i Prikladnaya Matematika (Moscow) |
| Volume | 1 |
| Issue number | 1 |
| State | Published - 1995 |
Bibliographical note
Full text: PDF file (3616 kB)References References (in Russian): PDF file HTML файл
Bibliographic databases: