Palindromic width of graph of groups

Please use this identifier to cite or link to this item: http://hdl.handle.net/123456789/3175

Full metadata record

DC Field	Value	Language
dc.contributor.author	Gongopadhyay, Krishnendu	-
dc.contributor.author	Krishna, S.	-
dc.date.accessioned	2020-12-16T09:26:57Z	-
dc.date.available	2020-12-16T09:26:57Z	-
dc.date.issued	2020	-
dc.identifier.citation	Proceedings of the Indian Academy of Sciences: Mathematical Sciences, 130 (1)	en_US
dc.identifier.other	10.1007/s12044-019-0544-2	-
dc.identifier.uri	https://link.springer.com/article/10.1007%2Fs12044-019-0544-2	-
dc.identifier.uri	http://hdl.handle.net/123456789/3175	-
dc.description.abstract	In this paper, we answer questions raised by Bardakov and Gongopadhyay (Commun. Algebra43(11) (2015) 4809–4824). We prove that the palindromic width of HNN extension of a group by proper associated subgroups is infinite. We also prove that the palindromic width of the amalgamated free product of two groups via a proper subgroup is infinite (except when the amalgamated subgroup has index two in each of the factors). Combining these results it follows that the palindromic width of the fundamental group of a graph of groups is mostly infinite.	en_US
dc.language.iso	en_US	en_US
dc.publisher	Springer	en_US
dc.subject	amalgamated free product	en_US
dc.subject	graph of groups	en_US
dc.subject	HNN extension	en_US
dc.subject	Palindromic width	en_US
dc.title	Palindromic width of graph of groups	en_US
dc.type	Article	en_US
Appears in Collections:	Research Articles

Files in This Item:

File	Description	Size	Format
Need to add pdf.odt		8.63 kB	OpenDocument Text	View/Open