Name
Abstract | ||
|---|---|---|
We determine the subword complexity of the characteristic functions of a two- parameter family fAng1 n=1 of innite sequences which are associated with the win- ning strategies for a family of 2-player games. A special case of the family has the form An = bnc for all n 2 >0 ,w here is a xed positive irrational number. The characteristic functions of such sequences have been shown to have subword complexity n + 1. We show that every sequence in the extended family has subword complexity O(n). |
Year | Venue | Keywords |
|---|---|---|
2001 | Electr. J. Comb. | characteristic function |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Characteristic function (probability theory),Extended family,Irrational number,Mathematics,Fang,Special case | Journal | 8 |
Issue | Citations | PageRank |
2 | 4 | 0.51 |
References | Authors | |
7 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Aviezri S. Fraenkel | 1 | 559 | 164.51 |
| Tamar Seeman | 2 | 6 | 0.91 |
| Jamie Simpson | 3 | 164 | 21.41 |