ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let BaB_a and CaC_a be the sets of nonnegative integers satisfying, respectively, t(x+a)=1−t(x)t(x+a)=1-t(x) and t(x+a)=t(x)t(x+a)=t(x), where t(x)t(x) is the Thue–Morse sequence. Let {Ba(n)}\{B_a(n)\} and {Ca(n)}\{C_a(n)\} list these sets in increasing order, and let {βa(n)}\{\beta_a(n)\} and {γa(n)}\{\gamma_a(n)\} be the binary sequences obtained by recording whether the listed integers are odious or evil. An integer is evil if its binary expansion contains an even number of 11's and odious if it contains an odd number of 11's.

Periodicity conjecture. The sequence {γa(n)}\{\gamma_a(n)\} is periodic. If 2m∥a2^m\mathrel{\|}a, then its minimal period has 2m+12^{m+1} terms. If aa is evil, this period consists of the first 2m+12^{m+1} terms of the Thue–Morse sequence {tn}\{t_n\}; otherwise, it consists of the first 2m+12^{m+1} terms of {1−tn}\{1-t_n\}. Moreover, βa(n)+γa(n)=1\beta_a(n)+\gamma_a(n)=1.

The claim describes a precise periodic structure for the solutions of the two complementary Thue–Morse equations and gives an explicit relation between their parity-coded enumerations. The supplied text does not indicate whether the conjecture has been resolved.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.