Related papers: Variations on Kuratowski's 14-set theorem
Free-minor closed classes [2] and free-planar graphs [3] are considered. Versions of Kuratowski-like theorem for free-planar graphs and Kuratowski theorem for planar graphs are considered.
The number of topologies and non-homeomorphic topologies on a fixed finite set are now known up to $n=18$, $n=16$ but still no complete formula yet (Sloane). There are one to one correspondence among topologies, preorder and digraphs. In…
Compact sets in constructive mathematics capture our intuition of what computable subsets of the plane (or any other complete metric space) ought to be. A good representation of compact sets provides an efficient means of creating and…
This manuscript extends the Cantor-Kuratowski intersection theorem from the setting of metric spaces to the setting of uniformizable spaces. Complete uniformizable spaces are revisited.
CONTENTS: New reals: Can live with them, can live without them; Uniform almost everywhere domination; Heredity of tau-pseudocompactness; Understanding preservation theorems: omega^omega-bounding; Classification problems in continuum theory;…
The concept of convex compactness, weaker than the classical notion of compactness, is introduced and discussed. It is shown that a large class of convex subsets of topological vector spaces shares this property and that is can be used in…
We study the Borel subsets of the plane that can be made closed by refining the Polish topology on the real line. These sets are called potentially closed. We first compare Borel subsets of the plane using products of continuous functions.…
In this paper we study the number of finite topologies on an $n$-element set subject to various restrictions.
The concepts of a conditional set, a conditional inclusion relation and a conditional Cartesian product are introduced. The resulting conditional set theory is sufficiently rich in order to construct a conditional topology, a conditional…
Four constructions result from a desire to create enhancements to Cantor's infinite real set cardinality. Each continues to keep Cantor's cardinality formulation in place while providing new comparisons of arbitrary infinite sets. To…
Kuratowski proved that a finite graph embeds in the plane if it does not contain a subdivision of either K_5 or K_{3,3}, called Kuratowski subgraphs. A conjectured generalization of this result to all nonorientable surfaces says that a…
We develop a new method to compute the homology groups of finite topological spaces (or equivalently of finite partially ordered sets) by means of spectral sequences giving a complete and simple description of the corresponding…
Earlier an arbitrary poset $P$ was proved to be isomorphic to the collection of subsets of a space $M$ with two closures which are closed in the first closure and open in the other. As a space $M$ for this representation an algebraic dual…
Motivated by the model theory of higher order logics, a certain kind of topological spaces had been introduced on ultraproducts. These spaces are called ultratopologies. Ultratopologies provide a natural extra topological structure for…
Consider a set represented by an inequality. An interesting phenomenon which occurs in various settings in mathematics is that the interior of this set is the subset where strict inequality holds, the boundary is the subset where equality…
Using the invariant developed in [6], we differentiate four arrangements with the same combinatorial information but in different deformation classes. From these arrangements, we construct four other arrangements such that there is no…
We obtain a criterion for an analytic subset of a Euclidean space to contain points of differentiability of a typical Lipschitz function, namely, that it cannot be covered by countably many sets, each of which is closed and purely…
We discuss a sufficient condition for a space to be filled with an arbitrary finite number of self-similar spaces using a topological concept.
In 1973, Katona raised the problem of determining the maximum number of subsets in a separating cover on n elements. The answer to Katona's question turns out to be the inverse to the answer to a much simpler question: what is the largest…
Among perhaps many things common to Kuratowski's Theorem in graph theory, Reidemeister's Theorem in topology, and Cook's Theorem in theoretical computer science is this: all belong to the phenomenon of simultaneous discovery in mathematics.…