On Proper Colorings of Functions
arXiv:2211.10654
Abstract
We investigate the infinite version of the -switch problem of Greenwell and Lovász. Given infinite cardinals and , for functions we say that they are totally different if for each . A function is a proper coloring if whenever and are totally different elements of . We say that is weakly uniform iff there are pairwise totally different functions such that ; is tight if there is no proper coloring such that there is exactly one with . We show that given a proper coloring , the following statements are equivalent is weakly uniform, there is a -complete ultrafilter on and there is a permutation such that for each we have We also show that there are tight proper colorings which cannot be obtained such a way.