SearcharxivSearch

arXiv subjects

Marion Scheepers

Publications and source records attributed to Marion Scheepers.

At least 19 recordsLinked to original sources

Benford's Law in the ring $\mathbb{Z}(\sqrt{D})$

For $D$ a natural number that is not a perfect square and for $k$ a non-zero integer, consider the subset $\mathbb{Z}_k(\sqrt{D})$ of the quadratic integer ring $\mathbb{Z}(\sqrt{D})$ consisting of elements $x+y\sqrt{D}$ for which $x^2 - Dy^2 = k$ . For each $k$ such that the set $\mathbb{Z}_k(\sqrt{D})$ is nonempty, $\mathbb{Z}_k(\sqrt{D})$ has a natural arrangement into a sequence for which the corresponding sequence of integers $x$, as well as the corresponding sequence of integers $y$, are strong Benford sequences.

math.NT

A Selection Principle and Products in Topological Groups

We consider the preservation under products, finite powers, and forcing, of a selection principle based covering property of $T_0$ topological groups. Though the paper is in part a survey, it contributes some new information, including: 1. The product of a strictly o-bounded group with an o-bounded group is an o-bounded group - Corollary 18 2. In the generic extension by a finite support iteration of $\aleph_1$ Hechler reals the product of any o-bounded group with a ground model $\aleph_0$ bounded group is an o-bounded group - Theorem 19 3. In the generic extension by a countable support iteration of length $\aleph_2$ Mathias reals the product of any o-bounded group with a ground model $\aleph_0$ bounded group is an o-bounded group - Theorem 20.

math.GN

Ramsey Theory and the Borel Conjecture

The Borel covering property, introduced a century ago by E. Borel, is intimately connected with Ramsey theory, initiated ninety years ago in an influential paper of F.P. Ramsey. The current state of knowledge about the connection between the Borel covering property and Ramsey theory is outlined in this paper. Initially the connection is established for the situation when the set with the Borel covering property is a proper subset of a $σ$-compact uniform space. Then the connection is explored for a stronger covering property introduced by Rothberger. After establishing the fact that in this case several landmark Ramseyan theorems are characteristic of this stronger covering property, the case when the space with this stronger covering property is in fact $σ$-compact is explored.

math.GN

Quantifying CDS Sortability of Permutations by Strategic Pile Size

The special purpose sorting operation, context directed swap (CDS), is an example of the block interchange sorting operation studied in prior work on permutation sorting. CDS has been postulated to model certain molecular sorting events that occur in the genome maintenance program of some species of ciliates. We investigate the mathematical structure of permutations not sortable by the CDS sorting operation. In particular, we present substantial progress towards quantifying permutations with a given strategic pile size, which can be understood as a measure of CDS non-sortability. Our main results include formulas for the number of permutations in $\textsf{S}_n$ with maximum size strategic pile. More generally, we derive a formula for the number of permutations in $\textsf{S}_n$ with strategic pile size $k$, in addition to an algorithm for computing certain coefficients of this formula, which we call merge numbers.

math.CO

On a conjecture for $\aleph_0$-bounded groups

We show that it is consistent, relative to the consistency of a strongly inaccessible cardinal, that an instance of the generalized Borel Conjecture introduced in [8] holds while the classical Borel Conjecture fails.

math.LO

Selective versions of $θ$-density

In [8] the authors initiate the study of selective versions of the notion of $θ$-separability in non-regular spaces. In this paper we continue this investigation by establishing connections between the familiar cardinal numbers arising in the set theory of the real line, and game-theoretic assertions regarding $θ$-separability.

math.GN

Meager Sets, Games and Singular Cardinals

We show that a statement concerning the existence of winning strategies of limited memory in an infinite two-person topological game is equivalent to a weak version of the Singular Cardinals Hypothesis.

math.LO

Update: Remarks on Countable Tightness

The proof of Theorem 11 of the paper M. Scheepers, Remarks on countable tightness, Topology and its Applications 161 (2014), 407 - 432 relies on Lemma 10 of that paper. The offered proof of Lemma 10 had shortcomings, and I was recently asked for details. This note gives an alternative, complete proof of Lemma 10.

math.GN

Selective strong screenability and a game

Selective versions of screenability and of strong screenability coincide in a large class of spaces. We show that the corresponding games are not equivalent in even such standard metric spaces as the closed unit interval. We identify sufficient conditions for ONE to have a winning strategy, and necessary conditions for TWO to have a winning strategy in the selective strong screenability game

math.GN

Baire spaces and infinite games

It is well known that if the nonempty player of the Banach-Mazur game has a winning strategy on a space, then that space is Baire in all powers even in the box topology. The converse of this implication may be true also: We know of no consistency result to the contrary. In this paper we establish the consistency of the converse relative to the consistency of the existence of a proper class of measurable cardinals.

math.LO

Selective Games on Binary Relations

We present a unified approach, based on dominating families in binary relations, for the study of topological properties defined in terms of selection principles and the games associated to them.

math.GN

Using Ciliate Operations to construct Chromosome Phylogenies

We develop an algorithm based on three basic DNA editing operations suggested by a model for ciliate micronuclear decryption, to transform a given permutation into another. The number of ciliate operations performed by our algorithm during such a transformation is taken to be the distance between two such permutations. Applying well-known clustering methods to such distance functions enables one to determine phylogenies among the items to which the distance functions apply. As an application of these ideas we explore the relationships among the chromosomes of eight fruitfly (drosophila) species, using the well-known UPGMA algorithm on the distance function provided by our algorithm.

q-bio.GN

Remarks on countable tightness

Countable tightness may be destroyed by countably closed forcing. We characterize the indestructibility of countable tightness under countably closed forcing by combinatorial statements similar to the ones Tall used to characterize indestructibility of the Lindelof property under countably closed forcing. We consider the behavior of countable tightness in generic extensions obtained by adding Cohen reals. We show that certain classes of well-studied topological spaces are indestructibly countably tight. Stronger versions of countable tightness, including selective versions of separability, are further explored.

math.GN

Borel's Conjecture in Topological Groups

We introduce a natural generalization of Borel's Conjecture. For each infinite cardinal number $κ$, let {\sf BC}$_κ$ denote this generalization. Then ${\sf BC}_{\aleph_0}$ is equivalent to the classical Borel conjecture. Assuming the classical Borel conjecture, $\neg{\sf BC}_{\aleph_1}$ is equivalent to the existence of a Kurepa tree of height $\aleph_1$. Using the connection of ${\sf BC}_κ$ with a generalization of Kurepa's Hypothesis, we obtain the following consistency results: (1)If it is consistent that there is a 1-inaccessible cardinal then it is consistent that ${\sf BC}_{\aleph_1}$. (2)If it is consistent that ${\sf BC}_{\aleph_1}$ holds, then it is consistent that there is an inaccessible cardinal. (3)If it is consistent that there is a 1-inaccessible cardinal with $ω$ inaccessible cardinals above it, then $\neg{\sf BC}_{\aleph_ω} \, +\, (\forall n<ω){\sf BC}_{\aleph_n}$ is consistent. (4)If it is consistent that there is a 2-huge cardinal, then it is consistent that ${\sf BC}_{\aleph_ω}$. (5)If it is consistent that there is a 3-huge cardinal, then it is consistent that ${\sf BC}_κ$ holds for a proper class of cardinals $κ$ of countable cofinality.

math.LO

Weak covering properties and infinite games

We investigate game-theoretic properties of selection principles related to weaker forms of the Menger and Rothberger properties. For appropriate spaces some of these selection principles are characterized in terms of a corresponding game. We use generic extensions by Cohen reals to illustrate the necessity of some of the hypotheses in our theorems.

math.GN

Rothberger bounded groups and Ramsey theory

We show that: 1. Rothberger bounded subgroups of sigma-compact groups are characterized by Ramseyan partition relations. 2. For each uncountable cardinal $κ$ there is a ${\sf T}_0$ topological group of cardinality $κ$ such that ONE has a winning strategy in the point-open game on the group and the group is not a subspace of any sigma-compact space. 3. For each uncountable cardinal $κ$ there is a ${\sf T}_0$ topological group of cardinality $κ$ such that ONE has a winning strategy in the point-open game on the group and the group is σ-compact.

math.GN

Lindelof indestructibility, topological games and selection principles

Arhangel'skii proved that if a first countable Hausdorff space is Lindelöf, then its cardinality is at most $2^{\aleph_0}$. Such a clean upper bound for Lindelöf spaces in the larger class of spaces whose points are ${\sf G}_δ$ has been more elusive. In this paper we continue the agenda started in F.D. Tall, On the cardinality of Lindelöf spaces with points $G_δ$, Topology and its Applications 63 (1995), 21 - 38, of considering the cardinality problem for spaces satisfying stronger versions of the Lindelöf property. Infinite games and selection principles, especially the Rothberger property, are essential tools in our investigations

math.GN