相关论文: Decompositions of functions defined on finite sets…

A subset $M \subset \textbf{R}^3$ is called a \emph{basic subset}, if for any funciton $f \colon M \to \textbf{R}$ there exist such functions $f_1; f_2; f_3 \colon \textbf{R} \to \textbf{R}$ that $f(x_1, x_2, x_3) = f_1(x_1) + f_2(x_2) +…

In Sternfeld's work on Kolmogorov's Superposition Theorem appeared the combinatorial-geometric notion of a basic set and a certain kind of arrays. A subset $X \subset \mathbb R^n$ is basic if any continuous function $X\to \mathbb R$ could…

A family $\bfam$ of continuous real-valued functions on a space $X$ is said to be {\sl basic} if every $f \in C(X)$ can be represented $f = \sum_{i=1}^n g_i \circ \phi_i$ for some $\phi_i \in \bfam$ and $g_i \in C(\R)$ ($i=1, ..., n$).…

This note is purely expository. In the course of the Kolmogorov-Arnold solution of Hilbert's 13th problem on superpositions there appeared the notion of basic embedding. A subset K of R^2 is basic if for each continuous function f:K->R…

We study the arity gap of functions of several variables defined on an arbitrary set A and valued in another set B. The arity gap of such a function is the minimum decrease in the number of essential variables when variables are identified.…

Let $[a,b]\subset\mathbb{R}$ be a non empty and non singleton closed interval and $P=\{a=x_0<\cdots<x_n=b\}$ is a partition of it. Then $f:I\to\mathbb{R}$ is said to be a function of $r$-bounded variation, if the expression…

We propose a functional view of matrix decomposition problems on graphs such as geometric matrix completion and graph regularized dimensionality reduction. Our unifying framework is based on the key idea that using a reduced basis to…

Functional decomposition is the process of breaking down a function $f$ into a composition $f=g(f_1,\dots,f_k)$ of simpler functions $f_1,\dots,f_k$ belonging to some class $\mathcal{F}$. This fundamental notion can be used to model…

This note is purely expository. We show how in the course of the Kolmogorov-Arnold solution of Hilbert's 13-th problem on superpositions there appeared the notion of a basic embedding. A subset K of R^2 is {\it basic} if for each continuous…

Submodular set functions are undoubtedly among the most important building blocks of combinatorial optimization. Somewhat surprisingly, continuous counterparts of such functions have also appeared in an analytic line of research where they…

A space X is finite dimensional, locally compact and separable metrizable if and only if X has a finite basic family: continuous functions Phi_1,...,Phi_n of X to the reals, R, such that for all continuous f from X to R there are g_1,...,…

We define the supermodular rank of a function on a lattice. This is the smallest number of terms needed to decompose it into a sum of supermodular functions. The supermodular summands are defined with respect to different partial orders. We…

Let $F$ be a rational function of one complex variable of degree $m\geq 2$. The function $F$ is called simple if for every $z\in \mathbb C\mathbb P^1$ the preimage $F^{-1}\{z\}$ contains at least $m-1$ points. We show that if $F$ is a…

A function on a topological space is called unimodal if all of its super-level sets are contractible. A minimal unimodal decomposition of a function $f$ is the smallest number of unimodal functions that sum up to $f$. The problem of…

Consider a_1,a_2,...,a_n, arbitrary elements of R. We characterize those real functions f that decompose into the sum of a_j-periodic functions, i.e., f=f_1+...+f_n with D_{a_j}f(x):=f(x+a_j)-f(x)=0. We show that f has such a decomposition…

Let $I\subseteq{\mathbb{R_+}}$ be a non empty and non singleton interval where ${\mathbb{R_+}}$ denotes the set of all non negative numbers. A function $\Phi: I\to {\mathbb{R_+}}$ is said to be subadditive if for any $x,y$ and $x+y\in I$,…

Let $A$ be an additive basis. We call ``essential subset'' of $A$ any finite subset $P$ of $A$ such that $A \setminus P$ is not an additive basis and that $P$ is minimal (for the inclusion order) to have this property. A recent theorem due…

The problem of finding graph structure of functions commuting with a given function in terms of their functional graphs is considered. Structure of functional graphs of commuting functions is described. The problem is reduced to describing…

We extend the well-known Shannon decomposition of Boolean functions to more general classes of functions. Such decompositions, which we call pivotal decompositions, express the fact that every unary section of a function only depends upon…

A new classification of real functions and other related real objects defined within a compact interval is proposed. The scope of the classification includes normal real functions and distributions in the sense of Schwartz, referred to…