2000 character limit reached
A density version of Cobham's theorem
Published 19 Oct 2017 in math.NT, cs.FL, and math.CO | (1710.07261v2)
Abstract: Cobham's theorem asserts that if a sequence is automatic with respect to two multiplicatively independent bases, then it is ultimately periodic. We prove a stronger density version of the result: if two sequences which are automatic with respect to two multiplicatively independent bases coincide on a set of density one, then they also coincide on a set of density one with a periodic sequence. We apply the result to a problem of Deshouillers and Ruzsa concerning the least nonzero digit of $n!$ in base $12$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.