English

Discriminators and k-Regular Sequences

Discrete Mathematics 2016-06-16 v2 Formal Languages and Automata Theory Number Theory

Abstract

The discriminator of an integer sequence s = (s(i))_{i >=0}, introduced by Arnold, Benkoski, and McCabe in 1985, is the map D_s(n) that sends n >= 1 to the least positive integer m such that the n numbers s(0), s(1), ..., s(n-1) are pairwise incongruent modulo m. In this note we consider the discriminators of a certain class of sequences, the k-regular sequences. We compute the discriminators of two such sequences, the so-called "evil" and "odious" numbers, and show they are 2-regular. We also give an example of a k-regular sequence whose discriminator is not k-regular. Finally, we examine sequences that are their own discriminators, and count the number of length-nn finite sequences with this property.

Cite

@article{arxiv.1605.00092,
  title  = {Discriminators and k-Regular Sequences},
  author = {Sajed Haque and Jeffrey Shallit},
  journal= {arXiv preprint arXiv:1605.00092},
  year   = {2016}
}
R2 v1 2026-06-22T13:45:17.264Z