Reconstructing subsets of \(\mathbb{Z}_n\)

DOI10.1006/jcta.1998.2870zbMath0909.05011OpenAlexW2059499591WikidataQ56213624 ScholiaQ56213624MaRDI QIDQ1269888

Alexander D. Scott, Andrew John Radcliffe

Publication date: 30 March 1999

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcta.1998.2870

zbMATH Keywords

reconstruction of shapes

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

Reconstructing under group actions. ⋮ Shotgun reconstruction in the hypercube ⋮ Set Reconstruction on the Hypercube ⋮ The combinatorial \(k\)-deck ⋮ Reconstructing infinite sets of integers ⋮ Reconstructing subsets of \(\mathbb{Z}_n\) ⋮ Discrete phase retrieval in musical structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A family of non-reconstructible hypergraphs
• Combinatorial reconstruction problems
• A census of non-reconstructable digraphs. I: Six related families
• The \(k\)-orbit reconstruction and the orbit algebra
• Application d'une propriété combinatoire des parties d'un ensemble aux groupes et aux rélations
• Reconstructing subsets of \(\mathbb{Z}_n\)
• On a reconstruction problem for sequences
• Reconstructing sequences
• Towards the reconstruction of posets
• On a lemma of Littlewood and Offord on the distribution of certain sums
• Graph reconstruction—a survey
• On a lemma of Littlewood and Offord