Cracking Kuratowski's Closure-Complement Question

Publication Date

Spring 3-20-2026

College

College of Sciences & Mathematics

Department

Math and Computer Science, Department of

Student Level

Undergraduate

Faculty Mentor

Dr. Adam Cartisano

Presentation Type

Talk/Oral

Summary

Kuratowski's closure-complement problem asks to find some subset A of a topological space for which one can reach the largest number of distinct sets by repeatedly applying the operations of closure and complement. In this presentation, we present a solution to Kuratowski's problem and prove that 14 is the maximum number of distinct sets reachable.

This document is currently not available here.

Share

COinS