SearcharxivSearch

arXiv subjects

L. Soukup

Publications and source records attributed to L. Soukup.

3 recordsLinked to original sources

Some new results on $\Delta$-spaces

A topological space $X$ is a $\Delta$-space (or $X \in \Delta$) if for any decreasing sequence $\{A_n : n < \omega\}$ of subsets of $X$ with empty intersection there is a (decreasing) sequence $\{U_n : n < \omega\}$ of open sets with empty intersection such that $A_n \subset U_n$ for all $n < \omega$. In this note we prove the following results concerning $\Delta$-spaces. 1) Every $T_3$ countably compact $\Delta$-space is compact. 2) If there is a $T_1$ crowded Baire $\Delta$-space then there is an inner model with a measurable cardinal. 3) If $X \in \Delta$ and $cf \big(o(X) \big) > \omega$ then $|X| < o(X)$. (Here $o(X)$ is the number of open subsets of $X$.) The first two of these provide full and/or partial solutions to problems raised in the literature, while the third improves a known result.

math.GN

Cardinal Sequences of Lindel\"of scattered P-spaces

We continue our investigation of cardinal sequences associated with locally Lindelof, scattered, Hausdorff P-spaces (abbreviated as LLSP spaces). We outline a method for constructing LLSP spaces from cone systems and partial orders with specific properties. Additionally, we establish limitations on the cardinal sequences of LLSP spaces. Finally, we present both a necessary condition and a distinct sufficient condition for a sequence $\langle \kappa_\alpha: \alpha < \omega_2 \rangle$ to be the cardinal sequence of an LLSP space.

math.GN

Decompositions of edge-colored infinite complete graphs into monochromatic paths

An $r$-edge coloring of a graph or hypergraph $G=(V,E)$ is a map $c:E\to \{0, \dots, r-1\}$. Extending results of Rado and answering questions of Rado, Gyárfás and Sárközy we prove that (1.) the vertex set of every $r$-edge colored countably infinite complete $k$-uniform hypergraph can be partitioned into $r$ monochromatic tight paths with distinct colors (a tight path in a $k$-uniform hypergraph is a sequence of distinct vertices such that every set of $k$ consecutive vertices forms an edge), (2.) for all natural numbers $r$ and $k$ there is a natural number $M$ such that the vertex set of every $r$-edge colored countably infinite complete graph can be partitioned into $M$ monochromatic $k^{th}$ powers of paths apart from a finite set (a $k^{th}$ power of a path is a sequence $v_0, v_1, \dots$ of distinct vertices such that $1\le|i-j| \le k$ implies that $v_iv_j$ is an edge), (3.) the vertex set of every $2$-edge colored countably infinite complete graph can be partitioned into $4$ monochromatic squares of paths, but not necessarily into $3$, (4.) the vertex set of every $2$-edge colored complete graph on $ω_1$ can be partitioned into $2$ monochromatic paths with distinct colors.

math.CO