Decomposition of number arrangements in the cube
Ivan Reshetnikov

TL;DR
This paper characterizes basic subsets in three-dimensional space where functions can be decomposed into sums of single-variable functions, providing criteria and constructions for minimal non-basic subsets based on graph properties.
Contribution
It introduces a criterion for basic subsets in specific cases and constructs minimal non-basic subsets using graph-theoretic methods.
Findings
Established a criterion for basic subsets in certain cases
Developed constructions for minimal non-basic subsets
Connected subset properties to graph theory
Abstract
A subset is called a \emph{basic subset}, if for any funciton there exist such functions that for each point . In this article we prove a criterion for a basic subset for some specific subsets in terms of some graph properties. We also introduce several constructions for mimimal non-basic subsets. The article is written in Russian.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Mathematical Dynamics and Fractals · Advanced Differential Equations and Dynamical Systems
