paper

Reconstructing a set from its subset sums: -torsion-free groups

arXiv:2305.11062 · doi:10.19086/da.125856

Abstract

For a finite multiset of an abelian group , let denote the multiset of the subset sums of . It is natural to ask to what extent can be reconstructed from . We fully solve this problem for -torsion-free groups by giving characterizations, both algebraic and combinatorial, of the fibers of . Equivalently, we characterize all pairs of multisets with . Our results build on recent work of Ciprietti and the first author.

19 pages, version published by Discrete Analysis

Reconstructing a set from its subset sums: $2$-torsion-free groups · wovepaper