Related papers: Separable discrete functions: recognition and suff…

Divisorial gonality and stable divisorial gonality are graph parameters, which have an origin in algebraic geometry. Divisorial gonality of a connected graph $G$ can be defined with help of a chip firing game on $G$. The stable divisorial…

We consider multi-player graph games with partial-observation and parity objective. While the decision problem for three-player games with a coalition of the first and second players against the third player is undecidable, we present a…

We study the functional identity $G(x)f(x)=H(x)$ on a division ring $D$, where $f \colon D\to D$ is an additive map and $G(X)\ne 0, H(X)$ are generalized polynomials in the variable $X$ with coefficients in $D$. Precisely, it is proved that…

Studying continuous time counterpart of some discrete time dynamics is now a standard and fruitful technique, as some properties hold in both setups. In game theory, this is usually done by considering differential games on Euclidean…

Under general conditions, the equation $g(x^1, ..., x^q, y) = 0$ implicitly defines $y$ locally as a function of $x^1, ..., x^q$. In this article, we express divided differences of $y$ in terms of divided differences of $g$, generalizing a…

Let $E$ be the attractor of an iterated function system $\{\phi_i(x)=\rho R_ix+a_i\}_{i=1}^N$ on $\Bbb R^d$, where $0<\rho<1$, $a_i\in \Bbb R^d$ and $R_i$ are orthogonal transformations on $\Bbb R^d$. Suppose that $\{\phi_i\}_{i=1}^N$…

We discuss removability problems concerning differentiability and pointwise Lipschitz conditions for functions of a real variable. We prove that, in each of the settings under consideration, a set is removable if and only if it has no…

Common knowledge is crucial for safe group coordination. In its absence, humans must rely on shared knowledge, which is inherently limited in depth and therefore prone to coordination failures, because any finite-order knowledge attribution…

A group is small if it has countably many complete $n$-types over the empty set for each natural number n. More generally, a group $G$ is weakly small if it has countably many complete 1-types over every finite subset of G. We show here…

We discuss the following question: For a function f of two or more variables which is convex in the directions of coordinate axes, how can its trace g(x) = f(x, x, ..., x) look like? In the two-dimensional case, we provide some necessary…

An important aspect in systems of multiple autonomous agents is the exploitation of synergies via coalition formation. In this paper, we solve various open problems concerning the computational complexity of stable partitions in additively…

We investigate partial functions and computability theory from within a constructive, univalent type theory. The focus is on placing computability into a larger mathematical context, rather than on a complete development of computability…

Given a finite set $X$ and a function $f:X\to X$, we define the degree of noninvertibility of $f$ to be $\displaystyle\text{deg}(f)=\frac{1}{|X|}\sum_{x\in X}|f^{-1}(f(x))|$. This is a natural measure of how far the function $f$ is from…

We investigate uniqueness problems for an entire function that shares two small functions of finite order with their difference operators. In particular, we give a generalization of a result in $[2]$.

In a recent article, the class of functions from the integers to the integers computable in polynomial time has been characterized using discrete ordinary differential equations (ODE), also known as finite differences. Doing so, we pointed…

We introduce a new technique to detect separable states using semidefinite programs. This approach provides a sufficient condition for separability of a state that is based on the existence of a certain local linear map applied to a known…

In the paper we characterize the class of finite solvable groups by two-variable identities in a way similar to the characterization of finite nilpotent groups by Engel identities. More precisely, a sequence of words $u_1,...,u_n,... $ is…

The empirical use of variable transformations within (strictly) consistent loss functions is widespread, yet a theoretical understanding is lacking. To address this gap, we develop a theoretical framework that establishes formal…

We prove that an iterated function system of similarities on $\mathbb{R}$ that satisfies the weak separation condition and has an interval as its self-similar set satisfies the stronger generalized finite type condition. It is unknown if…

If a graph $G$ has distinguishing number 2, then there exists a partition of its vertex set into two parts, such that no nontrivial automorphism of $G$ fixes setwise the two parts. Such a partition is called a 2-distinguishing coloring of…