English
Related papers

Related papers: The closure-complement-frontier problem in saturat…

200 papers

Generalizing the famous 14-set closure-complement Theorem of Kuratowski from 1922, we prove that for a set $X$ endowed with $n$ pairwise comparable topologies $\tau_1\subset\dots\subset\tau_n$, by repeated application of the operations of…

General Topology · Mathematics 2021-11-01 T. Banakh , O. Chervak , T. Martynyuk , M. Pylypovych , A. Ravsky , M. Simkiv

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…

General Topology · Mathematics 2020-05-28 Michael P. Cohen , Todd Johnson , Adam Kral , Aaron Li , Justin Soll

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…

General Topology · Mathematics 2011-09-12 Jeffrey Shallit , Ross Willard

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…

General Topology · Mathematics 2023-12-14 Mark Bowron

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…

General Topology · Mathematics 2007-05-23 David Sherman

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…

General Topology · Mathematics 2025-10-28 Mark Bowron

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…

Computational Complexity · Computer Science 2009-04-15 J. Brzozowski , E. Grant , J. Shallit

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…

General Topology · Mathematics 2012-08-31 Szymon Plewik , Marta Walczyńska

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…

Functional Analysis · Mathematics 2019-02-12 Allahkaram Shafie

Let $(X,\tau)$ be a Hausdorff space, where $X$ is an infinite set. The compact complement topology $\tau^{\star}$ on $X$ is defined by: $\tau^{\star}=\{\emptyset\} \cup \{X\setminus M, \text{where $M$ is compact in $(X,\tau)$}\}$. In this…

General Topology · Mathematics 2020-09-08 Kyriakos Keremedis , Cenap Özel , Artur Piękosz , Mohammed Al Shumrani , Eliza Wajch

Employing a formal analogy between ordered sets and topological spaces, over the past years we have investigated a notion of cocompleteness for topological, approach and other kind of spaces. In this new context, the down-set monad becomes…

Category Theory · Mathematics 2013-05-28 Dirk Hofmann

A result of Boros and F\"uredi ($d=2$) and of B\'ar\'any (arbitrary $d$) asserts that for every $d$ there exists $c_d>0$ such that for every $n$-point set $P\subset \R^d$, some point of $\R^d$ is covered by at least $c_d{n\choose d+1}$ of…

Combinatorics · Mathematics 2016-08-14 Jiří Matoušek , Uli Wagner

Our contribution is a bounded cubic compilation theorem. For each fixed resource parameter $k$, syntactic proof checking at resource level $k$ is faithfully represented by a finite bounded-domain system of cubic polynomial equations. Every…

Logic · Mathematics 2026-04-29 Milan Rosko

Finite unions of convex sets are a central object of study in discrete and computational geometry. In this paper we initiate a systematic study of complements of such unions -- i.e., sets of the form $S=\mathbb{R}^d \setminus (\cup_{i=1}^n…

Combinatorics · Mathematics 2025-08-28 Chaya Keller , Micha A. Perles

We present several naturally occurring classes of spectral spaces using commutative algebra on pointed monoids. For this purpose, our main tools are finite type closure operations and continuous valuations on monoids which we introduce in…

Rings and Algebras · Mathematics 2018-11-06 Samarpita Ray

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…

General Topology · Mathematics 2026-02-10 Ahu Acikgoz

We introduce an extension, indexed by a partially ordered set P and cardinal numbers k,l, denoted by (k,l)-->P, of the classical relation (k,n,l)--> r in infinite combinatorics. By definition, (k,n,l)--> r holds, if every map from the…

Combinatorics · Mathematics 2010-05-31 Pierre Gillibert , Friedrich Wehrung

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…

Rings and Algebras · Mathematics 2018-03-02 Ryan C. Schwiebert

In recent years, the capacitated center problems have attracted a lot of research interest. Given a set of vertices $V$, we want to find a subset of vertices $S$, called centers, such that the maximum cluster radius is minimized. Moreover,…

Data Structures and Algorithms · Computer Science 2017-02-27 Hu Ding , Lunjia Hu , Lingxiao Huang , Jian Li

In a recent paper, Gerbner, Patk\'{o}s, Tuza and Vizer studied regular $F$-saturated graphs. One of the essential questions is given $F$, for which $n$ does a regular $n$-vertex $F$-saturated graph exist. They proved that for all…

Combinatorics · Mathematics 2021-03-17 Craig Timmons
‹ Prev 1 2 3 10 Next ›