×

Universal space for binary \(G\)-spaces. (English) Zbl 1512.54033

Summary: The notion of binary \(G\)-space with an underlying \(\widetilde{G}\)-space is introduced. The problem of the existence of a universal object in the category of binary \(G\)-spaces and bi-equivariant maps is solved for the class of binary \(G\)-spaces with underlying unary \(\widetilde{G}\)-spaces. Some examples and properties in the case \(\widetilde{G} = G\) are also considered.

MSC:

54H15 Transformation groups and semigroups (topological aspects)
57S99 Topological transformation groups
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Paul, B.; Connes, A.; Higson, N., Classifying space for proper actions and K-theory of group \(C^\ast \)-algebras, Contemp. Math., 167, 241-291 (1994) · Zbl 0830.46061
[2] De Vries, J., Equivariant embeddings of G-spaces, (General Topology and Its Relations to Modern Analysis and Algebra IV (1977)), 485-493 · Zbl 0382.54018
[3] Gevorgyan, P. S., Groups of binary operations and binary G-spaces, Topol. Appl., 201, 18-28 (2016) · Zbl 1364.54025
[4] Gevorgyan, P. S., Groups of invertible binary operations of a topological space, J. Contemp. Math. Anal., 53, 16-20 (2018) · Zbl 1410.54040
[5] Gevorgyan, P. S., On binary G-spaces, Math. Notes, 96, 4, 127-129 (2014)
[6] Gevorgyan, P. S.; Iliadis, S. D., Groups of generalized isotopies and generalized G-spaces, Mat. Vesn., 70, 2, 110-119 (2018) · Zbl 1474.54097
[7] Gevorgyan, P. S.; Nazaryan, A. A., On orbits and bi-invariant subsets of binary G-spaces, Math. Notes, 109, 1, 38-45 (2021) · Zbl 1468.54028
[8] Milnor, J., Construction of universal bundles II, Ann. Math., 63, 3, 430-436 (1956) · Zbl 0071.17401
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.