On Proper Colorings of Functions

From MaRDI portal



Abstract: We investigate the infinite version of k-switch problem of Greenwell and Lov'asz. Given infinite cardinals kappa and lambda, for functions x,yinkappalambda we say that they are totally different if x(i)ey(i) for each iinlambda. A function F:lambdakappalongrightarrowkappa is a proper coloring if F(x)eF(y) whenever x and y are totally different elements of lambdakappa. We say that (i) F is weakly uniform iff there are pairwise totally different functions ralpha:alpha<kappasubsetlambdakappa such that F(ralpha)=alpha; (ii) F is tight if there is no proper coloring G:lambdakappalongrightarrowkappa such that there is exactly one xinlambdakappa with G(x)eF(x). We show that given a proper coloring F:lambdakappaokappa, the following statements are equivalent (i) F is weakly uniform, (ii) there is a kappa complete ultrafilter mathscrU on lambda an there is a permutation piinSymm(kappa) such that for each xinlambdakappa we have F(x)={pi}({alpha}) Longleftrightarrow {iin {lambda}: x(i)={alpha}} in mathscr{U}. We also show that there are tight proper colorings which can not be obtain such a way.














This page was built for publication: On Proper Colorings of Functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6417780)