An asymptotic equality for the number of necklaces in a shuffle-exchange network

AbstractThe search for efficient bounds for VLSI problems has spawned an increasingly important research area. In this paper, we derive an asymptotic equality for the number of necklaces in a shuffle-exchange network, and provide a formula for the number of necklaces of a given length. This symptotic equality for the number of necklaces is an extension to Ullman's result reported in [2]