We introduce strong separation axioms in bitopological spaces. We also introduce the notion of strong pairwise compactness.

This paper presents a new asymptotically exact lower bound on pairwise error probability of a space-time code as well as an example code that outperforms the comparable orthogonal-design-based space-time (ODST) code. Also contained in the paper are some observations relating to exact pairwise error probability, signal design guidelines and simplicity of the ODST code receiver. Keywords— Space-t...

The purpose of this paper is to introduce the concept of pairwise F-closedness in bitopological spaces. This space contains both of pairwise strongcompactness and pairwise S-closedness and contained in pairwise quasi H-closedness. The characteristics and relationships concerning this new class of spaces with other corresponding types are established. Moreover, several of its basic and important...

We show that if a graph G is embedded in a surface 7 with representativity \, then G contains at least w(\&1)Â2x pairwise disjoint, pairwise homotopic, non-separating (in 7) cycles, and G contains at least w(\&1)Â8x&1 pairwise disjoint, pairwise homotopic, separating, noncontractible cycles. 1996 Academic Press, Inc.