Displaying 21 – 40 of 127

Showing per page

Characterizing chainable, tree-like, and circle-like continua

Taras Banakh, Zdzisław Kosztołowicz, Sławomir Turek (2011)

Colloquium Mathematicae

We prove that a continuum X is tree-like (resp. circle-like, chainable) if and only if for each open cover 𝓤₄ = {U₁,U₂,U₃,U₄} of X there is a 𝓤₄-map f: X → Y onto a tree (resp. onto the circle, onto the interval). A continuum X is an acyclic curve if and only if for each open cover 𝓤₃ = {U₁,U₂,U₃} of X there is a 𝓤₃-map f: X → Y onto a tree (or the interval [0,1]).

Classical-type characterizations of non-metrizable ANE(n)-spaces

Valentin Gutev, Vesko Valov (1994)

Fundamenta Mathematicae

The Kuratowski-Dugundji theorem that a metrizable space is an absolute (neighborhood) extensor in dimension n iff it is L C n - 1 C n - 1 (resp., L C n - 1 ) is extended to a class of non-metrizable absolute (neighborhood) extensors in dimension n. On this base, several facts concerning metrizable extensors are established for non-metrizable ones.

Closed subgroups in Banach spaces

Fredric Ancel, Tadeusz Dobrowolski, Janusz Grabowski (1994)

Studia Mathematica

We show that zero-dimensional nondiscrete closed subgroups do exist in Banach spaces E. This happens exactly when E contains an isomorphic copy of c 0 . Other results on subgroups of linear spaces are obtained.

Coarse dimensions and partitions of unity.

N. Brodskiy, J. Dydak (2008)

RACSAM

Gromov and Dranishnikov introduced asymptotic and coarse dimensions of proper metric spaces via quite different ways. We define coarse and asymptotic dimension of all metric spaces in a unified manner and we investigate relationships between them generalizing results of Dranishnikov and Dranishnikov-Keesling-Uspienskij.

Colorings of Periodic Homeomorphisms

Yuji Akaike, Naotsugu Chinen, Kazuo Tomoyasu (2009)

Bulletin of the Polish Academy of Sciences. Mathematics

We calculate the exact value of the color number of a periodic homeomorphism without fixed points on a finite connected graph.

Combinatorial trees in Priestley spaces

Richard N. Ball, Aleš Pultr, Jiří Sichler (2005)

Commentationes Mathematicae Universitatis Carolinae

We show that prohibiting a combinatorial tree in the Priestley duals determines an axiomatizable class of distributive lattices. On the other hand, prohibiting n -crowns with n 3 does not. Given what is known about the diamond, this is another strong indication that this fact characterizes combinatorial trees. We also discuss varieties of 2-Heyting algebras in this context.

Currently displaying 21 – 40 of 127