Related papers: Kuratowski monoids of $n$-topological spaces
A celebrated 1922 theorem of Kuratowski states that there are at most 14 distinct sets arising from applying the operations of complementation and closure, any number of times, in any order, to a subset of a topological space. In this paper…
Kuratowski's 14-set theorem says that in a topological space, 14 is the maximum possible number of distinct sets which can be generated from a fixed set by taking closures and complements. In this article we consider the analogous questions…
Let $X$ be a space equipped with $n$ topologies $\tau_1,...,\tau_n$ which are pairwise comparable and saturated, and for each $1\leq i\leq n$ let $k_i$ and $f_i$ be the associated topological closure and frontier operators, respectively.…
A famous theorem of Kuratowski states that in a topological space, at most 14 distinct sets can be produced by repeatedly applying the operations of closure and complement to a given set. We re-examine this theorem in the setting of formal…
We pose the following new variant of the Kuratowski closure-complement problem: How many distinct sets may be obtained by starting with a set $A$ of a Polish space $X$, and applying only closure, complementation, and the $d$ operator, as…
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…
The Kuratowski monoid $\mathbf{K}$ is generated under operator composition by closure and complement in a nonempty topological space. It satisfies $2\leq|\mathbf{K}|\leq14$. The Gaida-Eremenko (or GE) monoid $\mathbf{KF}$ extends…
Ciraulo recently showed that Kuratowski's closure-complement problem for arbitrary powersets of topological spaces extends constructively to the interior-pseudocomplement problem for arbitrary posets, using the closure-interior problem for…
The paper fills gaps in knowledge about Kuratowski operations which are already in the literature. The Cayley table for these operations has been drawn up. Techniques, using only paper and pencil, to point out all semigroups and its…
In this paper we explore the extent to which the algebraic structure of a monoid $M$ determines the topologies on $M$ that are compatible with its multiplication. Specifically we study the notions of automatic continuity; minimal Hausdorff…
Monoids generated by elements of order two appear in numerous places in the literature. For example, Coxeter reflection groups in geometry, Kuratowski monoids in topology, various monoids generated by regular operations in language theory…
Two proofs of the Koml\'os-Major-Tusn\'ady embedding theorems, one for the uniform empirical process and one for the simple symmetric random walk, are given. More precisely, what are proved are the univariate coupling results needed in the…
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.…
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 equip a topological space $(X,\tau)$ with a function $\mathfrak{a}: X \to \tau$ satisfying the single axiom $x \in \mathfrak{a}(x)$. The resulting triple $(X, \tau, \mathfrak{a})$, which we call an aura topological space, provides a…
The first part of the paper is a brief overview of Hindman's finite sums theorem, its prehistory and a few of its further generalizations, and a modern technique used in proving these and similar results, which is based on idempotent…
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.
Kuratowski's closure-complement problem gives rise to a monoid generated by the closure and complement operations. Consideration of this monoid yielded an interesting classification of topological spaces, and subsequent decades saw further…
A 1910 theorem of Brouwer characterizes the Cantor set as the unique totally disconnected, compact metric space without isolated points. A 1920 theorem of Sierpinski characterizes the rationals as the unique countable metric space without…
In this paper we present general techniques for characterising minimal and maximal semigroup topologies on the endomorphism monoid $\operatorname{End}(\mathbb{A})$ of a countable relational structure $\mathbb{A}$. As applications, we show…