Countable networks on Malykhin&apos

[EN] We present a solution to the following problem: Does every countable and non-discrete topological (Abelian) group have a countable network with infinite elements? In fact, we show that no maximal topological space allows for a countable network with infinite elements. As a result, we answer the...

ver descrição completa

Detalhes bibliográficos
Autor: Márquez, Edgar
Formato: artículo
Fecha de publicación:2023
País:España
Recursos:Universitat Politècnica de València (UPV)
Repositorio:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Idioma:inglés
OAI Identifier:oai:riunet.upv.es:10251/199642
Acesso em linha:https://riunet.upv.es/handle/10251/199642
Access Level:acceso abierto
Palavra-chave:Countable network
Resolvable
Linear
P-point
P-space
Maximal
id ES_d4cb46d2a4401f52245ae9bbfbe8cb22
oai_identifier_str oai:riunet.upv.es:10251/199642
network_acronym_str ES
network_name_str España
repository_id_str
spelling Countable networks on Malykhin&aposs maximal topological groupMárquez, EdgarCountable networkResolvableLinearP-pointP-spaceMaximal[EN] We present a solution to the following problem: Does every countable and non-discrete topological (Abelian) group have a countable network with infinite elements? In fact, we show that no maximal topological space allows for a countable network with infinite elements. As a result, we answer the question in the negative. The article also focuses on Malykhin's maximal topological group constructed in 1975 and establishes some unusual properties of countable networks on this special group G. We show, in particular, that for every countable network N for G, the family of finite elements of N is also a network for G.Universitat Politècnica de ValènciaRepositorio Institucional de la Universitat Politècnica de València Riunet20232023-10-02journal articlehttp://purl.org/coar/resource_type/c_6501VoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/articleapplication/pdfhttps://riunet.upv.es/handle/10251/199642reponame:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valénciainstname:Universitat Politècnica de València (UPV)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2Reconocimiento - No comercial - Sin obra derivada (by-nc-nd) http://creativecommons.org/licenses/by-nc-nd/4.0/info:eu-repo/semantics/openAccessoai:riunet.upv.es:10251/1996422026-06-13T07:49:27Z
dc.title.none.fl_str_mv Countable networks on Malykhin&apos
s maximal topological group
title Countable networks on Malykhin&apos
spellingShingle Countable networks on Malykhin&apos
Márquez, Edgar
Countable network
Resolvable
Linear
P-point
P-space
Maximal
title_short Countable networks on Malykhin&apos
title_full Countable networks on Malykhin&apos
title_fullStr Countable networks on Malykhin&apos
title_full_unstemmed Countable networks on Malykhin&apos
title_sort Countable networks on Malykhin&apos
dc.creator.none.fl_str_mv Márquez, Edgar
author Márquez, Edgar
author_facet Márquez, Edgar
author_role author
dc.contributor.none.fl_str_mv Repositorio Institucional de la Universitat Politècnica de València Riunet
dc.subject.none.fl_str_mv Countable network
Resolvable
Linear
P-point
P-space
Maximal
topic Countable network
Resolvable
Linear
P-point
P-space
Maximal
description [EN] We present a solution to the following problem: Does every countable and non-discrete topological (Abelian) group have a countable network with infinite elements? In fact, we show that no maximal topological space allows for a countable network with infinite elements. As a result, we answer the question in the negative. The article also focuses on Malykhin's maximal topological group constructed in 1975 and establishes some unusual properties of countable networks on this special group G. We show, in particular, that for every countable network N for G, the family of finite elements of N is also a network for G.
publishDate 2023
dc.date.none.fl_str_mv 2023
2023-10-02
dc.type.none.fl_str_mv journal article
http://purl.org/coar/resource_type/c_6501
VoR
http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.openaire.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv https://riunet.upv.es/handle/10251/199642
url https://riunet.upv.es/handle/10251/199642
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
Reconocimiento - No comercial - Sin obra derivada (by-nc-nd)
http://creativecommons.org/licenses/by-nc-nd/4.0/
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
Reconocimiento - No comercial - Sin obra derivada (by-nc-nd)
http://creativecommons.org/licenses/by-nc-nd/4.0/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Universitat Politècnica de València
publisher.none.fl_str_mv Universitat Politècnica de València
dc.source.none.fl_str_mv reponame:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
instname:Universitat Politècnica de València (UPV)
instname_str Universitat Politècnica de València (UPV)
reponame_str RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
collection RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869420577567014912
score 15,300719

Registos relacionados