English

Multivariable automatic arrays and transcendence

Number Theory 2026-04-15 v1 Combinatorics

Abstract

We study real numbers defined by multidimensional automatic arrays weighted by multiplicatively independent bases. Let a1,,ar2a_1, \dots, a_r\geq 2 be integers such that loga1,,logar\log a_1, \dots, \log a_r are Q\mathbb Q-linearly independent. Given bounded automatic sequences (pn(i))n0(p_n(i))_{n\geq 0} with i=1,,ri=1, \dots , r and a function f:ZrZf:\mathbb Z^r\rightarrow \mathbb Z, we consider the associated series α=n1,,nr0f(pn1(1),,pnr(r))a1n1arnr\alpha = \sum_{n_1,\dots,n_r \geq 0} \frac{f(p_{n_1}(1),\dots,p_{n_r}(r))}{a_1^{n_1}\cdots a_r^{n_r}}. Using combinatorial properties of automatic sequences and Schmidt's Subspace Theorem, we prove that α\alpha is either rational or transcendental. This extends a result of Adamczewski and Bugeaud to the multidimensional setting.

Keywords

Cite

@article{arxiv.2604.12468,
  title  = {Multivariable automatic arrays and transcendence},
  author = {Aadrita Paul and Anwesh Ray},
  journal= {arXiv preprint arXiv:2604.12468},
  year   = {2026}
}
R2 v1 2026-07-01T12:08:20.157Z