Related papers: Mahler's method in several variables and finite au…
This paper considers finite-automata based algorithms for handling linear arithmetic with both real and integer variables. Previous work has shown that this theory can be dealt with by using finite automata on infinite words, but this…
In this paper we study the existence of higher dimensional arithmetic progression in Meyer sets. We show that the case when the ratios are linearly dependent over $\ZZ$ is trivial, and focus on arithmetic progressions for which the ratios…
We present a new method for algebraic independence results in the context of Mahler's method. In particular, our method uses the asymptotic behaviour of a Mahler function $f(z)$ as $z$ goes radially to a root of unity to deduce algebraic…
Let $b \ge 2$ be an integer. We prove that the $b$-adic expansion of every irrational algebraic number cannot have low complexity. Furthermore, we establish that irrational morphic numbers are transcendental, for a wide class of morphisms.…
A recently proposed axiom system for Andr\'e's central translation structures is improved upon. First, one of its axioms turns out to be dependent (derivable from the other axioms). Without this axiom, the axiom system is indeed…
Bell's theorem is reformulated and proved in the pure mathematical terms of automata theory, avoiding any physical or ontological notions. It is stated that no pair of finite probabilistic sequential machines can reproduce in its output the…
The last years have seen a growing interest from mathematicians in Mahler functions. This class of functions includes the generating series of the automatic sequences. The present paper is concerned with the following problem, which is…
Multidimensional systems are becoming increasingly important as they provide a promising tool for estimation, simulation and control, while going beyond the traditional setting of one-dimensional systems. The analysis of multidimensional…
We show that for almost every polynomial P(x,y) with complex coefficients, the difference of the logarithmic Mahler measures of P(x,y) and P(x,x^n) can be expanded in a type of formal series similar to an asymptotic power series expansion…
We provide a simple and efficient numerical criterion to verify the Iwasawa main conjecture and the indivisibility of derived Kato's Euler systems for modular forms of weight two at any good prime under mild assumptions. In the ordinary…
The paper studies algebraic independence of certain reciprocal sums of Fibonacci and Lucas sequences. Also more general binary recurrences are considered. The main tool is Mahler's method reducing the investigation of the algebraic…
We consider a continuous analogue of Babai et al.'s and Cai et al.'s problem of solving multiplicative matrix equations. Given $k+1$ square matrices $A_{1}, \ldots, A_{k}, C$, all of the same dimension, whose entries are real algebraic, we…
The paper introduces a generalization for known probabilistic models such as log-linear and graphical models, called here multiplicative models. These models, that express probabilities via product of parameters are shown to capture…
We provide a method, based on automata theory, to mechanically prove the correctness of many numeration systems based on Fibonacci numbers. With it, long case-based and induction-based proofs of correctness can be replaced by simply…
The basic concepts of non-commutative probability theory are reviewed and applied to the large $N$ limit of matrix models. We argue that this is the appropriate framework for constructing the master field in terms of which large $N$…
We develop a new tool, namely polynomial and linear algebraic methods, for studying systems of word equations. We illustrate its usefulness by giving essentially simpler proofs of several hard problems. At the same time we prove extensions…
We show that Csanky's fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LAP from the principle of linear independence. LAP is a natural…
The paper continues the authors' study of the linearizability problem for nonlinear control systems. In the recent work [K. Sklyar, Systems Control Lett. 134 (2019), 104572], conditions on mappability of a nonlinear control system to a…
If $\alpha$ is a non-zero algebraic number, we let $m(\alpha)$ denote the Mahler measure of the minimal polynomial of $\alpha$ over $\mathbb Z$. A series of articles by Dubickas and Smyth, and later by the author, develop a modified version…
Generalizations of linear numeration systems in which the set of natural numbers is recognizable by finite automata are obtained by describing an arbitrary infinite regular language following the lexicographic ordering. For these systems of…