相关论文: Finite automata and algebraic extensions of functi…

This article summarises the theory of several bounded functional calculi for unbounded operators that have recently been discovered. The extend the Hille--Phillips calculus for (negative) generators $A$ of certain bounded $C_0$-semigroups,…

The classical theory of free analysis generalizes the noncommutative (nc) polynomials and rational functions, easily providing such results as an nc analogue of the Jacobian conjecture. However, the classical theory misses out on important…

We extend the classical Stallings theory (describing subgroups of free groups as automata) to direct products of free and abelian groups: after introducing enriched automata (i.e., automata with extra abelian labels), we obtain an explicit…

Let $\sum a_nx^n\in\bar{\mathbb{Q}}[[x]]$ be the power series representation of a rational function and let $f:\ \{0,1,\ldots\}\rightarrow \bar{\mathbb{Q}}$ be a so-called almost quasi-polynomial. Under a necessary stability condition, we…

We investigate the rational approximation of fractional powers of unbounded positive operators attainable with a specific integral representation of the operator function. We provide accurate error bounds by exploiting classical results in…

We introduce a new geometric tool for analyzing groups of finite automata. To each finite automaton we associate a square complex. The square complex is covered by a product of two trees iff the automaton is bi-reversible. Using this method…

We prove several results on backward orbits of rational functions over number fields. First, we show that if $K$ is a number field, $\phi\in K(x)$ and $\alpha\in K$ then the extension of $K$ generated by the abelian points in the backward…

We construct an explicit filtration of the ring of algebraic power series by finite dimensional constructible sets, measuring the complexity of these series. As an application, we give a bound on the dimension of the set of algebraic power…

For an algebraic number $\alpha$ we consider the orders of the reductions of $\alpha$ in finite fields. In the case where $\alpha$ is an integer, it is known by the work on Artin's primitive root conjecture that the order is "almost always…

We work with semi-algebraic functions on arbitrary real closed fields. We generalize the notion of critical values and prove a Sard type theorem in our framework.

We offer an axiomatic definition of a differential algebra of generalized functions over an algebraically closed non-Archimedean field. This algebra is of {\em Colombeau type} in the sense that it contains a copy of the space of Schwartz…

Let F be a global function field with constant field $\mathbb{F}_q$. Let G be a reductive group over $\mathbb{F}_q$. We establish a variant of Arthur's truncated kernel for G and for its Lie algebra which generalizes Arthur's original…

Saturation is a fundamental game-semantic property satisfied by strategies that interpret higher-order concurrent programs. It states that the strategy must be closed under certain rearrangements of moves, and corresponds to the intuition…

We present a compositional algebraic framework to describe the evolution of quantum fields in discretised spacetimes. We show how familiar notions from Relativity and quantum causality can be recovered in a purely order-theoretic way from…

We extend to the context of algebraic groups a classic result on extensions of abstract groups relating the set of isomorphism classes of extensions of $G$ by $H$ with that of extensions of $G$ by the center $Z$ of $H$. The proof should be…

We consider one-dimensional cellular automata $F_{p,q}$ which multiply numbers by $p/q$ in base $pq$ for relatively prime integers $p$ and $q$. By studying the structure of traces with respect to $F_{p,q}$ we show that for $p\geq 2q-1$ (and…

Traditionally, finite automata theory has been used as a framework for the representation of possibly infinite sets of strings. In this work, we introduce the notion of second-order finite automata, a formalism that combines finite automata…

We consider application of the analytic functional approach to the conformal field theories associated with mean field theory and Wilson-Fisher fixed point. We study the constraints imposed by the crossing symmetry on the coefficients of…

We introduce presheaf automata as a generalisation of different variants of higher-dimensional automata and other automata-like formalisms, including Petri nets and vector addition systems. We develop the foundations of a language theory…

We introduce a logic to express structural properties of automata with string inputs and, possibly, outputs in some monoid. In this logic, the set of predicates talking about the output values is parametric, and we provide sufficient…