ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Put N=2k−1N=2^k-1 and write wt\mathrm{wt} for the binary Hamming weight. Let Fk(t)F_k(t) count the ordered triples (a,b,c)∈{0,…,N−1}3(a,b,c)\in\{0,\dots,N-1\}^3 with a+b+c≡t(modN)a+b+c\equiv t \pmod N and wt(a)+wt(b)+wt(c)<k\mathrm{wt}(a)+\mathrm{wt}(b)+\mathrm{wt}(c)<k, the three-summand analogue of the two-summand count of the Tu-Deng conjecture at the same modulus and weight budget. Evaluate Fk(t)F_k(t) exactly on the targets tt whose kk-bit cyclic word has exactly two zero digits, no two adjacent: is the value the same for every such tt at a given kk, 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 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.