Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2)

✍ Scribed by Kevin Cattell; Frank Ruskey; Joe Sawada; Micaela Serra; C.Robert Miers

• Book ID: 102573650
• Publisher: Elsevier Science
• Year: 2000
• Tongue: English
• Weight: 114 KB
• Volume: 37
• Category: Article
• ISSN: 0196-6774
• DOI: 10.1006/jagm.2000.1108

✦ Synopsis

Many applications call for exhaustive lists of strings subject to various constraints, such as inequivalence under group actions. A k-ary necklace is an Ž . equivalence class of k-ary strings under rotation the cyclic group . A k-ary unlabeled necklace is an equivalence class of k-ary strings under rotation and permutation of alphabet symbols. We present new, fast, simple, recursive algo-Ž . rithms for generating i.e., listing all necklaces and binary unlabeled necklaces. These algorithms have optimal running times in the sense that their running times are proportional to the number of necklaces produced. The algorithm for generating necklaces can be used as the basis for efficiently generating many other equivalence classes of strings under rotation and has been applied to generating bracelets, fixed density necklaces, and chord diagrams. As another application, we describe the implementation of a fast algorithm for listing all degree n irreducible Ž . and primitive polynomials over GF 2 .