Equal-sum partition conjecture for groups with at least three involutions

At least 8 years old · documented by

Let Γ\Gamma be an Abelian group in G\mathcal{G}, where G\mathcal{G} denotes the class used in the paper, and let g0g_0 be its identity element. Suppose that Γ\Gamma has even order nn and exactly 2t−1≥32^t-1\geq 3 involutions. For every partition

n−1=r1+r2+⋯+rtn-1=r_1+r_2+\cdots+r_t

with ri≥3r_i\geq 3 for 1≤i≤t1\leq i\leq t, and for every positive integer tt for which such a partition is considered, there is a partition of Γ∖{g0}\Gamma\setminus\{g_0\} into pairwise disjoint subsets A1,A2,…,AtA_1,A_2,\ldots,A_t satisfying

∣Ai∣=riand∑a∈Aia=g0(1≤i≤t).|A_i|=r_i\quad\text{and}\quad\sum_{a\in A_i}a=g_0\qquad(1\leq i\leq t).

This extends the paper's equal-sum partition results for groups in G\mathcal{G}; the supplied text does not state whether the conjecture has been resolved.

References

Primary source

Sylwia Cichacz, “Zero sum partition into sets of the same order and its applications”, arXiv:1702.07859 (2017).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.