On The Determination of Sets By Their Subset Sums

preprint2023arXivOpen access

Abstract

Let AA be a multiset with elements in an abelian group. Let FS(A)FS(A) be the multiset containing the 2∣A∣2^{|A|} sums of all subsets of AA. We study the reconstruction problem ``Given FS(A)FS(A), is it possible to identify AA?'', and we give a satisfactory answer for all abelian groups. We prove that, up to identifying multisets through a natural equivalence relation, the function A↦FS(A)A \mapsto FS(A) is injective (and thus the reconstruction problem is solvable) if and only if every order nn of a torsion element of the abelian group satisfies a certain number-theoretical property linked to the multiplicative group (Z/nZ)∗(\mathbb{Z} / n\mathbb{Z})^*. The core of the proof relies on a delicate study of the structure of cyclotomic units. Moreover, as a tool, we develop an inversion formula for a novel discrete Radon transform on finite abelian groups that might be of independent interest.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.