Average-case complexity of the Whitehead problem for free groups

The worst-case complexity of group-theoretic algorithms has been studied for a long time. Generic-case complexity, or complexity on random inputs, was introduced and studied relatively recently. In this paper, we address the average-case complexity (i.e., the expected runtime) of algorithms that sol...

Full description

Saved in:
Bibliographic Details
Published in:Communications in algebra Vol. 51; no. 2; pp. 799 - 806
Main Author: Shpilrain, Vladimir
Format: Journal Article
Language:English
Published: Abingdon Taylor & Francis 01.02.2023
Taylor & Francis Ltd
Subjects:
Algorithms
Automorphisms
average-case complexity
Complexity
Free group
Whitehead problem
ISSN:0092-7872, 1532-4125
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract The worst-case complexity of group-theoretic algorithms has been studied for a long time. Generic-case complexity, or complexity on random inputs, was introduced and studied relatively recently. In this paper, we address the average-case complexity (i.e., the expected runtime) of algorithms that solve a well-known problem, the Whitehead problem in a free group, which is: given two elements of a free group, find out whether there is an automorphism that takes one element to the other. First we address a special case of the Whitehead problem, namely deciding if a given element of a free group is part of a free basis. We show that there is an algorithm that, on a cyclically reduced input word, solves this problem and has constant (with respect to the length of the input) average-case complexity. For the general Whitehead problem, we show that the classical Whitehead algorithm has linear average-case complexity if the rank of the free group is 2. We argue that the same should be true in a free group of any rank but point out obstacles to establishing this general result.
AbstractList The worst-case complexity of group-theoretic algorithms has been studied for a long time. Generic-case complexity, or complexity on random inputs, was introduced and studied relatively recently. In this paper, we address the average-case complexity (i.e., the expected runtime) of algorithms that solve a well-known problem, the Whitehead problem in a free group, which is: given two elements of a free group, find out whether there is an automorphism that takes one element to the other. First we address a special case of the Whitehead problem, namely deciding if a given element of a free group is part of a free basis. We show that there is an algorithm that, on a cyclically reduced input word, solves this problem and has constant (with respect to the length of the input) average-case complexity. For the general Whitehead problem, we show that the classical Whitehead algorithm has linear average-case complexity if the rank of the free group is 2. We argue that the same should be true in a free group of any rank but point out obstacles to establishing this general result.
Author Shpilrain, Vladimir
Author_xml – sequence: 1
  givenname: Vladimir
  surname: Shpilrain
  fullname: Shpilrain, Vladimir
  organization: Department of Mathematics, The City College of New York
BookMark eNqFkE1LAzEQhoNUsK3-BGHB89ZJ4m6yeGkpfkHBi-IxpMmk3bLd1CRV--_d0nrxoJeZy_u8MzwD0mt9i4RcUhhRkHANUDEhBRsxYN2glIuKnpA-LTjLbygreqS_z-T70BkZxLgCoIWQrE_Gkw8MeoG50REz49ebBr_qtMu8y9ISs7dlnXCJ2mab4OcNrjPnQ-YCYrYIfruJ5-TU6SbixXEPyev93cv0MZ89PzxNJ7PcsFKm3IKBSs5lKQxDKiQimMKWDrg1BbfdYxKYZraojJ0Lq11ZVdwBFga41iD5kFwders_3rcYk1r5bWi7k4qJkleSUQFd6vaQMsHHGNApUyedat-moOtGUVB7ZepHmdorU0dlHV38ojehXuuw-5cbH7i67eys9acPjVVJ7xofXNCtqaPif1d8AywRg-w
CitedBy_id crossref_primary_10_1515_jgth_2024_0140
crossref_primary_10_1515_jgth_2023_0050
Cites_doi 10.2140/pjm.2006.223.113
10.1515/jgth-2018-0118
10.1016/S0021-8693(03)00339-9
10.1090/S0002-9947-02-03048-9
10.4213/mzm1744
10.1112/jlms/jdu009
10.1016/S0021-8693(03)00167-4
10.2307/1968618
10.1016/j.jalgebra.2017.01.036
10.1090/conm/349/06360
10.4310/MRL.2007.v14.n2.a9
10.1016/j.jalgebra.2006.04.012
10.1016/j.aim.2003.02.001
10.1137/0206024
10.1215/ijm/1299679745
ContentType Journal Article
Copyright 2022 Taylor & Francis Group, LLC 2022
2022 Taylor & Francis Group, LLC
Copyright_xml – notice: 2022 Taylor & Francis Group, LLC 2022
– notice: 2022 Taylor & Francis Group, LLC
DBID AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1080/00927872.2022.2113791
DatabaseName CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList Computer and Information Systems Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
EISSN 1532-4125
EndPage 806
ExternalDocumentID 10_1080_00927872_2022_2113791
2113791
Genre Research Article
GroupedDBID -DZ
-~X
.7F
.QJ
0BK
0R~
29F
2DF
30N
4.4
5GY
5VS
AAENE
AAGDL
AAHIA
AAJMT
AALDU
AAMIU
AAPUL
AAQRR
ABCCY
ABFIM
ABHAV
ABJNI
ABLIJ
ABPAQ
ABPEM
ABTAI
ABXUL
ABXYU
ACGEJ
ACGFS
ACTIO
ADCVX
ADGTB
ADXPE
AEISY
AENEX
AEOZL
AEPSL
AEYOC
AFKVX
AFRVT
AGDLA
AGMYJ
AHDZW
AIJEM
AIYEW
AJWEG
AKBVH
AKOOK
ALMA_UNASSIGNED_HOLDINGS
ALQZU
AMVHM
AQRUH
AQTUD
AVBZW
AWYRJ
BLEHA
CCCUG
CE4
CS3
DGEBU
DKSSO
DU5
EBS
E~A
E~B
GTTXZ
H13
HF~
HZ~
H~P
IPNFZ
J.P
KYCEM
LJTGL
M4Z
NA5
NY~
O9-
P2P
PQQKQ
RIG
RNANH
ROSJB
RTWRZ
S-T
SNACF
TASJS
TBQAZ
TDBHL
TEJ
TFL
TFT
TFW
TN5
TOXWX
TTHFI
TUROJ
TWF
UPT
UT5
UU3
WH7
XSW
ZGOLN
~S~
AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c268t-d0c098b867c2e178ee0c5d6f03dc53d872802a2d59cdb7daf6993f0e5c03aa083
IEDL.DBID TFW
ISICitedReferencesCount 2
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000844728200001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0092-7872
IngestDate Sun Nov 30 04:41:55 EST 2025
Sat Nov 29 02:27:53 EST 2025
Tue Nov 18 22:31:17 EST 2025
Mon Oct 20 23:47:01 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 2
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c268t-d0c098b867c2e178ee0c5d6f03dc53d872802a2d59cdb7daf6993f0e5c03aa083
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
PQID 2763982170
PQPubID 2045307
PageCount 8
ParticipantIDs proquest_journals_2763982170
crossref_citationtrail_10_1080_00927872_2022_2113791
informaworld_taylorfrancis_310_1080_00927872_2022_2113791
crossref_primary_10_1080_00927872_2022_2113791
PublicationCentury 2000
PublicationDate 2023-02-01
PublicationDateYYYYMMDD 2023-02-01
PublicationDate_xml – month: 02
  year: 2023
  text: 2023-02-01
  day: 01
PublicationDecade 2020
PublicationPlace Abingdon
PublicationPlace_xml – name: Abingdon
PublicationTitle Communications in algebra
PublicationYear 2023
Publisher Taylor & Francis
Taylor & Francis Ltd
Publisher_xml – name: Taylor & Francis
– name: Taylor & Francis Ltd
References CIT0010
CIT0020
CIT0012
CIT0011
Lyndon R. C. (CIT0015) 2000; 1977
Arzhantseva G. (CIT0001) 1996; 59
CIT0003
CIT0014
CIT0002
CIT0013
CIT0005
CIT0016
CIT0004
Sanov I. N. (CIT0018) 1947; 57
CIT0007
CIT0006
CIT0017
CIT0009
CIT0008
CIT0019
References_xml – ident: CIT0010
  doi: 10.2140/pjm.2006.223.113
– volume: 1977
  volume-title: Reprinted in the Springer Classics in Mathematics series, 2000
  year: 2000
  ident: CIT0015
– ident: CIT0006
  doi: 10.1515/jgth-2018-0118
– ident: CIT0016
  doi: 10.1016/S0021-8693(03)00339-9
– ident: CIT0003
  doi: 10.1090/S0002-9947-02-03048-9
– volume: 59
  start-page: 489
  issue: 6
  year: 1996
  ident: CIT0001
  publication-title: Mat. Zametki
  doi: 10.4213/mzm1744
– ident: CIT0017
  doi: 10.1112/jlms/jdu009
– ident: CIT0007
  doi: 10.1016/S0021-8693(03)00167-4
– ident: CIT0020
  doi: 10.2307/1968618
– ident: CIT0004
  doi: 10.1016/j.jalgebra.2017.01.036
– ident: CIT0012
  doi: 10.1090/conm/349/06360
– ident: CIT0002
– ident: CIT0009
  doi: 10.4310/MRL.2007.v14.n2.a9
– ident: CIT0005
– ident: CIT0014
  doi: 10.1016/j.jalgebra.2006.04.012
– volume: 57
  start-page: 657
  year: 1947
  ident: CIT0018
  publication-title: Doklady Akad. Nauk SSSR (N. S.)
– ident: CIT0011
  doi: 10.1090/conm/349/06360
– ident: CIT0008
  doi: 10.1016/j.aim.2003.02.001
– ident: CIT0013
  doi: 10.1137/0206024
– ident: CIT0019
  doi: 10.1215/ijm/1299679745
SSID ssj0015782
Score 2.32132
Snippet The worst-case complexity of group-theoretic algorithms has been studied for a long time. Generic-case complexity, or complexity on random inputs, was...
SourceID proquest
crossref
informaworld
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 799
SubjectTerms Algorithms
Automorphisms
average-case complexity
Complexity
Free group
Whitehead problem
Title Average-case complexity of the Whitehead problem for free groups
URI https://www.tandfonline.com/doi/abs/10.1080/00927872.2022.2113791
https://www.proquest.com/docview/2763982170
Volume 51
WOSCitedRecordID wos000844728200001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAWR
  databaseName: Taylor & Francis Journals Complete
  customDbUrl:
  eissn: 1532-4125
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0015782
  issn: 0092-7872
  databaseCode: TFW
  dateStart: 19740101
  isFulltext: true
  titleUrlDefault: https://www.tandfonline.com
  providerName: Taylor & Francis
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwELZQxQADb0ShIA-shrzjbFSIigEqhgLdouR8lpBQi5qA-PmcHSeiQqgDLJlylnW-l5O772PsPAQzeKAzQakORKRKJTJMYhGFQIESPZVYsOenu3Q8ltNp9uC6CSvXVmnu0LoBirCx2jh3UVZtR9ylwQkiOzNjVAE9fD9M7fw6pX7jmpPRc_cfwYC1NziUVEeSSDvD89sqS9lpCbv0R6y2CWi0_Q9b32Fbrvrkw8ZcdtkazvbY5n0H3Vrts6shGTcFGQGU37jtOMdPKtX5XHN6jVtGPYrgijsuGk6753qByO2ESHXAHkc3k-tb4WgWBASJrIXywMtkKZMUAvRTiehBrBLthQriUElDYBUUgYozUGWqCp1QTaM9jMELi4JKuEPWm81neMR4UWqgrFsiSoi0iksfU_R1qEsJCaZBn0WtenNwGOSGCuM19zuo0kZBuVFQ7hTUZxed2FsDwrFKIPt-dnltv37ohqokD1fIDtqDzp0_V3lAYTiTdH3zjv-w9AnbMGz1TdP3gPXqxTuesnX4qF-qxZm13C_hQujO
linkProvider Taylor & Francis
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LSwMxEA5SBfXgW6xWzcHranazj-zNIpaKbU9Vewu7yQQEaaW7ij_fyb5oEelBL3vKhDCZzEyyM99HyBVXtvHAxA6GOuX4OtVODGHg-FyhowSmwwLs-XkQjUZiMokXe2FsWaW9Q5sSKKLw1fZw28fouiTuxgIFoaHZPioPP67LI9vAvh5grLX4-ePeS_MnwcK1l0iUmEmiTN3F89s0S_FpCb30h7cuQlBv9z8Wv0d2qgSUdkuL2SdrMD0g28MGvTU7JLddtG_0M47CEEeLonP4wmydzgzFYbQg1UMnrmlFR0Nx-dTMAWjRJJIdkafe_fiu71RMC47yQpE7mikWi1SEkfLAjQQAU4EODeNaBVwLy2HlJZ4OYqXTSCcmxLTGMAgU40mCWdwxaU1nUzghNEmNwsCbAgjlGx2kLkTgGm5SoUKIvDbxa_1KVcGQWzaMN-k2aKWlgqRVkKwU1CbXjdh7icOxSiBe3DyZFw8gpmQrkXyFbKfeaVkd6Ux66IljgTc4dvqHqS_JZn88HMjBw-jxjGxZ8vqyBrxDWvn8A87JhvrMX7P5RWHG36_T7Pg
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LT8MwDI7QQAgOvBGDATlwDfTd9MYEVCDGtMOA3aI2cSQktE1rQfx8nLSrmBDiAJee4ihyHNtJ7e8j5MyXpvFAJwxDnWSByhVLIApZ4Et0lOCoyII9P_Xifp-PRsmgriYs6rJKc4fWFVCE9dXmcE-VnlfEXRicILQz00bl4cd1_dj0ry9j6hwZIx-mz82PBIPWXgFRYiKJMvMmnp-mWQhPC-Cl35y1jUDp5j-sfYts1Okn7Vb2sk2WYLxD1h8a7NZil1x20brRyzCJAY7aknP4wFydTjTFYdRS6qELV7Qmo6G4eqpnANS2iBR75DG9GV7dsppngUkv4iVTjnQSnvMolh64MQdwZKgi7fhKhr7ihsHKyzwVJlLlscp0hEmNdiCUjp9lmMPtk9Z4MoYDQrNcSwy7OQCXgVZh7kIMrvZ1zmUEsdcmwVy9QtYg5IYL41W4DVZppSBhFCRqBbXJeSM2rVA4fhNIvu6dKO3zh664SoT_i2xnvtGiPtCF8NAPJxzvb87hH6Y-JauD61T07vr3R2TNMNdXBeAd0ipnb3BMVuR7-VLMTqwRfwLszuuq
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Average-case+complexity+of+the+Whitehead+problem+for+free+groups&rft.jtitle=Communications+in+algebra&rft.au=Shpilrain%2C+Vladimir&rft.date=2023-02-01&rft.pub=Taylor+%26+Francis+Ltd&rft.issn=0092-7872&rft.eissn=1532-4125&rft.volume=51&rft.issue=2&rft.spage=799&rft.epage=806&rft_id=info:doi/10.1080%2F00927872.2022.2113791&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0092-7872&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0092-7872&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0092-7872&client=summon