Zobrazeno 1 - 10 of 54 pro vyhledávání: '"Fred Galvin"'
1
Baire spaces and infinite games
Autor: Marion Scheepers, Fred Galvin
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 res
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8e2d322032ceedbf41b9461171c5a259
Zobrazit plný text záznamu
4
Borel's Conjecture in Topological Groups
Autor: Marion Scheepers, Fred Galvin
Publikováno v: J. Symbolic Logic 78, iss. 1 (2013), 168-184
We introduce a natural generalization of Borel's Conjecture. For each infinite cardinal number $\kappa$, let {\sf BC}$_{\kappa}$ denote this generalization. Then ${\sf BC}_{\aleph_0}$ is equivalent to the classical Borel conjecture. Assuming the clas
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c27313f5ed7da3b70c992adf5551b36e
Zobrazit plný text záznamu
7
Distance Functions and Topologies
Autor: S. D. Shore, Fred Galvin
Publikováno v: The American Mathematical Monthly. 98:620-623
(1991). Distance Functions and Topologies. The American Mathematical Monthly: Vol. 98, No. 7, pp. 620-623.
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::282f16a4a793f81440ea9644c694a3bc
https://doi.org/10.1080/00029890.1991.11995766
Zobrazit plný text záznamu
8
Some Ramsey-type theorems
Autor: Fred Galvin, Paul Erdős
Publikováno v: Discrete Mathematics. 87:261-269
It is easy to see that the infinite homogeneous set A in Ramsey's theorem may be arbitrarily sparse. We study some versions of Ramsey's theorem in which the homogeneity requirement is weakened so that the rate of growth of the elements of A can be bo
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f046616c74d6d7a105b0d95f7f6dbda7
https://doi.org/10.1016/0012-365x(91)90135-o
Zobrazit plný text záznamu
9
On a Theorem of J. Ossowski
Autor: Fred Galvin
Publikováno v: Journal of Combinatorial Theory, Series A. 78:151-153
Consider any matrix of zeros and ones with at mostnones in each row and fewer than (k+1)nones in all. Ossowski showed that, by deleting no more thankcolumns, one can get a matrix which contains nor×(n−r+1) submatrix of ones forr=1, 2, …, n. We g
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5498daac5a841978b65df20b4647cc43
https://doi.org/10.1006/jcta.1996.2753
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje