Article (Scientific journals)
On the Recognizability of Self-Generating Sets
Kärki, Tomi; Lacroix, Anne; Rigo, Michel
2010In Journal of Integer Sequences, 13, p. 10.2.2
Peer reviewed
 

Files


Full Text
sg-JIS-20100118.pdf
Author preprint (204.66 kB)
Request a copy

All documents in ORBi are protected by a user license.

Send to



Details



Keywords :
numeration system; self-generating set; Cobham's theorem; automatic sequences; syndeticity
Abstract :
[en] Let I be a finite set of integers and F be a finite set of maps of the form n->k_i n + l_i with integer coefficients. For an integer base k>=2, we study the k-recognizability of the minimal set X of integers containing I and satisfying f(X)\subseteq X for all f in F. In particular, solving a conjecture of Allouche, Shallit and Skordev, we show under some technical conditions that if two of the constants k_i are multiplicatively independent, then X is not k-recognizable for any k>=2.
Disciplines :
Mathematics
Computer science
Author, co-author :
Kärki, Tomi
Lacroix, Anne ;  Université de Liège - ULiège > Département de mathématique > Mathématiques discrètes
Rigo, Michel  ;  Université de Liège - ULiège > Département de mathématique > Mathématiques discrètes
Language :
English
Title :
On the Recognizability of Self-Generating Sets
Publication date :
2010
Journal title :
Journal of Integer Sequences
eISSN :
1530-7638
Publisher :
University of Waterloo, Canada
Volume :
13
Pages :
Article 10.2.2
Peer reviewed :
Peer reviewed
Commentary :
Concerned with sequences A000045, A000201, A001950, A003754, A003849, A052499.
Available on ORBi :
since 22 January 2010

Statistics


Number of views
78 (9 by ULiège)
Number of downloads
4 (3 by ULiège)

Scopus citations®
 
2
Scopus citations®
without self-citations
1

Bibliography


Similar publications



Contact ORBi