Searcharxiv⌕ Search

arXiv subjects

Marion Scheepers

Publications and source records attributed to Marion Scheepers.

31 records · Page 2Linked to original sources

Weakly infinite dimensional subsets of R^N

The Continuum Hypothesis implies an Erdös-Sierpiński like duality between the ideal of first category subsets of $\reals^{\naturals}$, and the ideal of countable dimensional subsets of $\reals^{\naturals}$. The algebraic sum of a Hurewicz subset - a dimension theoretic analogue of Sierpinski sets and Lusin sets - of $\reals^{\naturals}$ with any compactly countable dimensional subset of $\reals^{\naturals}$ has first category.

math.GN↗

Partition relations for Hurewicz-type selection hypotheses

We give a general method to reduce Hurewicz-type selection hypotheses into standard ones. The method covers the known results of this kind and gives some new ones. Building on that, we show how to derive Ramsey theoretic characterizations for these selection hypotheses.

math.GN↗

Selection Principles and Baire spaces

We prove that if X is a separable metric space with the Hurewicz covering property, then the Banach-Mazur game played on X is determined. The implication is not true when "Hurewicz covering property" is replaced with "Menger covering property".

math.GN↗

Rothberger's property in finite powers

We show that several classical Ramseyan statements, and a forcing statement, are each equivalent to having Rothberger's property in all finite powers.

math.LO↗

Products and selection principles

The product of a Sierpinski set and a Lusin set has Menger's property. The product of a gamma set and a Lusin set has Rothberger's property.

math.GN↗

The combinatorics of Borel covers

In this paper we extend previous studies of selection principles for families of open covers of sets of real numbers to also include families of countable Borel covers. The main results of the paper could be summarized as follows: 1. Some of the classes which were different for open covers are equal for Borel covers -- Section 1; 2. Some Borel classes coincide with classes that have been studied under a different guise by other authors -- Section 4.

math.GN↗

Filters and games

We obtain game-theoretic characterizations for meagerness and rareness of filters on a countable set.

math.LO↗

A-sets

We consider ``meager analogues'' of classical covering properties of Menger, Hurewicz and Rothberger. We show that Borel images of sets having ``our'' covering properties have these classical covering properties.

math.LO↗

The combinatorics of open covers (II)

We continue to investigate various diagonalization properties for sequences of open covers of separable metrizable spaces introduced in Part I. These properties generalize classical ones of Rothberger, Menger, Hurewicz, and Gerlits-Nagy. In particular, we show that most of the properties introduced in Part I are indeed distinct. We characterize two of the new properties by showing that they are equivalent to saying all finite powers have one of the classical properties above (Hurewicz property in one case and in the Menger property in other). We consider for each property the smallest cardinality of metric space which fails to have that property. In each case this cardinal turns out to equal another well-known cardinal less than the continuum. We also disprove (in ZFC) a conjecture of Hurewicz which is analogous to the Borel conjecture. Finally, we answer several questions from Part I concerning partition properties of covers.

math.LO↗

Meager-nowhere dense games (III): Remainder strategies

Player ONE chooses a meager set and player TWO, a nowhere dense set per inning. They play $ω$ many innings. ONE's consecutive choices must form a (weakly) increasing sequence. TWO wins if the union of the chosen nowhere dense sets covers the union of the chosen meager sets. A strategy for TWO which depends on knowing only the uncovered part of the most recently chosen meager set is said to be a remainder strategy. Theorem (among others): TWO has a winning remainder strategy for this game played on the real line with its usual topology.

math.LO↗

Covering games and the Banach-Mazur game: k-tactics

Given a free ideal J of subsets of a set X, we consider games where player ONE plays an increasing sequence of elements of the sigma completion of J, and TWO tries to cover the union of this sequence by playing one set at a time from J. We describe various conditions under which player TWO has has a winning strategy that uses only information about the most recent k moves of ONE, and apply some of these results to the Banach-Mazur game.

math.LO↗