Please use this identifier to cite or link to this item: http://hdl.handle.net/123456789/2881
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGongopadhyay, Krishnendu-
dc.date.accessioned2020-12-09T07:10:41Z-
dc.date.available2020-12-09T07:10:41Z-
dc.date.issued2014-
dc.identifier.citationInternational Journal of Algebra and Computation,24(5),pp.553-567.en_US
dc.identifier.otherhttps://doi.org/10.1142/S0218196714500246-
dc.identifier.urihttps://www.worldscientific.com/doi/abs/10.1142/S0218196714500246-
dc.identifier.urihttp://hdl.handle.net/123456789/2881-
dc.descriptionOnly IISERM authors are available in the record.-
dc.description.abstractIn [Bardakov and Gongopadhyay, Palindromic width of free nilpotent groups, J. Algebra 402 (2014) 379-391] the authors provided a bound for the palindromic widths of free abelian-by-nilpotent group ANn of rank n and free nilpotent group Nn,r of rank n and step r. In the present paper, we study palindromic widths of groups &widetilde; ANnand &widetilde; Nn, r. We denote by &widetilde; Gn = Gn/⟨ ⟨ x12,.,xn2 ⟩ ⟩ the quotient of the group Gn = (x1,., xn), which is free in some variety by the normal subgroup generated by x12,.,xn2. We prove that the palindromic width of the quotient &widetilde; ANn is finite and bounded by 3n. We also prove that the palindromic width of the quotient &widetilde;Nn,2 is precisely 2(n-1). As a corollary to this result, we improve the lower bound of the palindromic width of Nn,r. We also improve the bound of the palindromic width of a free metabelian group. We prove that the palindromic width of a free metabelian group of rank n is at most 4n-1.en_US
dc.language.isoenen_US
dc.publisherWorld Scientificen_US
dc.subjectFree nilpotent groupsen_US
dc.subjectPalindromic widthen_US
dc.titleOn palindromic width of certain extensions and quotients of free nilpotent groupsen_US
dc.typeArticleen_US
Appears in Collections:Research Articles

Files in This Item:
File Description SizeFormat 
need to add pdf....odt8.12 kBOpenDocument TextView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.