Decompositions of functions defined on finite sets in R^d
From MaRDI portal
Publication:5076511
Abstract: A finite subset is basic, if for any function there exists a collection of functions such that for each element we have . 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.
Recommendations
Cites work
Cited in
(6)- Decomposition of subsets of finite fields
- Vandermonde independent matrices, basic sets, and polynomial matrix functions over a finite field
- scientific article; zbMATH DE number 4027366 (Why is no real title available?)
- Basic Sets in the Digital Plane
- A simpler proof of Sternfeld's theorem
- On Motzkin decomposable sets and functions
This page was built for publication: Decompositions of functions defined on finite sets in \(\mathbb{R}^d\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5076511)