Related papers: Continuous Ramsey theory on Polish spaces and cove…

Let $X$ and $Y$ be compact Hausdorff spaces, $E$ and $F$ be real or complex normed spaces and $A(X,E)$ be a subspace of $C(X,E)$. For a function $f\in C(X,E)$, let $\coz(f)$ be the cozero set of $f$. A pair of additive maps $S,T: A(X,E) \lo…

Let $\mathsf{TT}^2_k$ denote the combinatorial principle stating that every $k$-coloring of pairs of compatible nodes in the full binary tree has a homogeneous solution, i.e. an isomorphic subtree in which all pairs of compatible nodes have…

Let $X$ be a zero-dimensional space and $C_c(X)$ be the set of all continuous real valued functions on $X$ with countable image. In this article we denote by $C_c^K(X)$ (resp., $C_{c}^{\psi}(X)$) the set of all functions in $C_c(X)$ with…

We initiate the study of orthogonal forms on a real C$^*$-algebra. Motivated by previous contributions, due to Ylinen, Jajte, Paszkiewicz and Goldstein, we prove that for every continuous orthogonal form $V$ on a commutative real…

We prove the minimality of the CW-complex structure for complements of hyperplane arrangements in $\mathbb C^n$ by using the theory of Lefschetz pencils and results on the variation maps within a pencil of hyperplanes. This also provides a…

We study several natural classes of graphs on a zero-dimensional metrizable compact space having no continuous coloring. We compare these graphs with the quasi-order associated with injective continuous homomorphisms. We prove the existence…

We study the uniform computational content of Ramsey's theorem in the Weihrauch lattice. Our central results provide information on how Ramsey's theorem behaves under product, parallelization and jumps. From these results we can derive a…

A classical problem in the literature seeks the minimal number of proper subgroups whose union is a given finite group. A different question, with applications to error-correcting codes and graph colorings, involves covering vector spaces…

We prove that a homomorphism $h:X\to Y$ from a (locally compact) Cech-complete topological group $X$ to a topological group $Y$ is continuous if and only if $h$ is Borel-measurable if and only if $h$ is universally measurable (if and only…

In this paper we prove a new result about partitioning coloured complete graphs and use it to determine certain Ramsey numbers exactly. The partitioning theorem we prove is that for k at least 1, in every edge colouring of a complete graph…

We show that for every finite colouring of the natural numbers there exists $a,b >1$ such that the triple $\{a,b,a^b\}$ is monochromatic. We go on to show the partition regularity of a much richer class of patterns involving exponentiation.…

Given a graph $H$, the Ramsey number $R(H)$ is the smallest positive integer $n$ such that every $2$-edge-colouring of $K_n$ yields a monochromatic copy of $H$. We write $mH$ to denote the union of $m$ vertex-disjoint copies of $H$. The…

We characterize the strength, in terms of Weihrauch degrees, of certain problems related to Ramsey-like theorems concerning colourings of the rationals and of the natural numbers. The theorems we are chiefly interested in assert the…

For positive integers $k < n$ such that $k$ divides $n$, let $(n)^k_{\hom}$ be the set of homogeneous $k$-partitions of $\{1, \dots, n\}$, that is, the set of partitions of $\{1, \dots, n\}$ into $k$ classes of the same cardinality. In the…

A relational structure $\mathrm{R}$ is {\em rainbow Ramsey} if for every finite induced substructure $\mathrm{C}$ of $\mathrm{R}$ and every colouring of the copies of $\mathrm{C}$ with countably many colours, such that each colour is used…

Hadwiger's Conjecture asserts that every $K_h$-minor-free graph is properly $(h-1)$-colourable. We prove the following improper analogue of Hadwiger's Conjecture: for fixed $h$, every $K_h$-minor-free graph is $(h-1)$-colourable with…

Graph colorings is a fundamental topic in graph theory that require an assignment of labels (or colors) to vertices or edges subject to various constraints. We focus on the harmonious coloring of a graph, which is a proper vertex coloring…

Let $G \leq \mathrm{Sym} (X)$ for a countable set $X$. Call a colouring of $X$ asymmetric, if the identity is the only element of $G$ which preserves all colours. The motion (also called minimal degree) of $G$ is the minimal number of…

We will show that, consistently, every uncountable set can be continuously mapped onto a non measure zero set, while there exists an uncountable set whose all continuous images into a Polish space are meager.

This paper approaches the construction of the universal completion of the Riesz space $\mathrm{C}(L)$ of continuous real functions on a completely regular frame $L$ in two different ways. Firstly as the space of continuous real functions on…