Related papers: Z-polyregular functions

In this paper, we prove the existence of a first-order definition of the polynomial ring over a nonprincipal ultraproduct of finite fields of unbounded cardinalities in its fraction field by a universal-existential formula in the language…

Let K be an expansion of either an ordered field or a valued field. Given a definable set X $\subseteq$ K^m let C(X) be the ring of continuous definable functions from X to K. Under very mild assumptions on the geometry of X and…

Recently, it was shown that any theory of strings containing the string-replace function (even the most restricted version where pattern/replacement strings are both constant strings) becomes undecidable if we do not impose some kind of…

We develop further the consequences of the irreducible-Boolean classification established in Ref. [9]; which have the advantage of allowing strong statistical calculations in disordered Boolean function models, such as the…

We contribute to the refined understanding of the language-logic-algebra interplay in the context of first-order properties of countable words. We establish decidable algebraic characterizations of one variable fragment of FO as well as…

We show that for any $i > 0$, it is decidable, given a regular language, whether it is expressible in the $\Sigma_i[<]$ fragment of first-order logic FO[<]. This settles a question open since 1971. Our main technical result relies on the…

Interpretation methods and their restrictions to polynomials have been deeply used to control the termination and complexity of first-order term rewrite systems. This paper extends interpretation methods to a pure higher order functional…

We prove two conjectures regarding the representation growth of groups of type $A_2$. The first, conjectured by Avni, Klopsch, Onn and Voll, regards the uniformity of representation zeta functions over local complete discrete valuation…

For R(z, w) rational with complex coefficients, of degree at least 2 in w, we show that the number of rational functions f(z) solving the difference equation f(z+1)=R(z, f(z)) is finite and bounded just in terms of the degrees of R in 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…

Transformers trained on huge text corpora exhibit a remarkable set of capabilities, e.g., performing basic arithmetic. Given the inherent compositional nature of language, one can expect the model to learn to compose these capabilities,…

This paper provides a new and more direct proof of the assertion that a Turing computable function of the natural numbers is primitive recursive if and only if the time complexity of the corresponding Turing machine is bounded by a…

Functional MSO transductions, deterministic two-way transducers, as well as streaming string transducers are all equivalent models for regular functions. In this paper, we show that every regular function, either on finite words or on…

We establish an irreducibility property for the characters of finite dimensional, irreducible representations of simple Lie algebras (or simple algebraic groups) over the complex numbers, i.e., that the characters of irreducible…

This paper investigates second-order representations in the sense of Kawamura and Cook for spaces of integrable functions that regularly show up in analysis. It builds upon prior work about the space of continuous functions on the unit…

We study a natural measurable selection problem for which the standard uniformisation theorems do not seem to apply directly, yet a Borel selector exists. More precisely, we consider families of finite dimensional functions that admit…

The goal of this note is to bring attention to an interesting family of rings: the rings of $\mathbb Z$-valued functions on $\mathbb Z$ and, more generally, infinite subsets of $\mathbb Z$ whose restrictions to all finite sets are given by…

The notion of a real-valued function is central to mathematics, computer science, and many other scientific fields. Despite this importance, there are hardly any positive results on decision procedures for predicate logical theories that…

In this paper we continue to study the Reidemeister zeta function. We prove P\'olya -- Carlson dichotomy between rationality and a natural boundary for analytic behavior of the Reidemeister zeta function for a large class of automorphisms…

Fast-growing hierarchies are sequences of functions obtained through various processes similar to the ones that yield multiplication from addition, exponentiation from multiplication, etc. We observe that fast-growing hierarchies can be…