Related papers: Associative idempotent nondecreasing functions are…

Given an irreducible sofic shift X, we show that an an irreducible SFT Y of lower entropy is a factor of X if and only if it is a factor of X by an open bi-continuing code. If these equivalent conditions hold and Y is mixing, then any code…

A non-negative function f, defined on the real line or on a half-line, is said to be directly Riemann integrable (d.R.i.) if the upper and lower Riemann sums of f over the whole (unbounded) domain converge to the same finite limit, as the…

Submodular functions are a fundamental object of study in combinatorial optimization, economics, machine learning, etc. and exhibit a rich combinatorial structure. Many subclasses of submodular functions have also been well studied and…

Computable reducibility is a well-established notion that allows to compare the complexity of various equivalence relations over the natural numbers. We generalize computable reducibility by introducing degree spectra of reducibility and…

Any continuous piecewise-linear function $F\colon \mathbb{R}^{n}\to \mathbb{R}$ can be represented as a linear combination of $\max$ functions of at most $n+1$ affine-linear functions. In our previous paper [``Representing piecewise linear…

We present some general results implying nonfinite axiomatisability of many additively idempotent semirings with finitely based semigroup reducts. The smallest is a $3$-element commutative example, which we show also has \texttt{NP}-hard…

A graph of order $n>3$ is called {switching separable} if its modulo-2 sum with some complete bipartite graph on the same set of vertices is divided into two mutually independent subgraphs, each having at least two vertices. We prove the…

It was claimed in [4] that for any integer $n\geqslant 2$, a neutral element can be adjoined to an $n$-ary semigroup if and only if the $n$-ary semigroup is reducible to a binary semigroup. We show that the `only if' direction of this…

Let $\mathbb{A}_n^m$ be an arbitrary $n$-dimensional commutative associative algebra over the field of complex numbers with $m$ idempotents. Let $e_1=1,e_2,\ldots,e_k$ with $2\leq k\leq 2n$ be elements of $\mathbb{A}_n^m$ which are linearly…

\emph{Reductions} combine collections of input values with an associative (and usually also commutative) operator to produce either a single, or a collection of outputs. They are ubiquitous in computing, especially with big data and deep…

For a function defined on an arbitrary subset of a Riemann surface, we give conditions which allow the function to be extended conformally. One folkloric consequence is that two common definitions of an analytic arc in ${\mathbb C}$ are…

We show that there exist unbounded functionals on the spaces of sequences that take at most one nonzero value on an arbitrary family of elements whose supports are pairwise disjoint.

In this article, we prove two new versions of a theorem proven by Efron in [Efr65]. Efron's theorem says that if a function $\phi : \mathbb{R}^2 \rightarrow \mathbb{R}$ is non-decreasing in each argument then we have that the function $s…

It is well-known that if a real valued function acting on a convex set satisfies the $n$-variable Jensen inequality, for some natural number $n\geq 2$, then, for all $k\in\{1,\dots, n\}$, it fulfills the $k$-variable Jensen inequality as…

A pair of functions defined on a set X with values in a vector space E is said to be disjoint if at least one of the functions takes the value 0 at every point in X. An operator acting between vector-valued function spaces is disjointness…

We prove that an irreducible polynomial derivation in positive characteristic is a Jacobian derivation if and only if there exists an n-1-element p-basis of its ring of constants. In the case of two variables we characterize these…

Recently, it has been shown that many functions on sets can be represented by sum decompositions. These decompositons easily lend themselves to neural approximations, extending the applicability of neural nets to set-valued inputs---Deep…

We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible…

In a previous paper we introduced the concept of semiseparable functor. Here we continue our study of these functors in connection with idempotent (Cauchy) completion. To this aim, we introduce and investigate the notions of (co)reflection…

Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations, and explicit bounds can be given. Developing a suitable notation system for Bounded Arithmetic, and applying these bounds, all…