Related papers: Polyregular Functions
In computational practice, most attention is paid to rational approximations of functions and approximations by the sum of exponents. We consider a wide enough class of nonlinear approximations characterized by a set of two required…
In this paper we define a family of nonlinear, stationary, interpolatory subdivision schemes with the capability of reproducing conic shapes including polynomials upto second order. Linear, non-stationary, subdivision schemes do also…
This paper investigates functions from $\mathbb{R}^d$ to $\mathbb{R} \cup \{\pm \infty\}$ that satisfy axioms of linearity wherever allowed by extended-value arithmetic. They have a nontrivial structure defined inductively on $d$, and…
We introduce the notion of bilinear moment functional and study their general properties. The analogue of Favard's theorem for moment functionals is proven. The notion of semi-classical bilinear functionals is introduced as a generalization…
We consider classes of Boolean functions stable under compositions both from the right and from the left with clones. Motivated by the question how many properties of Boolean functions can be defined by means of linear equations, we focus…
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…
We give some connections between various functions defined on finitely presented groups (isoperimetric, isodiametric, Todd-Coxeter radius, filling length functions, etc.), and we study the relation between those functions and the…
Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. In this paper, almost perfect nonlinear…
We study the ring of polyfunctions over $\mathbb Z/n\mathbb Z$. The ring of polyfunctions over a commutative ring $R$ with unit element is the ring of functions $f:R\to R$ which admit a polynomial representative $p\in R[x]$ in the sense…
We consider orthogonal polynomials on the unit circle associated with certain semi-classical weight functions. This means that the Pearson-type differential equations satisfied by these weight functions involve two polynomials of degree at…
There are two kinds of polynomial functions on matrix algebras over commutative rings: those induced by polynomials with coefficients in the algebra itself and those induced by polynomials with scalar coefficients. In the case of algebras…
String rewriting systems have proved very useful to study monoids. In good cases, they give finite presentations of monoids, allowing computations on those and their manipulation by a computer. Even better, when the presentation is…
Deep neural networks trained in an end-to-end manner are proven to be efficient in a wide range of machine learning tasks. However, there is one drawback of end-to-end learning: The learned features and information are implicitly…
Kawamura and Cook specified the least set of information about a continuous function on the unit interval which is needed for fast function evaluation. This paper presents a variation of their result. To make the above statement precise,…
Functors with an instance of the Traversable type class can be thought of as data structures which permit a traversal of their elements. This has been made precise by the correspondence between traversable functors and finitary containers…
Dominant sequence models like the Transformer represent structure implicitly through dense attention weights, incurring quadratic complexity. We propose RewriteNets, a novel neural architecture built on an alternative paradigm: explicit,…
We show that any multiple-valued function can be represented by a linear lambda term typed in a second-order polymorphic type system, using two distinct styles. The first is a circuit style, which mimics combinational circuits in switching…
In this letter we present an operator formalism for Closed String Field Theory based on closed half-strings. Our results indicate that the restricted polyhedra of the classical non-polynomial string field theory, can be represented as…
We investigate combinatorial properties of a kind of insets we defined in an earlier paper, interpreting them now in terms of restricted ternary words. This allows us to give new combinatorial interpretations of a number of known integer…
String functions are important building blocks of characters of integrable highest modules over affine Kac--Moody algebras. Kac and Peterson computed string functions for affine Lie algebras of type $A_{1}^{(1)}$ in terms of Dedekind eta…