English

Random Feedback Shift Registers, and the Limit Distribution for Largest Cycle Lengths

Combinatorics 2022-07-26 v4

Abstract

For a random binary noncoalescing feedback shift register of width nn, with all 22n12^{2^{n-1}} possible feedback functions ff equally likely, the process of long cycle lengths, scaled by dividing by N=2nN=2^n, converges in distribution to the same Poisson-Dirichlet limit as holds for random permutations in SN\mathcal{S}_N, with all N!N! possible permutations equally likely. Such behavior was conjectured by Golomb, Welch, and Goldstein in 1959.

Cite

@article{arxiv.1903.09183,
  title  = {Random Feedback Shift Registers, and the Limit Distribution for Largest Cycle Lengths},
  author = {Richard Arratia and E. Rodney Canfield and Alfred W. Hales},
  journal= {arXiv preprint arXiv:1903.09183},
  year   = {2022}
}

Comments

42 pages; 21 references, 7 sections. The cover date, July 22 2022, is hard-wired. Revised proof for Lemma 3, and a few other minor changes

R2 v1 2026-06-23T08:15:30.219Z