𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Generalized paracompactness of subspaces in products of two ordinals

✍ Scribed by Nobuyuki Kemoto; Ken-ichi Tamano; Yukinobu Yajima


Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
118 KB
Volume
104
Category
Article
ISSN
0166-8641

No coin nor oath required. For personal study only.

✦ Synopsis


We will characterize metacompactness, subparacompactness and paracompactness of subspaces of products of two ordinal numbers. Using them we will show:

(1) For such subspaces, weak submetaLindelΓΆfness, screenability and metacompactness are equivalent.

(2) Metacompact subspaces of Ο‰ 2 1 are paracompact. (3) Metacompact subspaces of Ο‰ 2 2 are subparacompact. (4) There is a metacompact subspace of (Ο‰ 1 + 1) 2 which is not paracompact.

(5) There is a metacompact subspace of (Ο‰ 2 + 1) 2 which is not subparacompact.


πŸ“œ SIMILAR VOLUMES


The product of two ordinals is hereditar
✍ Nobuyuki Kemoto; Kerry D. Smith πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 273 KB

It will be shown that p x u is hereditarily countably metacompact for any ordinals # and u. As an immediate corollary we see that w 2 is hereditarily countably metacompact. This answers a question of Ohta (K. Tamano, 1995). Also, as a corollary we see that if A and B are subspaces of ordinals, then

Generalized hamiltonian circuits in the
✍ Douglas S. Jungreis πŸ“‚ Article πŸ“… 1988 πŸ› John Wiley and Sons 🌐 English βš– 299 KB

We find necessary and sufficient conditions for the existence of a closed walk that traverses r vertices twice and the rest once in the Cayley digraph of 2, @ 2,. This is a generalization of the results known for r = 0 or 1. In 1978, Trotter and Erdos [3] gave a necessary and sufficient condition f

Automatic grid generation of complex geo
✍ Wanlai Lin; Ching Jen Chen πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 429 KB

A method of automatic grid generation for complex boundaries in Cartesian co-ordinates is proposed in this paper. In addition to the Cartesian grid lines the diagonal segments are used for the approximations of complex geometries in Cartesian co-ordinates. A structured Cartesian grid is employed for