Related papers: Mahler's method in several variables and finite au…

We study languages over infinite alphabets equipped with some structure that can be tested by recognizing automata. We develop a framework for studying such alphabets and the ensuing automata theory, where the key role is played by an…

After H\"older proved his classical theorem about the Gamma function, there has been a whole bunch of results showing that solutions to linear difference equations tend to be hypertranscendental i.e. they cannot be solution to an algebraic…

We prove a maximality theorem for one-parameter dynamical systems including multiplier one-parameter dynamical systems. Our main result is new even for one-parameter actions on commutative multiplier algebras including the algebra of…

In mathematics and engineering, control theory is concerned with the analysis of dynamical systems through the application of suitable control inputs. One of the prominent problems in control theory is controllability which concerns the…

We study existence and computability of finite bases for ideals of polynomials over infinitely many variables. In our setting, variables come from a countable logical structure A, and embeddings from A to A act on polynomials by renaming…

We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of a universal theory of automata operating on infinite objects. Let F be any set functor that preserves…

In this work, we extend modular techniques for computing Gr\"obner bases involving rational coefficients to (two-sided) ideals in free algebras. We show that the infinite nature of Gr\"obner bases in this setting renders the classical…

There is an increasing interest in applying recent advances in AI to automated reasoning, as it may provide useful heuristics in reasoning over formalisms in first-order, second-order, or even meta-logics. To facilitate this research, we…

In this paper we establish a multivariable non-commutative generalization of L\"owner's classical theorem from 1934 characterizing operator monotone functions as real functions admitting analytic continuation mapping the upper complex…

We show that a special case of the Feferman-Vaught composition theorem gives rise to a natural notion of automata for finite words over an infinite alphabet, with good closure and decidability properties, as well as several logical…

We consider a hierarchy of the natural type Hamiltonian systems of $n$ degrees of freedom with polynomial potentials separable in general ellipsoidal and general paraboloidal coordinates. We give a Lax representation in terms of $2\times 2$…

In 1990, Ku. Nishioka proved a fundamental theorem for Mahler's method, which is the analog of the Siegel-Shidlovskii theorem for Mahler functions. In this article, we establish a version of the theorem of Ku. Nishioka which is also valid…

Whereas proof assistants based on Higher-Order Logic benefit from external solvers' automation, those based on Type Theory resist automation and thus require more expertise. Indeed, the latter use a more expressive logic which is further…

Finsler's lemma is a classic mathematical result with applications in control and optimization. When the lemma is applied to parameter-dependent LMIs, as such those that arise from problems of robust stability, the extra variables…

We conjecture that bounded generalised polynomial functions cannot be generated by finite automata, except for the trivial case when they are periodic away from a finite set. Using methods from ergodic theory, we are able to partially…

The issue of non-perturbative background independent quantization of matrix models is addressed. The analysis is carried out by considering a simple matrix model which is a matrix extension of ordinary mechanics reduced to 0 dimension. It…

We consider systems of linear differential and difference equations \begin{eqnarray*} \partial Y(x) =A(x)Y(x), \sigma Y(x) =B(x)Y(x) \end{eqnarray*} with $\partial = \frac{d}{dx}$, $\sigma$ a shift operator $\sigma(x) = x+a$, $q$-dilation…

We give another proof of a result of Adamczewski and Bell concerning Mahler equations: A formal power series satisfying a $p-$ and a $q-$Mahler equation over ${\mathbb C}(x)$ with multiplicatively independent positive integers $p$ and $q$…

For the challenging task of modeling multivariate time series, we propose a new class of models that use dependent Mat\'ern processes to capture the underlying structure of data, explain their interdependencies, and predict their unknown…

The problem of characterizing which automatic sets of integers are stable is here solved. Given a positive integer $d$ and a subset $A\subseteq \mathbb{Z}$ whose set of representations base $d$ is recognized by a finite automaton, a…