Related papers: Polyregular Functions

Permutation rational functions over finite fields have attracted high interest in recent years. However, only a few of them have been exhibited. This article studies a class of permutation rational functions constructed using trace maps on…

We investigate the subclass of reversible functions that are self-inverse and relate them to reversible circuits that are equal to their reverse circuit, which are called palindromic circuits. We precisely determine which self-inverse…

This tutorial gives an advanced introduction to string diagrams and graph languages for higher-order computation. The subject matter develops in a principled way, starting from the two dimensional syntax of key categorical concepts such as…

We consider a class of optimization problems that involve determining the maximum value that a function in a particular class can attain subject to a collection of difference constraints. We show that a particular linear programming…

It is a common knowledge that the integer functions definable in simply typed lambda-calculus are exactly the extended polynomials. This is indeed the case when one interprets integers over the type (p->p)->p->p where p is a base type…

Complex dynamics deals with the iteration of holomorphic functions. As is well- known, the first functions to be studied which gave non-trivial dynamics were quadratic polynomials, which produced beautiful computer generated pictures of…

Finite (word) state transducers extend finite state automata by defining a binary relation over finite words, called rational relation. If the rational relation is the graph of a function, this function is said to be rational. The class of…

To minimize or upper-bound the value of a function "robustly", we might instead minimize or upper-bound the "epsilon-robust regularization", defined as the map from a point to the maximum value of the function within an epsilon-radius. This…

A class of parametric functions formed by alternating compositions of multivariate polynomials and rectification style monomial maps is studied (the layer-wise exponents are treated as fixed hyperparameters and are not optimized). For this…

We introduce the concept of associativity for string functions, where a string function is a unary operation on the set of strings over a given alphabet. We discuss this new property and describe certain classes of associative string…

In this paper we obtain several new complete characterizations of pseudolinear functions. Two of the results are of first-order and one is derivative free. All results are derived in terms of the Clarke-Rockafellar subdifferential.…

Slice-regular functions of a quaternionic variable have been studied extensively in the last 12 years, resulting, in many ways, quite close to classical holomorphic functions of a complex variable; indeed, there is a correspondence between…

We say that a formal power series $\sum a_n z^n$ with rational coefficients is a 2-function if the numerator of the fraction $a_{n/p}-p^2 a_n$ is divisible by $p^2$ for every prime number $p$. One can prove that 2-functions with rational…

Multimodular functions, primarily used in the literature of queueing theory, discrete-event systems, and operations research, constitute a fundamental function class in discrete convex analysis. The objective of this paper is to clarify the…

Our goal is to define an algebraic language for reasoning about non-deterministic computations. Towards this goal, we introduce an algebra of string-to-string transductions. Specifically, it is an algebra of partial functions on words over…

Submodular functions are relevant to machine learning for at least two reasons: (1) some problems may be expressed directly as the optimization of submodular functions and (2) the lovasz extension of submodular functions provides a useful…

We study the computational power of polynomial threshold functions, that is, threshold functions of real polynomials over the boolean cube. We provide two new results bounding the computational power of this model. Our first result shows…

We define a very general notion of regularity for functions taking values in an alternative real $*$-algebra. Over Clifford numbers, this notion subsumes the well-established notions of monogenic function and slice-monogenic function. Over…

The notion of a root functional of polynomials is a generalization of the notion of a root for a multiple root. A root functional is a linear functional that is defined on a polynomial ring and annuls the ideal of a system of polynomials. A…

For all natural numbers a,b and d > 0, we consider the function f_{a,b,d} which associates n/d to any integer n when it is a multiple of d, and an + b otherwise; in particular f_{3,1,2} is the Collatz function. Coding in base a > 1 with b <…