Related papers: The commutativity problem for effective varieties …
We study the model-checking problem for recursion schemes: does the tree generated by a given higher-order recursion scheme satisfy a given logical sentence. The problem is known to be decidable for sentences of the MSO logic. We prove…
Deciding formulas mixing arithmetic and uninterpreted predicates is of practical interest, notably for applications in verification. Some decision procedures consist in building by structural induction an automaton that recognizes the set…
We introduce the notion of idempotent variables for studying equations in inverse monoids. It is proved that it is decidable in singly exponential time (DEXPTIME) whether a system of equations in idempotent variables over a free inverse…
A finitary automaton group is a group generated by an invertible, deterministic finite-state letter-to-letter transducer whose only cycles are self-loops at an identity state. We show that, for this presentation of finite groups, the…
We investigate commutative analogues of Clifford algebras -- algebras whose generators square to $\pm1$ but commute, instead of anti-commuting as they do in Clifford algebras. We observe that commutativity allows for elegant results. We…
Transfer learning has recently become the dominant paradigm of machine learning. Pre-trained models fine-tuned for downstream tasks achieve better performance with fewer labelled examples. Nonetheless, it remains unclear how to develop…
In this paper, we investigate the problem of synthesizing computable functions of infinite words over an infinite alphabet (data $\omega$-words). The notion of computability is defined through Turing machines with infinite inputs which can…
We show that various aspects of k-automatic sequences -- such as having an unbordered factor of length n -- are both decidable and effectively enumerable. As a consequence it follows that many related sequences are either k-automatic or…
For a fixed countably infinite structure \Gamma\ with finite relational signature \tau, we study the following computational problem: input are quantifier-free \tau-formulas \phi_0,\phi_1,...,\phi_n that define relations R_0,R_1,...,R_n…
Let $(\FormR)$ be a form ring such that $A$ is quasi-finite $R$-algebra (i.e., a direct limit of module finite algebras) with identity. We consider the hyperbolic Bak's unitary groups $\GU(2n,\FormR)$, $n\ge 3$. For a form ideal…
We present a concept of uniform encodability of theories and develop tools related to this concept. As an application we obtain general undecidability results which are uniform for large families of structures. In the way, we define…
This article studies the equation $[A,B]^k = {\rm Id}_n$ for matrices over $\mathbb{C}$, characterizing the pairs $(k,n)$ for which solutions exist via a classical result of Lam and Leung on sums of roots of unity. The problem is next…
Quantum advantage is notoriously hard to find and even harder to prove. For example the class of functions computable with classical physics actually exactly coincides with the class computable quantum-mechanically. It is strongly believed,…
The problem if a given configuration of a pushdown automaton (PDA) is bisimilar with some (unspecified) finite-state process is shown to be decidable. The decidability is proven in the framework of first-order grammars, which are given by…
All known structural extensions of the substructural logic $\mathsf{FL_e}$, Full Lambek calculus with exchange/commutativity, (corresponding to subvarieties of commutative residuated lattices axiomatized by $\{\vee, \cdot, 1\}$-equations)…
The synthesis problem asks to automatically generate, if it exists, an algorithm from a specification of correct input-output pairs. In this paper, we consider the synthesis of computable functions of infinite words, for a classical Turing…
We study rings over which an analogue of the Weierstrass preparation theorem holds for power series. We show that a commutative ring $R$ admits a factorization of every power series in $R[[x]]$ as the product of a polynomial and a unit if…
We consider modules E over a C*-algebra A which are equipped with a map into A_+ that has the formal properties of a norm. We completely determine the structure of these modules. In particular, we show that if A has no nonzero commutative…
Adopting the approach of [7] we study rational function carrying invariant line fields on the Julia set. In particular, we show that under certain weak conditions all possible measurable invariant line fields of a rational function on its…
We say that a list $\Lambda =\{ \lambda _{1},\ldots ,\lambda _{n}\}$ of complex numbers is realizable, if it is the spectrum of a nonnegative matrix $A$ (the realizing matrix). We say that $\Lambda $ is universally realizable if it is…