Some remarks on good sets

DOI10.1007/BF02829443MaRDI QIDQ1766204zbMATH OpenOpenAlexFDO

Authors K. Gowri Navada

Publication date 28 February 2005

Published in Proceedings of the Indian Academy of Sciences. Mathematical Sciences (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0503092

zbMATH Keywords

full setgood setlooprelated component

Mathematics Subject Classification ID

Classes of sets (Borel fields, (sigma)-rings, etc.), measurable sets, Suslin sets, analytic sets (28A05) Measures and integrals in product spaces (28A35)

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.

Review text

The paper continues investigations of good sets and full sets on an \(N\)-fold Cartesian product. It is shown that if a good set has finitely many related components, then it is full. The correspondence between loops and extreme points of a convex set is found. A relatively full set is studied.

Recommendations

• Geometry of good sets in n-fold Cartesian product
• Some further remarks on good sets
• scientific article; zbMATH DE number 3893199
• Sets with doubleton sections, good sets and ergodic theory
• scientific article; zbMATH DE number 3969250

Cites work

• Geometry of good sets in n-fold Cartesian product
• When is \(f(x,y)=u(x)+v(y)\)?
• When is \(f(x_1,x_1,\dots,x_n)= u_1(x_1)+ u_2(x_2)+\cdots+ u_n(x_n)\)?

Cited in

(7)

• Geometry of good sets in n-fold Cartesian product
• Some notices on genuine sets
• Some further remarks on good sets
• On the representation by sums of algebras of continuous functions
• 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 theorem of M. Golomb

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)