Abstract | ||
---|---|---|
Beatty sequences @?n@a+@c@? are nearly linear, also called balanced, namely, the absolute value of the difference D of the number of elements in any two subwords of the same length satisfies D=\"0, we prove D==2), and D==2,t=1). We show that each value that is assumed, is assumed infinitely often. Under the assumption (s-2)= |
Year | DOI | Venue |
---|---|---|
2008 | 10.1016/j.disc.2007.08.070 | Discrete Mathematics |
Keywords | Field | DocType |
extension of beatty sequences,gap structure,sequences of differences,gap,satisfiability | Discrete mathematics,Combinatorics,Absolute value,Upper and lower bounds,Beatty sequence,Heap (data structure),Mathematics | Journal |
Volume | Issue | ISSN |
308 | 20 | Discrete Mathematics |
Citations | PageRank | References |
3 | 0.46 | 6 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Shiri Artstein-Avidan | 1 | 3 | 0.46 |
Aviezri S. Fraenkel | 2 | 559 | 164.51 |
Vera T. Sós | 3 | 318 | 62.21 |