arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2204.11084math.CO
收藏

$\mathbb{R}^d$中有限集上函数的分解

Decompositions of functions defined on finite sets in $\mathbb{R}^d$

Khaydar Nurligareev, Ivan Reshetnikov

摘要:

有限子集$M \subset \mathbb{R}^d$是基本的,如果对于任何函数$f \colon M \to \mathbb{R}$,存在函数$f_1, \ldots, f_d \colon \mathbb{R} \to \mathbb{R}$的集合,使得对于每个元素$(x_1, \ldots, x_d)\in M$,我们有$f(x_1, \ldots, x_d) = f_1(x_1) + \ldots + f_d(x_d)$。对于某些有限集,我们证明了一个标准的一套基本的,我们表明,它不能扩展到一般情况下。此外,我们解释了上述标准的双重加权图,并给出了一些基本和非基本子集的元素的数量的估计。

英文摘要:

A finite subset $M \subset \mathbb{R}^d$ is basic, if for any function $f \colon M \to \mathbb{R}$ there exists a collection of functions $f_1, \ldots, f_d \colon \mathbb{R} \to \mathbb{R}$ such that for each element $(x_1, \ldots, x_d)\in M$ we have $f(x_1, \ldots, x_d) = f_1(x_1) + \ldots + f_d(x_d)$. For certain finite sets, we prove a criterion for a set to be basic, and we show that it cannot be extended to the general case. In addition, we interpret the above criterion in terms of doubly-weighted graphs and give an estimation for the number of elements in certain basic and non-basic subsets.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑