An Exact All-Width Plateau for the Three-Summand Tu-Deng Count modulo 2^k-1
Statement
Put and write for the binary Hamming weight. Let count the ordered triples with and , the three-summand analogue of the two-summand count of the Tu-Deng conjecture at the same modulus and weight budget. Evaluate exactly on the targets whose -bit cyclic word has exactly two zero digits, no two adjacent: is the value the same for every such at a given , and what is it?
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.