Pełnotekstowe zasoby PLDML oraz innych baz dziedzinowych są już dostępne w nowej Bibliotece Nauki.
Zapraszamy na https://bibliotekanauki.pl
Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 3

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last

Wyniki wyszukiwania

help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote

Resolving a question of Arkhangel'skiĭ's

100%
EN
We construct in ZFC a cosmic space that, despite being the union of countably many metrizable subspaces, has covering dimension equal to 1 and inductive dimensions equal to 2.
EN
We prove that every Baire subspace Y of c₀(Γ) has a dense $G_δ$ metrizable subspace X with dim X ≤ dim Y. We also prove that the Kimura-Morishita Eberlein compactifications of metrizable spaces preserve large inductive dimension. The proofs rely on new and old results concerning the dimension of uniform spaces.
3
Content available remote

On Dimensionsgrad, resolutions, and chainable continua

63%
EN
For each natural number n ≥ 1 and each pair of ordinals α,β with n ≤ α ≤ β ≤ ω(𝔠⁺), where ω(𝔠⁺) is the first ordinal of cardinality 𝔠⁺, we construct a continuum $S_{n,α,β}$ such that (a) $dim S_{n,α,β} = n$; (b) $trDg S_{n,α,β} = trDgo S_{n,α,β} = α$; (c) $trind S_{n,α,β} = trInd₀S_{n,α,β} = β$; (d) if β < ω(𝔠⁺), then $S_{n,α,β}$ is separable and first countable; (e) if n = 1, then $S_{n,α,β}$ can be made chainable or hereditarily decomposable; (f) if α = β < ω(𝔠⁺), then $S_{n,α,β}$ can be made hereditarily indecomposable; (g) if n = 1 and α = β < ω(𝔠⁺), then $S_{n,α,β}$ can be made chainable and hereditarily indecomposable. In particular, we answer the question raised by Chatyrko and Fedorchuk whether every non-degenerate chainable space has Dimensionsgrad equal to 1. Moreover, we establish results that enable us to compute the Dimensionsgrad of a number of spaces constructed by Charalambous, Chatyrko, and Fedorchuk.
first rewind previous Strona / 1 next fast forward last
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ć.