The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
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...
We consider a set, L, of lines in and a partition of L into some number of sets: $L = L_1∪...∪ L_p$. We seek a corresponding partition such that each line l in meets the set in a set whose cardinality has some fixed bound, $ω_τ$. We determine equivalences between the bounds on the size of the continuum, $2^ω ≤ ω_θ$, and some relationships between p, and $ω_θ$.
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.