Pith. sign in

REVIEW 1 cited by

On The Determination of Sets By Their Subset Sums

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2301.04635 v2 pith:QM2D2RFW submitted 2023-01-11 math.NT math.COmath.GR

classification math.NTmath.COmath.GR
keywords abeliangroupgroupsmathbbmultisetproblemreconstructionsums
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

Let $A$ be a multiset with elements in an abelian group. Let $FS(A)$ be the multiset containing the $2^{|A|}$ sums of all subsets of $A$. We study the reconstruction problem ``Given $FS(A)$, is it possible to identify $A$?'', 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 \mapsto FS(A)$ is injective (and thus the reconstruction problem is solvable) if and only if every order $n$ of a torsion element of the abelian group satisfies a certain number-theoretical property linked to the multiplicative group $(\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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem

    math.CO 2024-12 conditional novelty 4.0 of 10

    Two deterministic algorithms are proposed for the (n,k)-complete hidden subset sum problem, including a symmetric-polynomial method with complexity O(sum p(u,<=k)^3 + binom(n,k)n) under non-singularity conditions.

Pith tools