Given a partition P:L → ω of the lines in $ℝ^n$, n ≥ 2, into countably many pieces, we ask if it is possible to find a partition of the points, $Q:ℝ^n → ω$, so that each line meets at most m points of its color. Assuming Martin's Axiom, we show this is the case for m ≥ 3. We reduce the problem for m = 2 to a purely finitary geometry problem. Although we have established a very similar, but somewhat simpler, version of the geometry conjecture, we leave the general problem open. We consider also various generalizations of these results, including to higher dimension spaces and planes.
2
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
We consider the question: when does a Ψ-space satisfy property (a)? We show that if $|A| < \got p$ then the Ψ-space Ψ(A) satisfies property (a), but in some Cohen models the negation of CH holds and every uncountable Ψ-space fails to satisfy property (a). We also show that in a model of Fleissner and Miller there exists a Ψ-space of cardinality $\got p$ which has property (a). We extend a theorem of Matveev relating the existence of certain closed discrete subsets with the failure of property (a).
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.