Hostname: page-component-745bb68f8f-kw2vx Total loading time: 0 Render date: 2025-02-11T01:53:24.018Z 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)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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

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