
AbstractWe use a theorem of Loxton and van der Poorten to prove the transcendence of certain real numbers defined by digit patterns. Among the results we prove are the following. If k is an integer at least 2, P is any nonzero pattern of digits base k, and counts the number of occurrences (mod r) of p in the base k representation of n, then is transcendental except when k = 3, P = 1 and r = 2. When (r, k − 1) = 1 the linear span of the numbers has infinite dimension over Q, where P ranges over all patterns base k without leading zeros.
occurrence of digital patterns, Automata sequences, Loxton-van der Poorten-theorem, Transcendence (general theory), automatic sequences, digits, Radix representation; digital problems, transcendence
occurrence of digital patterns, Automata sequences, Loxton-van der Poorten-theorem, Transcendence (general theory), automatic sequences, digits, Radix representation; digital problems, transcendence
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 7 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
