Coloring finite subsets of uncountable sets

DOI10.1090/S0002-9939-96-03450-8MaRDI QIDQ3837583zbMATH OpenOpenAlexFDO

Authors Péter Komjáth, S. Shelah

Publication date 10 December 1996

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/9505216

zbMATH Keywords

consistencyforcingGCHindependence proofscombinatorial set theory

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Consistency and independence results (03E35)

Abstract: It is consistent for every (1 <= n< omega) that (2^omega = omega_n) and there is a function (F:[omega_n]^{< omega}-> omega) such that every finite set can be written at most (2^n-1) ways as the union of two distinct monocolored sets. If GCH holds, for every such coloring there is a finite set that can be written at least (sum^n_{i=1}{n+i choose n}{n choose i}) ways as the union of two sets with the same color.

Recommendations

• scientific article; zbMATH DE number 1943973
• Coloring some finite sets in \(\mathbb R^n\)
• Non-repetitive colorings of infinite sets
• Some coloring properties for uncountable cardinals
• On the discrepancy of coloring finite sets
• Hindman-like theorems with uncountably many colours and finite monochromatic sets
• Toward an uncountable analogue of Gallai's theorem for colorings of the plane
• scientific article; zbMATH DE number 1533526
• Finite subgraphs of uncountably chromatic graphs

Cites work

• scientific article; zbMATH DE number 4014719 (Why is no real title available?)
• A partition calculus in set theory
• A set mapping with no infinite free subsets
• A theorem and some consistency results in partition calculus
• Identities on cardinals less than ℵ_ω
• On uniformly antisymmetric functions
• Remarks on superatomic Boolean algebras

Cited in

(2)

• Coloring some finite sets in \(\mathbb R^n\)
• Some coloring properties for uncountable cardinals

This page was built for publication: Coloring finite subsets of uncountable sets

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