A countable family of finitely presented infinite congruence-free monoids

Detalhes bibliográficos
Autor(a) principal: Al-Kharousi, Fatma
Data de Publicação: 2015
Outros Autores: Cain, Alan J., Maltcev, Victor, Umar, Abdullahi
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
Texto Completo: http://hdl.handle.net/10362/75240
Resumo: the second author was supported by an FCT Investigador advanced fellowship (IF/01622/2013/CP1161/CT0001).
id RCAP_92b47cf5cd035c300dbf05c5caca09cb
oai_identifier_str oai:run.unl.pt:10362/75240
network_acronym_str RCAP
network_name_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository_id_str 7160
spelling A countable family of finitely presented infinite congruence-free monoidsBoone-Higman ConjectureCongruence-freeFinitely presentedRewriting systemsAnalysisApplied Mathematicsthe second author was supported by an FCT Investigador advanced fellowship (IF/01622/2013/CP1161/CT0001).We prove that the monoids Monha, b, c, d: anb = 0, ac = 1, db = 1, dc = 1, dab = 1, da 2 b = 1,.., dan-1 b = 1i are congruence-free for all n = 1. This provides a new countable family of finitely presented congruence-free monoids, bringing us one step closer to understanding the monoid version of the Boone-Higman Conjecture. We also provide examples showing that finitely presented congruence-free monoids may have quadratic Dehn function.CMA - Centro de Matemática e AplicaçõesRUNAl-Kharousi, FatmaCain, Alan J.Maltcev, VictorUmar, Abdullahi2019-07-12T22:08:34Z20152015-01-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/article9application/pdfhttp://hdl.handle.net/10362/75240eng0001-6969PURE: 1114506http://www.scopus.com/inward/record.url?scp=84953876715&partnerID=8YFLogxKhttps://doi.org/10.14232/actasm-013-028-zinfo:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2024-03-11T04:34:27Zoai:run.unl.pt:10362/75240Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-20T03:35:30.202749Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse
dc.title.none.fl_str_mv A countable family of finitely presented infinite congruence-free monoids
title A countable family of finitely presented infinite congruence-free monoids
spellingShingle A countable family of finitely presented infinite congruence-free monoids
Al-Kharousi, Fatma
Boone-Higman Conjecture
Congruence-free
Finitely presented
Rewriting systems
Analysis
Applied Mathematics
title_short A countable family of finitely presented infinite congruence-free monoids
title_full A countable family of finitely presented infinite congruence-free monoids
title_fullStr A countable family of finitely presented infinite congruence-free monoids
title_full_unstemmed A countable family of finitely presented infinite congruence-free monoids
title_sort A countable family of finitely presented infinite congruence-free monoids
author Al-Kharousi, Fatma
author_facet Al-Kharousi, Fatma
Cain, Alan J.
Maltcev, Victor
Umar, Abdullahi
author_role author
author2 Cain, Alan J.
Maltcev, Victor
Umar, Abdullahi
author2_role author
author
author
dc.contributor.none.fl_str_mv CMA - Centro de Matemática e Aplicações
RUN
dc.contributor.author.fl_str_mv Al-Kharousi, Fatma
Cain, Alan J.
Maltcev, Victor
Umar, Abdullahi
dc.subject.por.fl_str_mv Boone-Higman Conjecture
Congruence-free
Finitely presented
Rewriting systems
Analysis
Applied Mathematics
topic Boone-Higman Conjecture
Congruence-free
Finitely presented
Rewriting systems
Analysis
Applied Mathematics
description the second author was supported by an FCT Investigador advanced fellowship (IF/01622/2013/CP1161/CT0001).
publishDate 2015
dc.date.none.fl_str_mv 2015
2015-01-01T00:00:00Z
2019-07-12T22:08:34Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/10362/75240
url http://hdl.handle.net/10362/75240
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 0001-6969
PURE: 1114506
http://www.scopus.com/inward/record.url?scp=84953876715&partnerID=8YFLogxK
https://doi.org/10.14232/actasm-013-028-z
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv 9
application/pdf
dc.source.none.fl_str_mv reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron:RCAAP
instname_str Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron_str RCAAP
institution RCAAP
reponame_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
collection Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository.name.fl_str_mv Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
repository.mail.fl_str_mv
_version_ 1799137976110809088

Registros relacionados