English
Related papers

Related papers: Covering versus partitioning with the Cantor space

200 papers

We study partition properties for uncountable regular cardinals that arise by restricting partition properties defining large cardinal notions to classes of simply definable colourings. We show that both large cardinal assumptions and…

Logic · Mathematics 2018-07-03 Philipp Lücke

In this paper we consider the problem of characterization of topological spaces that embed into countably compact Hausdorff spaces. We study the separation axioms of subspaces of countably compact Hausdorff spaces and construct an example…

General Topology · Mathematics 2019-06-12 Taras Banakh , Serhii Bardyla , Alex Ravsky

Specifying a computational problem requires fixing encodings for input and output: encoding graphs as adjacency matrices, characters as integers, integers as bit strings, and vice versa. For such discrete data, the actual encoding is…

Logic · Mathematics 2021-08-25 Donghyun Lim , Martin Ziegler

We extend Raimi's classical partition theorem to the continuous setting of the circle and $n$-dimensional torus. Building on recent work of Hegyv\'ari, Pach, and Pham in finite groups, we prove that there exist measurable partitions of the…

Combinatorics · Mathematics 2025-12-02 Hunseok Kang , Doowon Koh , Dung The Tran

A compact space X is I-favorable if, and only if X can be representing as a limit of $\sigma$-complete inverse system of compact metrizable spaces with skeletal bonding maps.

General Topology · Mathematics 2008-03-03 Andrzej Kucharski , Szymon Plewik

We prove that a set of finite perimeter is indecomposable if and only if it is, up to a choice of suitable representative, connected in the 1-fine topology. This gives a topological characterization of indecomposability which is new even in…

Metric Geometry · Mathematics 2025-12-23 Paolo Bonicatto , Panu Lahti , Enrico Pasqualetto

For a cardinal lambda<lambda_{omega_1} we give a ccc forcing notion P which forces that for some Borel subset B of the Cantor space (1) there a sequence (eta_alpha:alpha<lambda) of distinct elements such that |(eta_alpha+B) cap…

Logic · Mathematics 2018-06-19 Andrzej Roslanowski , Saharon Shelah

A classical result of Cembranos and Freniche states that the C(K, X) spaces contains a complemented copy of c_0 whenever K is an infinite compact Hausdorff space and X is an infinite dimensional Banach space. This paper takes this result as…

Functional Analysis · Mathematics 2015-03-17 Dale E. Alspach , Elói Medina Galego

The study of very large graphs is a prominent theme in modern-day mathematics. In this paper we develop a rigorous foundation for studying the space of finite labelled graphs and their limits. These limiting objects are naturally countable…

Combinatorics · Mathematics 2021-05-27 Apoorva Khare , Bala Rajaratnam

We conjecture that every infinite group $G$ can be partitioned into countably many cells $G=\bigcup_{n\in\omega}A_n$ such that $cov(A_nA_n^{-1})=|G|$ for each $n\in\omega$. Here $cov(A)=\min\{|X|:X\subseteq G, G=XA\}$. We confirm this…

Group Theory · Mathematics 2014-08-28 Igor Protasov , Sergii Slobodianiuk

Stone space partitions $\{X_{p}\mid p\in P\}$ satisfying conditions like $\bar{X_{p}}=\bigcup_{q\leqslant p}X_{q}$ for all $p\in P$, where $P$ is a poset or PO system (poset with a distinguished subset), arise naturally in the study both of…

Logic · Mathematics 2023-05-09 Andrew Apps

We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which…

Logic in Computer Science · Computer Science 2015-07-01 Martin Escardo

We study the problems of covering or partitioning a polygon $P$ (possibly with holes) using a minimum number of small pieces, where a small piece is a connected sub-polygon contained in an axis-aligned unit square. For covering, we seek to…

We consider a connected graph $\Gamma$ as a coarse space and prove that $\Gamma$ admits a 2-selector if and only if $\Gamma$ is either bounded or coarsely equivalent to $\mathbb{N}$ or $\mathbb{Z}$. We apply this result to geodesic metric…

General Topology · Mathematics 2021-09-08 Igor Protasov

A well ordering < of a topological space X is "left-separating" if $\{x'\in X: x'< x\}$ is closed in X for any x in X. A space is "left-separated" if it has a left-separating well-ordering. The left-separating type, $ord_l(X)$, of a…

General Topology · Mathematics 2018-06-13 Lajos Soukup , Adrienne Stanley

We prove that if $K$ is a compact space and the space $P(K\times K)$ of regular probability measures on $K\times K$ has countable tightness in its $weak^*$ topology, then $L_1(\mu)$ is separable for every $\mu\in P(K)$. It has been known…

Functional Analysis · Mathematics 2014-05-13 Grzegorz Plebanek , Damian Sobota

Metrizable spaces are studied in which every closed set is an $\alpha$-limit set for some continuous map and some point. It is shown that this property is enjoyed by every space containing sufficiently many arcs (formalized in the notion of…

Dynamical Systems · Mathematics 2022-02-14 Jana Hantáková , Samuel Roth , Ľubomír Snoha

Assume that there is no quasi-measurable cardinal smaller than $2^\omega$. ($\kappa$ is quasi measurable if there exists $\kappa $-additive ideal $\ci $ of subsets of $\kappa $ such that the Boolean algebra $P(\kappa)/\ci$ satisfies c.c.c.)…

Logic · Mathematics 2010-03-05 Robert Ralowski , Szymon Zeberski

For a cardinal $\kappa > \omega$ a metric space $X$ is called to be $\kappa$-superuniversal whenever for every metric space $Y$ with $|Y| < \kappa$ every partial isometry from a subset of $Y$ into $X$ can be extended over the whole space…

General Topology · Mathematics 2014-07-15 Wojciech Bielas

We study the problem of partitioning a given simple polygon $P$ into a minimum number of connected polygonal pieces, each of bounded size. We describe a general technique for constructing such partitions that works for several notions of…

Computational Geometry · Computer Science 2024-10-23 Mikkel Abrahamsen , Nichlas Langhoff Rasmussen