Reconstructing a set from its subset sums: $2$-torsion-free groups
Combinatorics
2024-12-10 v2 Number Theory
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.
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