Reconstructing Subsets of Zn

In this paper we consider the problem of reconstructing a subsetA?Zn, up to translation, from the collection of its subsets of sizek, given up to translation (itsk-deck). Results of Alon, Caro, Krasikov, and Roditty (1989,J. Combin. Theory Ser. B47, 153?161) show that this is possible providedk>log2n. Mnukhin (1992,Acta. Appl. Math.29, 83?117) showed that every subset of Znof sizekis reconstructible from its (k?1)-deck, providedk?4. We show that whennis prime every subset of Znis reconstructible from its 3-deck; that for arbitrarynalmost all subsets of Znn are reconstructible from their 3-decks; and that for anynevery subset of Znis reconstructible from its 9?(n)-deck, where?(n) is the number of distinct prime factors ofn. We also comment on analogous questions for arbitrary groups, in particular the cube Zn2. Our approach is to generalize the problem to that of reconstructing arbitrary rational functions on Zn. We prove?by analysing the interaction between the ideal structure of the group ring QZnand the operation of pointwise multiplication of functions?that with a suitable definition of deck every rational-valued function on Znis reconstructible from its 9?(n)-deck.

[1]  J. A. Bondy,et al.  Surveys in Combinatorics, 1991: “A Graph Reconstructor's Manual” , 1991 .

[2]  Robert L. Hemminger,et al.  Graph reconstruction - a survey , 1977, J. Graph Theory.

[3]  William Kocay.  A family of nonreconstructible hypergraphs , 1987, J. Comb. Theory, Ser. B.

[4]  Paul K. Stockmeyer.  A census of non-reconstructable digraphs, I: Six related families , 1981, J. Comb. Theory, Ser. B.

[5]  Ilia Krasikov,et al.  On a Reconstruction Problem for Sequences, , 1997, J. Comb. Theory A.

[6]  C. Colbourn,et al.  The CRC handbook of combinatorial designs , edited by Charles J. Colbourn and Jeffrey H. Dinitz. Pp. 784. $89.95. 1996. ISBN 0-8493-8948-8 (CRC). , 1997, The Mathematical Gazette.

[7]  E. Wright,et al.  An Introduction to the Theory of Numbers , 1939 .

[8]  V. B. Mnukhin,et al.  The k-orbit reconstruction and the orbit algebra , 1992 .

[9]  Noga Alon,et al.  Combinatorial reconstruction problems , 1989, J. Comb. Theory, Ser. B.

[10]  K. Brown,et al.  Graduate Texts in Mathematics , 1982 .

[11]  M. Pouzet,et al.  Application d'une propriété combinatoire des parties d'un ensemble aux groupes et aux relations , 1976 .

[12]  Dieter Kratsch,et al.  Towards the reconstruction of posets , 1994 .

[13]  Alex D. Scott,et al.  Reconstructing sequences , 1997, Discret. Math..

[14]  P. Erdös.  On a lemma of Littlewood and Offord , 1945 .

[15]  Daniel J. Kleitman,et al.  On a lemma of Littlewood and Offord on the distribution of certain sums , 1965 .