Reconstructing Subsets of Zn
نویسندگان
چکیده
In this paper we consider the problem of reconstructing a subset A ⊂ Z n , up to translation, from the collection of its subsets of size k, given up to translation (its k-deck). Results of Alon, Caro, Krasikov, and Roditty [1] show that this is possible provided k > log 2 n. Mnukhin [10] showed that every subset of Z n of size k is reconstructible from its (k − 1)-deck, provided k ≥ 4. We show that when n is prime every subset of Z n is reconstructible from its 3-deck; that for arbitrary n almost all subsets of Z n are reconstructible from their 3-decks; and that for any n every subset of Z n is reconstructible from its 9α(n)-deck, where α(n) is the number of distinct prime factors of n. We also comment on analogous questions for arbitrary groups, in particular the cube Z n 2. Our approach is to generalize the problem to that of reconstructing arbitrary rational functions on Z n. We prove — by analysing the interaction between the ideal structure of the group ring Q Z n and the operation of pointwise multiplication of functions — that with a suitable definition of deck every rational-valued function on Z n is reconstructible from its 9α(n)-deck.
منابع مشابه
Reconstructing Subsets of Reals
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 finitel...
متن کاملAn Algorithm for Reconstructing Special Lattice Sets from Their Approximate X-Rays
We study the problem of reconstructing finite subsets of the integer lattice Z from their approximate X-rays in a finite number of prescribed lattice directions. We provide a polynomial-time algorithm for reconstructing Q-convex sets from their “approximate” X-rays. A Qconvex set is a special subset of Z having some convexity properties. This algorithm can be used for reconstructing convex subs...
متن کاملMULTIPLICATIVE GROUPS IN Zm
Our goal will be to find subsets of Zm that form groups under the operation of multiplication modulo m. By utilizing the isomorphism Zm ∼= Zn ⊕ Zk, we will find multiplicative groups contained in Zn ⊕ Zk and then map these back to Zm. In particular, if m = nk with gcd(n, k) = 1, our objective is to find particular multiplicative subsets of Zn × Zk that are groups and whose first coordinate is a...
متن کاملZinc supplementation has no effect on circulating levels of peripheral blood leucocytes and lymphocyte subsets in healthy adult men.
As a result of evidence documenting harmful effects of Zn supplementation on immune function and Cu status, thirty-eight men were recruited onto a Zn supplementation trial. The aim was to examine the effects of chronic Zn supplementation on circulating levels of peripheral blood leucocytes and lymphocyte subsets. Subjects (n 19) took 30 mg Zn/d for 14 weeks followed by 3 mg Cu/d for 8 weeks to ...
متن کاملAn algorithm reconstructing convex lattice sets
In this paper, we study the problem of reconstructing special lattice sets from X-rays in a finite set of prescribed directions. We present the class of “Q-convex” sets which is a new class of subsets of Z2 having a certain kind of weak connectedness. The main result of this paper is a polynomial-time algorithm solving the reconstruction problem for the “Q-convex” sets. These sets are uniquely ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 83 شماره
صفحات -
تاریخ انتشار 1998