ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Zm\mathbb{Z}_m be a cyclic group of order m=2nm=2^n. Let tt and m1,…,mtm_1,\ldots,m_t be positive integers satisfying

∑i=1tmi=m−1,\sum_{i=1}^t m_i=m-1,

with m1≥1m_1\geq 1 and mi≥2m_i\geq 2 for 2≤i≤t2\leq i\leq t. Equal-sum partition conjecture. There exists μ∈Zm\mu\in\mathbb{Z}_m such that the nonzero elements of Zm\mathbb{Z}_m can be partitioned into disjoint subsets S1,…,StS_1,\ldots,S_t with ∣Si∣=mi|S_i|=m_i and

∑s∈Sis=μ\sum_{s\in S_i}s=\mu

for every ii, 1≤i≤t1\leq i\leq t. This is presented as an equivalent formulation of the complete multipartite distance-magic conjecture, whose status is not separately resolved in the source.

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.