오픈뉴스백과
오늘의 이슈홈라이브뉴스ONP 브리핑
뉴스로 배우기커뮤니티회사학술과학정부용어사전피드 제보내 편향
...

오픈뉴스백과

집단지성 기반 뉴스 검증 플랫폼. 다양한 시각으로 뉴스를 이해합니다.

서비스

오늘의 이슈홈라이브뉴스정부과학학술용어사전소개

법적 고지

개인정보처리방침이용약관콘텐츠 이용 안내

문의

문의하기

본 플랫폼에서 제공하는 뉴스 콘텐츠의 저작권은 각 언론사에 있으며, 무단 복제 및 배포를 금지합니다.

RSS 피드를 통해 수집된 콘텐츠는 각 원저작자의 라이선스 조건을 따릅니다. 오픈 라이선스(CC-BY 등) 콘텐츠는 해당 라이선스에 따라 출처를 표기합니다.

오픈뉴스백과는 뉴스 집계 및 검증 플랫폼으로, 개별 기사의 내용에 대한 책임은 해당 언론사에 있습니다.

이용자가 작성한 피드백, 팩트체크, 독자 제보 등의 콘텐츠에 대한 책임은 해당 작성자에게 있습니다.

콘텐츠 제거·정정이 필요하시면 문의하기에 남겨 주세요.

© 2026 오픈뉴스백과 (OpenNewsPedia). All rights reserved.

뉴스 목록
미디어 커버리지1건1개 미디어
arXiv Math
학술
기타

Magnus submonoids and membership problems in one-relator, surface and hyperbolic groups

arXiv Math
CC BY
이 매체는 공공·자유 라이선스로 본문을 직접 표시합니다.

Abstract

Motivated by its applications to the word problem for one-relator inverse monoids, via results of Ivanov, Margolis, and Meakin (2001), we prove several decidability and undecidability results about the submonoid membership problem in one-relator, surface and hyperbolic groups.

We prove a general result that gives sufficient conditions under which membership in submonoids of certain free-by-cyclic one-relator groups is decidable.

We apply this result to show that membership in various families of submonoids of surface groups is decidable.

We study graded submonoids of one-relator groups, proving results that give conditions under which such a submonoid has decidable membership with linear distortion.

These results are then applied to improve on a result of Margolis, Meakin and Šunik by showing the prefix monoid of a surface group has linear distortion.

Our results significantly extend previously known positive results proving decidability of membership in (non group) submonoids of surface groups.

We also apply our general results, and other techniques, to show that the Magnus submonoid membership problem is decidable in several families of one-relator groups including: surface groups, Baumslag--Solitar groups, and in certain free-by-cyclic one-relator groups.

We also prove results about the related positivity problem (also called the quasi-Magnus problem) which asks whether membership in the submonoid generate by $A$ is decidable.

We resolve a problem posed by McCammond and Meakin in 2006 by showing that there is a hyperbolic group $G$ generated by $A$ such that it is undecidable whether an element can be represented by a positive word on the generators $A$.

We show in addition this hyperbolic group can be chosen to be residually finite.

We do this by giving a new general method for constructing finitely presented groups with undecidable positivity problem.

전문 보기

이 뉴스, 어떠셨어요?

탭 한 번으로 반응 · 로그인 불필요

관련 뉴스

관련 뉴스 제보는 로그인 후 가능합니다.

'research' 카테고리 뉴스

The strip-shaped deep white matter hyperintensities may be related to neurodegeneration: A study based on diffusion tensor imaging

PLOS ONE

Data-driven analysis of heterogeneous gait subgroups and ground reaction forces based on integrated center of pressure–center of mass dynamics in poststroke hemiparesis

PLOS ONE

Correction: Study on plugging law and plugging removal effect of pre filled screen in natural gas hydrate argillaceous silt reservoir

PLOS ONE

arXiv의 다른 기사

GraphDx: A Cost-Aware Knowledge-Enhanced Multi-Agent Framework for Sequential Diagnosis

arXiv CS.AI

Causal-Audit: Explicit and Auditable Graph-based Reasoning via Target-Aware Causal Chain Construction

arXiv CS.AI

Cura 1T: Specialized Model for Agentic Healthcare

arXiv CS.AI

피드백

피드백을 남기려면 로그인해 주세요.