Pasar al contenido principal

METODOS GEOMETRICOS EN TEORIA DE GRUPOS

MTM2011-25955

•
Nombre agencia financiadora Ministerio de Ciencia e Innovación
Acrónimo agencia financiadora MICINN
Programa Programa Nacional de Proyectos de Investigación Fundamental
Subprograma Subprograma de Proyectos de Investigación Fundamental no Orientada
Convocatoria Proyectos I+D
Año convocatoria 2011
Plan Estatal 2008-2011 Plan Nacional de Investigación Científica, Desarrollo e Innovación Tecnológica
Unidad de gestión Subdirección General de Proyectos de Investigación
Centro beneficiario UNIVERSITAT POLITECNICA DE CATALUNYA
Identificador persistente http://dx.doi.org/10.13039/501100004837

Resultados relacionados

Resultados totales (Incluyendo duplicados): 4
Encontrada(s) 1 página(s)

UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Intersection problem for Droms RAAGs

  • Delgado Rodríguez, Jorge
  • Ventura Capell, Enric|||0000-0003-3519-4135
  • Zakharov, Alexander
We solve the subgroup intersection problem (SIP) for any RAAG G of Droms type (i.e., with defining graph not containing induced squares or paths of length 3): there is an algorithm which, given finite sets of generators for two subgroups H,K of G, decides whether HnK is finitely generated or not, and, in the affirmative case, it computes a set of generators for HnK. Taking advantage of the recursive characterization of Droms groups, the proof consists in separately showing that the solvability of SIP passes through free products, and through direct products with free-abelian groups. We note that most of RAAGs are not Howson, and many (e.g. F_2 x F_2) even have unsolvable SIP., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Bounding the gap between a free group (outer) automorphism and its inverse

  • Ladra, Manuel
  • Silva, Pedro V.
  • Ventura Capell, Enric|||0000-0003-3519-4135
The final publication is available at Springer via http://dx.doi.org/10.1007/s13348-015-0133-3., For any finitely generated group GG , two complexity functions aGaG and ßGßG are defined to measure the maximal possible gap between the norm of an automorphism (respectively, outer automorphism) of GG and the norm of its inverse. Restricting attention to free groups FrFr , the exact asymptotic behaviour of a2a2 and ß2ß2 is computed. For rank r¿3r¿3 , polynomial lower bounds are provided for arar and ßrßr , and the existence of a polynomial upper bound is proved for ßrßr ., Peer Reviewed
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Bounding the gap between a free group (outer) automorphism and its inverse

  • Ladra, Manuel
  • Silva, Pedro V.
  • Ventura Capell, Enric
The final publication is available at Springer via http://dx.doi.org/10.1007/s13348-015-0133-3., For any finitely generated group GG , two complexity functions aGaG and ßGßG are defined to measure the maximal possible gap between the norm of an automorphism (respectively, outer automorphism) of GG and the norm of its inverse. Restricting attention to free groups FrFr , the exact asymptotic behaviour of a2a2 and ß2ß2 is computed. For rank r¿3r¿3 , polynomial lower bounds are provided for arar and ßrßr , and the existence of a polynomial upper bound is proved for ßrßr ., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Intersection problem for Droms RAAGs

  • Delgado Rodríguez, Jorge
  • Ventura Capell, Enric
  • Zakharov, Alexander
We solve the subgroup intersection problem (SIP) for any RAAG G of Droms type (i.e., with defining graph not containing induced squares or paths of length 3): there is an algorithm which, given finite sets of generators for two subgroups H,K of G, decides whether HnK is finitely generated or not, and, in the affirmative case, it computes a set of generators for HnK. Taking advantage of the recursive characterization of Droms groups, the proof consists in separately showing that the solvability of SIP passes through free products, and through direct products with free-abelian groups. We note that most of RAAGs are not Howson, and many (e.g. F_2 x F_2) even have unsolvable SIP., Peer Reviewed, Preprint