Sur les entiers qui s'écrivent simplement en différentes bases. (On integers simply represented in different bases) (Q1117968): Difference between revisions

This paper gives an interpretation of results of \textit{C. L. Stewart} [J. Reine Angew. Math. 319, 63-72 (1980; Zbl 0426.10008)] on the simultaneous representation of integers in different bases, in the terminology of formal languages. Also some generalizations of these results are given. One of the results the author proves is the following: Let a,b be positive, multiplicatively independent integers. Two more positive integers k and \(\ell\) are given. Let \(u,u'\) be words over the alphabet \(\{\) 0,1,...,a-1\(\}\) and let \(v,v'\) be likewise over \(\{\) 0,1,...,b- 1\(\}\). Then an effectively computable integer \(N=N\{a,b,u,u',v,v',k,\ell)\) exists such that if \(n\in {\mathbb{N}}\) can be represented in the base of a as \((n)_ a=u'u^ mw_ 1\quad with\quad k | u'u^ m| \geq | w_ 1|\) and in the base of b as \((n)_ b=v'v^ nw_ 2\) with \(\ell | v'v^ n| \geq | w_ 2|,\) then n is bounded by N. The tools needed to prove this and other related effective results are based on Baker's theory of linear forms in logarithms of algebraic numbers.