ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For r≥1r\geq 1 and 0≤a≤r0\leq a\leq r, consider all indices (k1,…,kr)(k_1,\ldots,k_r) with ki∈{1,2}k_i\in\{1,2\} and exactly aa entries equal to 22. Let #{i∣i odd, ki=2}\#\{i\mid i\text{ odd},\ k_i=2\} count the positions of the entries equal to 22 that have odd index. Level-two weighted sum formula conjecture.

∑ki∈{1,2}#{i∣ki=2}=a((−1)#{i∣i odd, ki=2}2a−1)ζA(2)(k1,…,kr)=0.\sum_{\substack{k_i\in\{1,2\}\\ \#\{i\mid k_i=2\}=a}}\left((-1)^{\#\{i\mid i\text{ odd},\ k_i=2\}}2^a-1\right)\zeta_{\mathcal{A}}^{(2)}(k_1,\ldots,k_r)=0.

The weight of every term is r+ar+a. The conjecture is described as a variant of the weighted sum formula, although the source notes that its form is unusual; no resolution is given.

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.