English

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

Combinatorics 2024-12-10 v2 Number Theory

Abstract

For a finite multiset AA of an abelian group GG, let FS(A)\text{FS}(A) denote the multiset of the 2A2^{|A|} subset sums of AA. It is natural to ask to what extent AA can be reconstructed from FS(A)\text{FS}(A). We fully solve this problem for 22-torsion-free groups GG by giving characterizations, both algebraic and combinatorial, of the fibers of FS\text{FS}. Equivalently, we characterize all pairs of multisets A,BA,B with FS(A)=FS(B)\text{FS}(A)=\text{FS}(B). Our results build on recent work of Ciprietti and the first author.

Keywords

Cite

@article{arxiv.2305.11062,
  title  = {Reconstructing a set from its subset sums: $2$-torsion-free groups},
  author = {Federico Glaudo and Noah Kravitz},
  journal= {arXiv preprint arXiv:2305.11062},
  year   = {2024}
}

Comments

19 pages, version published by Discrete Analysis

R2 v1 2026-06-28T10:38:21.793Z