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

Znaleziono wyników: 4

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

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych:  product
help Sortuj według:

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

Cellularity of free products of Boolean algebras (or topologies)

100%
Shelah S.
Fundamenta Mathematicae
|
2000
|
tom 166
|
nr 1-2
153-208
EN
The aim this paper is to present an answer to Problem 1 of Monk [10], [11]. We do this by proving in particular that if μ is a strong limit singular cardinal, $θ = (2^{cf(μ)})^+$ and $2^μ = μ^+$ then there are Boolean algebras $\mathbb{B}_1,\mathbb{B}_2$ such that $c(\mathbb{B}_1) = μ, c(\mathbb{B}_2) < θ but c(\mathbb{B}_1*\mathbb{B}_2)=μ^+$. Further we improve this result, deal with the method and the necessity of the assumptions. In particular we prove that if $\mathbb{B}$ is a ccc Boolean algebra and $μ^{ℶ_ω} ≤ λ = cf(λ) ≤ 2^μ$ then $\mathbb{B}$ satisfies the λ-Knaster condition (using the "revised GCH theorem").
2
Content available remote

On a theorem of P. S. Aleksandrov

100%
Karno Z.
Colloquium Mathematicum
|
1997
|
tom 72
|
nr 1
39-51
3
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

A tandem version of the cops and robber game played on products of graphs

100%
Clarke N., Nowakowski R.
Discussiones Mathematicae Graph Theory
|
2005
|
tom 25
|
nr 3
241-249
EN
In this version of the Cops and Robber game, the cops move in tandems, or pairs, such that they are at distance at most one from each other after every move. The problem is to determine, for a given graph G, the minimum number of tandems sufficient to guarantee a win for the cops. We investigate this game on three graph products, the Cartesian, categorical and strong products.
4
Content available remote

Dugundji extenders and retracts on generalized ordered spaces

84%
Gruenhage G., Hattori Y., Ohta H.
Fundamenta Mathematicae
|
1998
|
tom 158
|
nr 2
147-164
EN
For a subspace A of a space X, a linear extender φ:C(A) → C(X) is called an $L_{ch}$-extender (resp. $L_{cch}$-extender) if φ(f)[X] is included in the convex hull (resp. closed convex hull) of f[A] for each f ∈ C(A). Consider the following conditions (i)-(vii) for a closed subset A of a GO-space X: (i) A is a retract of X; (ii) A is a retract of the union of A and all clopen convex components of X\A; (iii) there is a continuous $L_{ch}$-extender φ:C(A × Y) → C(X × Y), with respect to both the compact-open topology and the pointwise convergence topology, for each space Y; (iv) A × Y is C*-embedded in X × Y for each space Y; (v) there is a continuous linear extender $φ:C*_{k}(A) → C_{p}(X)$; (vi) there is an $L_{ch}$-extender φ:C(A) → C(X); and (vii) there is an $L_{cch}$-extender φ:C(A) → C(X). We prove that these conditions are related as follows: (i)⇒(ii)⇔(iii)⇔(iv)⇔(v)⇒(vi)⇒(vii). If A is paracompact and the cellularity of A is nonmeasurable, then (ii)-(vii) are equivalent. If there is no connected subset of X which meets distinct convex components of A, then (ii) implies (i). We show that van Douwen's example of a separable GO-space satisfies none of the above conditions, which answers questions of Heath-Lutzer [9], van Douwen [1] and Hattori [8].
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ć.