We consider the problem of reconstructing a set of real numbers up to translation from the multiset of its subsets of fixed size, given up to translation. This is impossible in general: for instance almost all subsets of Z contain infinitely many translates of every finite subset of Z. We therefore restrict our attention to subsets of R which are locally finite; those which contain only finitely many translates of any given finite set of size at least 2. We prove that every locally finite subset of R is reconstructible from the multiset of its 3-subsets, given up to translatio
AbstractTwo multirelations M and M′ on the same set E are hypomorphic when for every element x of E,...
A reconstruction problem is formulated for multisets over commutative groupoids. The cards of a mult...
AbstractThe reconstruction number of a graph is the smallest number of vertex-deleted subgraphs need...
We consider the problem of reconstructing a set of real numbers up to translation from the multiset ...
We consider the problem of reconstructing a set of real numbers up to translation from the multiset ...
We prove that every finite subset of the plane is reconstructible from the multiset of its subsets o...
AbstractIn this paper we consider the problem of reconstructing a subsetA⊂Zn, up to translation, fro...
Partially supported by NSF Grant DMS-9401351 In this paper we consider the problem of reconstructing...
Set reconstruction on the hypercube, Discrete Analysis 2017:17, 10 pp. A well-known open problem in...
AbstractFor a set of integers A⊆Z and k⩾1 the k-deck of A is the function dA,k defined on sets S of ...
AbstractFor some finite set A of points in Rn and some integer k∈N we consider the problem of recons...
AbstractWe give a complete answer to a question raised by Harary and Manvel in 1972 (Bull. Soc. Math...
AbstractA theorem in convex bodies (in fact, measure theory) and a theorem about translates of sets ...
A set A of natural numbers is finitely embeddable in another such set B if every finite subset of A ...
In this paper we study the encoding $\mathbb{R}_A(x) = \sum_{y\in x} 2^{-\mathbb{R}_A(y)}$, m...
AbstractTwo multirelations M and M′ on the same set E are hypomorphic when for every element x of E,...
A reconstruction problem is formulated for multisets over commutative groupoids. The cards of a mult...
AbstractThe reconstruction number of a graph is the smallest number of vertex-deleted subgraphs need...
We consider the problem of reconstructing a set of real numbers up to translation from the multiset ...
We consider the problem of reconstructing a set of real numbers up to translation from the multiset ...
We prove that every finite subset of the plane is reconstructible from the multiset of its subsets o...
AbstractIn this paper we consider the problem of reconstructing a subsetA⊂Zn, up to translation, fro...
Partially supported by NSF Grant DMS-9401351 In this paper we consider the problem of reconstructing...
Set reconstruction on the hypercube, Discrete Analysis 2017:17, 10 pp. A well-known open problem in...
AbstractFor a set of integers A⊆Z and k⩾1 the k-deck of A is the function dA,k defined on sets S of ...
AbstractFor some finite set A of points in Rn and some integer k∈N we consider the problem of recons...
AbstractWe give a complete answer to a question raised by Harary and Manvel in 1972 (Bull. Soc. Math...
AbstractA theorem in convex bodies (in fact, measure theory) and a theorem about translates of sets ...
A set A of natural numbers is finitely embeddable in another such set B if every finite subset of A ...
In this paper we study the encoding $\mathbb{R}_A(x) = \sum_{y\in x} 2^{-\mathbb{R}_A(y)}$, m...
AbstractTwo multirelations M and M′ on the same set E are hypomorphic when for every element x of E,...
A reconstruction problem is formulated for multisets over commutative groupoids. The cards of a mult...
AbstractThe reconstruction number of a graph is the smallest number of vertex-deleted subgraphs need...