Generalization of Kuratowski problem in linear spaces
classification
🧮 math.FA
keywords
algebraickuratowskiproblemclosurelinearspaceapplyingcomplement
read the original abstract
In this short paper, Kuratowski problem will be investigated in vector space. The highest number of distinct sets that can be generated from one convex set in linear space by repeatedly applying algebraic closure and complement in any order is 8. Keywords: Kuratowski problem, algebraic interior, algebraic closure
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.