Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Groups whose word problems are not semilinear

Groups whose word problems are not semilinear AbstractSuppose that G is a finitely generated group and WP⁡(G){\operatorname{WP}(G)}is the formal language of words defining the identity in G.We prove that if G is a virtually nilpotent group that is not virtually abelian, the fundamental group of a finite volume hyperbolic three-manifold, or a right-angled Artin group whose graph lies in a certain infinite class, then WP⁡(G){\operatorname{WP}(G)}is not a multiple context-free language. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Groups Complexity Cryptology de Gruyter

Groups whose word problems are not semilinear

Download PDF
10 pages

Loading next page...
 
/lp/de-gruyter/groups-whose-word-problems-are-not-semilinear-aT0mubdXoR
Publisher
de Gruyter
Copyright
© 2018 Walter de Gruyter GmbH, Berlin/Boston
ISSN
1869-6104
eISSN
1869-6104
DOI
10.1515/gcc-2018-0010
Publisher site
See Article on Publisher Site

Abstract

AbstractSuppose that G is a finitely generated group and WP⁡(G){\operatorname{WP}(G)}is the formal language of words defining the identity in G.We prove that if G is a virtually nilpotent group that is not virtually abelian, the fundamental group of a finite volume hyperbolic three-manifold, or a right-angled Artin group whose graph lies in a certain infinite class, then WP⁡(G){\operatorname{WP}(G)}is not a multiple context-free language.

Journal

Groups Complexity Cryptology – de Gruyter

Published: Nov 1, 2018

There are no references for this article.