Tag Archives: 03E75

Strong failures of higher analogs of Hindman’s Theorem

Joint work with David J. Fernández Bretón. Abstract.  We show that various analogs of Hindman’s Theorem fail in a strong sense when one attempts to obtain uncountable monochromatic sets: Theorem 1. There exists a colouring $c:\mathbb R\rightarrow\mathbb Q$, such that … Continue reading

Posted in Partition Relations, Publications | Tagged , , , , , , , , , , , , , , | 1 Comment

Hedetniemi’s conjecture for uncountable graphs

Abstract. It is proved that in Godel’s constructible universe, for every successor cardinal $\kappa$, there exist graphs $\mathcal G$ and $\mathcal H$ of size and chromatic number $\kappa$, for which the tensor product graph $\mathcal G\times\mathcal H$ is countably chromatic. … Continue reading

Posted in Infinite Graphs, Publications | Tagged , , , , , , , , | Leave a comment

Openly generated Boolean algebras and the Fodor-type reflection principle

Joint work with Sakaé Fuchino. Abstract: We prove that the Fodor-type Reflection Principle (FRP) is equivalent to the assertion that any Boolean algebra is openly generated if and only if it is $\aleph _2$-projective. Previously it was known that this … Continue reading

Posted in Compactness, Publications | Tagged , , , , , , , , , , , | Leave a comment