Palindromic width of finitely generated solvable groups

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

Full metadata record

DC Field	Value	Language
dc.contributor.author	Gongopadhyay, Krishnendu	-
dc.date.accessioned	2020-12-14T07:19:12Z	-
dc.date.available	2020-12-14T07:19:12Z	-
dc.date.issued	2015	-
dc.identifier.citation	Communications in Algebra, 43 (11) pp. 4809-4824.	en_US
dc.identifier.other	10.1080/00927872.2014.952738	-
dc.identifier.uri	https://www.tandfonline.com/doi/full/10.1080/00927872.2014.952738	-
dc.identifier.uri	http://hdl.handle.net/123456789/3106	-
dc.description	Only IISERM authors are available in the record.	-
dc.description.abstract	We investigate the palindromic width of finitely generated solvable groups. We prove that every finitely generated 3-step solvable group has finite palindromic width. More generally, we show the finiteness of the palindromic width for finitely generated abelianby-nilpotent-by-nilpotent groups. For arbitrary solvable groups of step ≥ 3, we prove that if G is a finitely generated solvable group that is an extension of an abelian group by a group satisfying the maximal condition for normal subgroups, then the palindromic width of G is finite. We also prove that the palindromic width of ℤ≀ℤ with respect to the set of standard generators is 3	en_US
dc.language.iso	en_US	en_US
dc.publisher	Taylor and Francis Inc.	en_US
dc.subject	Metabelian groups	en_US
dc.subject	Palindromic width	en_US
dc.subject	Solvable groups	en_US
dc.subject	Wreath products	en_US
dc.title	Palindromic width of finitely generated solvable 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