Related papers: Commutative N-polyregular functions
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 introduce the new notion of a conjugate weight function and provide a detailed study of this operation and its properties. Then we apply this knowledge to study classes of ultradifferentiable functions defined in terms of fast growing…
This is a proceedings article reviewing a recent combinatorial construction of the su(n) WZNW fusion ring by C. Stroppel and the author. It contains one novel aspect: the explicit derivation of an algorithm for the computation of fusion…
To factorize and to decompose the graphs of representative functions on the free monoid X * (generated by the alphabet X ) with values in the ring A containing Q, we examine various products of series (as concatenation, shuffle and its…
The intensive study of Rota-Baxter operators on the polynomial algebra $F[x]$ has been started with the work of S.H. Zheng, L. Guo, and M. Rosenkranz (2015). We deal with the case of two variables and monomial Rota-Baxter operators of…
Long before we learn to construct the field of rational numbers (out of the ring of integers) at university, we learn how to calculate with fractions at school. When it comes to "numbers", we are used to a commutative multiplication, for…
This is the second of two coupled papers estimating the mean values of multiplicative functions, of unknown support, on arithmetic progressions with large differences. Applications are made to the study of primes in arithmetic progression…
Our previous work dealt with the zeta function for the interacting particle system (IPS) including quantum cellular automaton (QCA) as a typical model in the study of ``IPS/Zeta Correspondence". On the other hand, the absolute zeta function…
We conjecture that bounded generalised polynomial functions cannot be generated by finite automata, except for the trivial case when they are ultimately periodic. Using methods from ergodic theory, we are able to partially resolve this…
An important problem in combinatorial noncommutative algebra is to characterize the growth functions of finitely generated algebras (equivalently, semigroups, or hereditary languages). The growth function of every finitely generated,…
Given a function $f: (a,b) \rightarrow \mathbb{R},$ L\"owner's theorem states $f$ is monotone when extended to self-adjoint matrices via the functional calculus, if and only if $f$ extends to a self-map of the complex upper half plane. In…
In this note, we construct and study an algebraic system similar to the natural numbers, but with noncommutative addition. The addition we introduce is a binary operation that commutes with itself in the sense of N. Durov. Neverheless, the…
We study the rationality of the Artin-Mazur zeta function of a dynamical system defined by a polynomial self-map of A^1(k), where k is the algebraic closure of the finite field F_p. The zeta functions of the maps f(x)=x^m for (p,m)=1 and…
Stanley associated with a graph G a symmetric function X_G which reduces to G's chromatic polynomial under a certain specialization of variables. He then proved various theorems generalizing results about the chromatic polynomial, as well…
The classical subset construction for non-deterministic automata can be generalized to other side-effects captured by a monad. The key insight is that both the state space of the determinized automaton and its semantics---languages over an…
Automata operating on strings of nested brackets, known as input-driven pushdown automata, and as visibly pushdown automata, have been studied since the 1980s. They were extended to the case of infinite strings by Alur and Madhusudan…
We prove that, paying a polynomial increase in size only, every unrestricted two-way nondeterministic finite automaton (2NFA) can be complemented by a 1-limited automaton (1-LA), a nondeterministic extension of 2NFAs still characterizing…
The problem of nonparametric inference on a monotone function has been extensively studied in many particular cases. Estimators considered have often been of so-called Grenander type, being representable as the left derivative of the…
Ordering the collection of states of a given automaton starting from an order of the underlying alphabet is a natural move towards a computational treatment of the language accepted by the automaton. Along this path, Wheeler \emph{graphs}…
Commutative totally ordered monoids abound, number systems for example. When the monoid is not assumed commutative, one may be hard pressed to find an example. One suggested by Professor Orr Shalit are the countable ordinals with addition.…