Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Statistics
  • Help & Advice
University of Warwick

The Library

  • Login

Groups with context-free conjugacy problems

Tools
- Tools
+ Tools

Holt, Derek F., Rees, Sarah and Röver, Claas E.. (2011) Groups with context-free conjugacy problems. International Journal of Algebra and Computation, Vol.21 (No.1-2). pp. 193-216. ISSN 0218-1967

Full text not available from this repository.
Official URL: http://dx.doi.org/10.1142/S0218196711006133

Abstract

The conjugacy problem and the inverse conjugacy problem of a finitely generated group are defined, from a language theoretic point of view, as sets of pairs of words. An automaton might be obliged to read the two input words synchronously, or could have the option to read asynchronously. Hence each class of languages gives rise to four classes of groups; groups whose (inverse) conjugacy problem is an (a) synchronous language in the given class. For regular languages all these classes are identical with the class of finite groups. We show that the finitely generated groups with asynchronously context-free inverse conjugacy problem are precisely the virtually free groups. Moreover, the other three classes arising from context-free languages are shown all to coincide with the class of virtually cyclic groups, which is precisely the class of groups with synchronously one-counter (inverse) conjugacy problem. It is also proved that, for a delta-hyperbolic group and any lambda >= 1, epsilon >= 0, the intersection of the inverse conjugacy problem with the set of pairs of (lambda, epsilon)-quasigeodesics is context-free. Finally we show that the conjugacy problem of a virtually free group is an asynchronously indexed language.

Item Type: Journal Article
Divisions: Faculty of Science > Mathematics
Journal or Publication Title: International Journal of Algebra and Computation
Publisher: World Scientific Publishing Co. Pte. Ltd.
ISSN: 0218-1967
Date: February 2011
Volume: Vol.21
Number: No.1-2
Page Range: pp. 193-216
Identification Number: 10.1142/S0218196711006133
Status: Peer Reviewed
Publication Status: Published
URI: http://wrap.warwick.ac.uk/id/eprint/41792

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item View Item
twitter

Email us: publications@warwick.ac.uk
Contact Details
About Us