Displaying 21 – 40 of 51

Showing per page

Lindelöf indestructibility, topological games and selection principles

Marion Scheepers, Franklin D. Tall (2010)

Fundamenta Mathematicae

Arhangel’skii proved that if a first countable Hausdorff space is Lindelöf, then its cardinality is at most 2 . Such a clean upper bound for Lindelöf spaces in the larger class of spaces whose points are G δ has been more elusive. In this paper we continue the agenda started by the second author, [Topology Appl. 63 (1995)], of considering the cardinality problem for spaces satisfying stronger versions of the Lindelöf property. Infinite games and selection principles, especially the Rothberger property,...

On extension of the group operation over the Čech-Stone compactification

Jan Jełowicki (1993)

Colloquium Mathematicae

The convolution of ultrafilters of closed subsets of a normal topological group is considered as a substitute of the extension onto ( β ) 2 of the group operation. We find a subclass of ultrafilters for which this extension is well-defined and give some examples of pathologies. Next, for a given locally compact group and its dense subgroup , we construct subsets of β algebraically isomorphic to . Finally, we check whether the natural mapping from β onto β is a homomorphism with respect to the extension...

On the generators of T-indistinguishability operator.

Joan Jacas (1988)

Stochastica

The structure of the generators' set of a T-indistinguishability operator is analyzed. A suitable characterization of such generators is given. T-indistinguishability operators generated by a single fuzzy set, in the sense of the representation problem, are studied.

Revealments

Antonín Sochor, Petr Vopěnka (1980)

Commentationes Mathematicae Universitatis Carolinae

Roughness in G -graphs

Bibi N. Onagh (2020)

Commentationes Mathematicae Universitatis Carolinae

G -graphs are a type of graphs associated to groups, which were proposed by A. Bretto and A. Faisant (2005). In this paper, we first give some theorems regarding G -graphs. Then we introduce the notion of rough G -graphs and investigate some important properties of these graphs.

Currently displaying 21 – 40 of 51