Covering compacta by discrete subspaces
Abstract For any space X, denote by dis ( X ) the smallest (infinite) cardinal κ such that κ many discrete subspaces are needed to cover X. It is easy to see that if X is any crowded (i.e. dense-in-itself) compactum then dis ( X ) ⩾ m , where m denotes the additivity of the meager ideal on the reals. It is a natural, and apparently quite difficult, question whether in this inequality m could be replaced by c . Here we show that this can be done if X is also hereditarily normal. Moreover, we prove the following mapping theorem that involves the cardinal function dis ( X ) . If f : X → Y is a continuous surjection of a countably compact T 2 space X onto a perfect T 3 space Y then | { y ∈ Y : f −1 y  is countable } | ⩽ dis ( X ) .
Two improvements on Tkaÿcenko's addition theorem
We prove that (A) if a countably compact space is the union of countably many D subspaces then it is compact; (B) if a compact T2 space is the union of fewer than N(R) = cov(M) left-separated subspaces then it is scattered. Both (A) and (B) improve results of Tkaycenko from 1979; (A) also answers a question that was raised by Arhangel'skiyi and improves a result of Gruenhage.
On Hilbert's thirteenth problem and related questions
Hilbert's thirteenth problem involves the study of solutions of algebraic equations. The object is to obtain a complexity estimate for an algebraic function. As of now, the problem remains open. There are only a few partial algebraic results in this connection, but at the same time the problem has stimulated a series of studies in the theory of functions with their subsequent applications. The most brilliant result in this cycle is Kolmogorov's theorem on superpositions of continuous functions.