Hostname: page-component-8448b6f56d-42gr6 Total loading time: 0 Render date: 2024-04-18T03:59:57.545Z Has data issue: false hasContentIssue false
  • English
  • Français

Reconstructing Odd Necklaces

Published online by Cambridge University Press:  01 July 2007

LUKE PEBODY
LUKE PEBODY*
Affiliation:
Trinity College, Cambridge CB2 1TQ, UK (e-mail: ltp1000@cam.ac.uk)
Get access Rights & Permissions [Opens in a new window]

Abstract

Improving upon work in [2], the precise value of the set reconstruction number is given for all cyclic groups of odd order.

Type
Paper
Information
Combinatorics, Probability and Computing , Volume 16 , Issue 4 , July 2007 , pp. 503 - 514
Copyright
Copyright © Cambridge University Press 2007

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1]Alon, N., Caro, Y., Krasikov, I. and Roditty, Y. (1989) Combinatorial reconstruction problems. J. Combin. Theory Ser. B 47 153–161.Google Scholar
[2]Pebody, L. (2004) The reconstructibility of finite abelian groups. Combin. Probab. Comput. 13 867–892.Google Scholar
[3]Radcliffe, A. J. and Scott, A. D. (1998) Reconstructing subsets of . J. Combin. Theory Ser. A 83 167–198.Google Scholar