Some remarks on good sets
From MaRDI portal
Abstract: It is shown that (1) if a good set has finitely many related components, then they are full, (2) loops correspond one-to-one to extreme points of a convex set. Some other properties of good sets are discussed.
Recommendations
Cites work
Cited in
(7)- Some further remarks on good sets
- Geometry of good sets in n-fold Cartesian product
- Approximation by ridge functions and neural networks with a bounded number of neurons
- Approximation by neural networks with weights varying on a finite set of directions
- On the representation by sums of algebras of continuous functions
- On the theorem of M. Golomb
- Some notices on genuine sets
This page was built for publication: Some remarks on good sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1766204)