Related papers: $\mathbb{N}$-polyregular functions arise from well…
Sequentiable structures are a subclass of monoids that generalise the free monoids and the monoid of non-negative real numbers with addition. In this paper we consider functions $f:\Sigma^*\rightarrow {\cal M}$ and define the Myhill-Nerode…
We study the polyregular string-to-string functions, which are certain functions of polynomial output size that can be described using automata and logic. We describe a system of combinators that generates exactly these functions. Unlike…
A general notion of a quasi-finite algebra is introduced as an algebra graded by the set of all integers equipped with topologies on the homogeneous subspaces satisfying certain properties. An analogue of the regular bimodule is introduced…
An algebra is finitely related (or has finite degree) if its term functions are determined by some finite set of finitary relations. Nilpotent monoids built from words, via Rees quotients of free monoids, have been used to exhibit many…
In [arXiv 0811.3913] the authors introduced the notion of quasi-polynomial function as being a mapping f: X^n -> X defined and valued on a bounded chain X and which can be factorized as f(x_1,...,x_n)=p(phi(x_1),...,phi(x_n)), where p is a…
Polyregular functions form a robust class of string-to-string functions with polynomial growth, as evidenced by Bojanczyk (2018). This class admits numerous descriptions and enjoys several closure properties. Most notably, polyregular…
The norm closure of the algebra generated by the set $\{n\mapsto {\lambda}^{n^k}:$ $\lambda\in{\mathbb {T}}$ and $k\in{\mathbb{N}}\}$ of functions on $({\mathbb {Z}}, +)$ was studied in \cite{S} (and was named as the Weyl algebra). In this…
This work proposes a unified theory of regularity in one hypercomplex variable: the theory of $T$-regular functions. In the special case of quaternion-valued functions of one quaternionic variable, this unified theory comprises…
A function on a discrete group is weakly combable if its discrete derivative with respect to a combing can be calculated by a finite state automaton. A weakly combable function is bicombable if it is Lipschitz in both the left and right…
We study the complexity classes P and NP through a semigroup fP ("polynomial-time functions"), consisting of all polynomially balanced polynomial-time computable partial functions. Then P is not equal to NP iff fP is a non-regular…
Expanding upon recent work, a new class of $A$-functions is introduced that can be viewed as an appropriate generalization of the class of regular $A$-functions, the class of structured $A$-functions, and the class of perfect $A$-functions.…
In this thesis we use quasiorders on words to offer a new perspective on two well-studied problems from Formal Language Theory: deciding language inclusion and manipulating the finite automata representations of regular languages. First, we…
For a class of symplectic manifolds, we introduce a functional which assigns a real number to any pair of continuous functions on the manifold. This functional has a number of interesting properties. On the one hand, it is Lipschitz with…
Given a set I of word, the set of all words obtained by the shuffle of (copies of) words of I is naturally provided with a partial order. In [FS05], the authors have opened the problem of the characterization of the finite sets I such that…
There exist very lucid explanations of the combinatorial origins of rational and algebraic functions, in particular with respect to regular and context free languages. In the search to understand how to extend these natural correspondences,…
In this paper, we are concerned with the S-polyregularity the regular dot product of slice regular functions. We prove that the product of a slice regular function and right quaternionic polynomial function is a S-polyregular function and…
We introduce and study the defect function associated to a pair of filtrations of ideals, which generalizes the symbolic defect of ideals. Under the assumption that the Rees algebra of one filtration is Noetherian and that a natural graded…
Functorial semi-norms are semi-normed refinements of functors such as singular (co)homology. We investigate how different types of representability affect the (non-)triviality of finite functorial semi-norms on certain functors or classes.…
We study seminormalization of affine complex varieties. We show that polynomials on the seminormalization correspond to the rational functions which are continuous for the Euclidean topology. We further study this type of functions which…
You can invent striking and challenging problems with unique solution by building some symmetry into functional equations. Some are suitable for high school; others could generate college-level projects involving computer algebra. The…