Mostrar el registro sencillo del ítem

Artículo

dc.creatorBirman, Joan S.es
dc.creatorGebhardt, Volkeres
dc.creatorGonzález-Meneses López, Juanes
dc.date.accessioned2016-06-15T08:26:47Z
dc.date.available2016-06-15T08:26:47Z
dc.date.issued2008
dc.identifier.citationBirman, J.S., Gebhardt, V. y González-Meneses López, J. (2008). Conjugacy in Garside groups II: Structure of the ultra summit set. Groups, Geometry, and Dynamics, 2 (1), 13-61.
dc.identifier.issn1661-7207es
dc.identifier.issn1661-7215es
dc.identifier.urihttp://hdl.handle.net/11441/42278
dc.description.abstractThis paper is the second in a series in which the authors study the conjugacy decision problem (CDP) and the conjugacy search problem (CSP) in Garside groups. The ultra summit set USS(X) of an element X in a Garside group G is a finite set of elements in G, introduced by the second author, which is a complete invariant of the conjugacy class of X in G. A fundamental question, if one wishes to find bounds on the size of USS(X), is to understand its structure. In this paper we introduce two new operations on elements of USS(X), called `partial cycling' and `partial twisted decycling', and prove that if Y and Z belong to USS(X), then Y and Z are related by sequences of partial cyclings and partial twisted decyclings. These operations are a concrete way to understand the minimal simple elements which result from the convexity theorem in the mentioned paper by the second author. Using partial cycling and partial twisted decycling, we investigate the structure of a directed graph \Gamma_X which is determined by USS(X), and show that \Gamma_X can be decomposed into `black' and `grey' subgraphs. There are applications which relate to the program, outlined in the first paper in this series, for finding a polynomial solution to the CDP/CSP in the case of braids. A different application is to give a new algorithm for solving the CDP/CSP in Garside groups which is faster than all other known algorithms, even though its theoretical complexity is the same as that given by the second author. There are also applications to the theory of reductive groups.es
dc.description.sponsorshipNational Science Foundation (United States)es
dc.description.sponsorshipMinisterio de Educación y Cienciaes
dc.description.sponsorshipFondo Europeo de Desarrollo Regionales
dc.formatapplication/pdfes
dc.language.isoenges
dc.publisherEuropean Mathematical Societyes
dc.relation.ispartofGroups, Geometry, and Dynamics, 2 (1), 13-61.
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internacional*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.subjectGarside groupses
dc.subjectconjugacy problemes
dc.subjectultra summit setes
dc.subjectpartial cyclinges
dc.titleConjugacy in Garside groups II: Structure of the ultra summit setes
dc.typeinfo:eu-repo/semantics/articlees
dcterms.identifierhttps://ror.org/03yxnpp24
dc.type.versioninfo:eu-repo/semantics/publishedVersiones
dc.rights.accessRightsinfo:eu-repo/semantics/openAccesses
dc.contributor.affiliationUniversidad de Sevilla. Departamento de álgebraes
dc.relation.projectIDDMS-0405586es
dc.relation.projectIDMTM2004-07203-C02-01es
dc.identifier.doihttp://dx.doi.org/10.4171/GGD/30es
idus.format.extent41 p.es
dc.journaltitleGroups, Geometry, and Dynamicses
dc.publication.volumen2es
dc.publication.issue1es
dc.publication.initialPage13es
dc.publication.endPage61es
dc.relation.publicationplaceZuriches
dc.identifier.idushttps://idus.us.es/xmlui/handle/11441/42278

FicherosTamañoFormatoVerDescripción
Conjugacy in Garside groups II ...566.4KbIcon   [PDF] Ver/Abrir  

Este registro aparece en las siguientes colecciones

Mostrar el registro sencillo del ítem

Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Excepto si se señala otra cosa, la licencia del ítem se describe como: Attribution-NonCommercial-NoDerivatives 4.0 Internacional