Related papers: Multivariable automatic arrays and transcendence

Let $f$ be an $E$-function (in Siegel's sense) not of the form $e^{\beta z}$, $\beta \in \overline{\mathbb{Q}}$, and let $\log$ denote any fixed determination of the complex logarithm. We first prove that there exists a finite set $S(f)$…

We prove an easy but interesting result about the linear independence of multiple zeta values of different weights.

We prove decidability results on the existence of constant subsequences of uniformly recurrent morphic sequences along arithmetic progressions. We use spectral properties of the subshifts they generate to give a first algorithm deciding…

We give a brief history of transcendental number theory, including Schanuel's conjecture (S). Assuming (S), we prove that if z and w are complex numbers, not 0 or 1, with z^w and w^z algebraic, then z and w are either both rational or both…

Nested (or meta-Fibonacci) recurrences, such as the recurrence used to define Hofstadter's Q-sequence, along with the digit-based recurrences that underlie automatic sequences are of interest from both number-theoretic and combinatorial…

Let A be a class of objects, equipped with an integer size such that for all n the number a(n) of objects of size n is finite. We are interested in the case where the generating fucntion sum_n a(n) t^n is rational, or more generally…

Let $r,m$ be positive integers. Let $0\le x <1$ be a rational number. Let $\Phi_s(x,z)$ be the $s$-th Lerch function $\sum_{k=0}^{\infty}\tfrac{z^{k+1}}{(k+x+1)^s}$ with $s=1,2,\ldots ,r$. When $x=0$, this is the polylogarithmic function.…

We propose a novel automata model over the alphabet of rational numbers, which we call register automata over the rationals (RA-Q). It reads a sequence of rational numbers and outputs another rational number. RA-Q is an extension of the…

We prove that the property of being closed (resp., palindromic, rich, privileged trapezoidal, balanced) is expressible in first-order logic for automatic (and some related) sequences. It therefore follows that the characteristic function of…

We show that the first-order logical theory of the binary overlap-free words (and, more generally, the ${\alpha}$-free words for rational ${\alpha}$, $2 < {\alpha} \leq 7/3$), is decidable. As a consequence, many results previously obtained…

We study the determinisation and unambiguisation problems of weighted automata over the rational field: Given a weighted automaton, can we determine whether there exists an equivalent deterministic, respectively unambiguous, weighted…

We show that sequences of positive integers whose ratios $a_n^2/a_{n+1}$ lie within a specific range are almost uniquely determined by their reciprocal sums. For instance, the Sylvester sequence is uniquely characterized as the only…

This is the first part of a work devoted to the study of linear Mahler systems in several variables from the perspective of transcendence and algebraic independence. We prove two main results concerning systems that are regular singular at…

We consider numbers of the form $S_\beta(\boldsymbol{u}):=\sum_{n=0}^\infty \frac{u_n}{\beta^n}$ for $\boldsymbol{u}=\langle u_n \rangle_{n=0}^\infty$ a Sturmian sequence over a binary alphabet and $\beta$ an algebraic number with…

We study probability distributions over free algebras of trees. Probability distributions can be seen as particular (formal power) tree series [Berstel et al 82, Esik et al 03], i.e. mappings from trees to a semiring K . A widely studied…

Consider the algebra Q<<x_1,x_2,...>> of formal power series in countably many noncommuting variables over the rationals. The subalgebra Pi(x_1,x_2,...) of symmetric functions in noncommuting variables consists of all elements invariant…

We study one variable meromorphic functions mapping a planar real algebraic set $A$ to another real algebraic set in the complex plane. By using the theory of Schwarz reflection functions, we show that for certain $A$, these meromorphic…

Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages L that assign to each word w a real number L(w). The value of an infinite word w is computed as the maximal…

We give some new results on algebraic independence within Mahler's method, including algebraic independence of values at transcendental points. We also give some new measures of algebraic independence for infinite series of numbers. In…

We propound the thesis that there is a limitation to the number of possible structures which are axiomatically endowed with identities involving operations. In the case of algebras with a binary operation satisfying a formally reducible (to…