Papers
Topics
Authors
Recent
Search
2000 character limit reached

Invariant games and non-homogeneous Beatty sequences

Published 8 Dec 2013 in math.CO and cs.DM | (1312.2233v1)

Abstract: We characterize all the pairs of complementary non-homogenous Beatty sequences $(A_n){n\ge 0}$ and $(B_n){n\ge 0}$ for which there exists an invariant game having exactly ${(A_n,B_n)\mid n\ge 0}\cup {(B_n,A_n)\mid n\ge 0}$ as set of $\mathcal{P}$-positions. Using the notion of Sturmian word and tools arising in symbolic dynamics and combinatorics on words, this characterization can be translated to a decision procedure relying only on a few algebraic tests about algebraicity or rational independence. Given any four real numbers defining the two sequences, up to these tests, we can therefore decide whether or not such an invariant game exists.

Citations (6)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.