Pasar al contenido principal

METODOS GEOMETRICOS EN TEORIA DE GRUPOS

PID2021-126851NB-I00

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal para Impulsar la Investigación Científico-Técnica y su Transferencia
Subprograma Subprograma Estatal de Generación de Conocimiento
Convocatoria Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Año convocatoria 2021
Plan Estatal 2021-2023 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSITAT POLITECNICA DE CATALUNYA

Resultados relacionados

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

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

Computation of endo-fixed closures in free-abelian times free groups

  • Roy, Mallika|||0000-0002-9730-5980
  • Ventura Capell, Enric|||0000-0003-3519-4135
In this paper, we explore the behaviour of the fixed subgroups of endomorphisms of free-abelian times free (FATF) groups. We exhibit an algorithm which, given a finitely generated subgroup H of a FATF group G , decides whether H is the fixed subgroup of some (finite) family of endomorphisms of G and, in the affirmative case, finds such a family. The algorithm combines both combinatorial and algebraic methods., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Decidability of the Brinkmann problems for endomorphisms of the free group

  • Carvalho, André
  • Delgado Rodríguez, Jordi|||0000-0002-8365-8929
The version of record of this article, first published in Archiv der mathematik, is available online at Publisher’s website: http://dx.doi.org/10.1007/s00013-024-02029-2, Building on the work of Brinkmann and Logan, we show that both the Brinkmann problem and the Brinkmann conjugacy problem are decidable for endomorphisms of the free group Fn., The first author is funded by national funds through the FCT - Fundação para a Ciência e a Tecnologia, I.P., under the scope of the projects UIDB/00297/2020 and UIDP/00297/2020 (Center for Mathematics and Applications). The second author acknowledges support from the Spanish Agencia Estatal de Investigación through grant PID2021-126851NB-I00 (AEI/ FEDER, UE), as well as from the Universitat Politècnica de Catalunya in the form of a “María Zambrano” scholarship
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Computing H-equations with 2-by-2 integral matrices

  • Bastardas Ferrer, Gemma
  • Ventura Capell, Enric|||0000-0003-3519-4135
We study the transference through finite index extensions of the notion of equational coherence, as well as its effective counterpart. We deduce an explicit algorithm for solving the following algorithmic problem about size two integral invertible matrices: “given h1,..., hr; g ¿ PSL2 (Z), decide whether g is algebraic over the subgroup H = <h1,..., hr> <= PSL2 (Z) (i.e., whether there exist a non-trivial H-equation w(x) ¿ H¿<x> such that w(g) = 1) and, in the affirmative case, compute finitely many such H-equations w1(x),..., ws(x) ¿ H¿<x> further satisfying that any w(x) ¿ H¿<x> with w(g) = 1 is a product of conjugates of w1(x),..., ws(x)”. The same problem for square matrices of size 4 and bigger is unsolvable., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Dependence over subgroups of free groups

  • Rosenmann, Amnon
  • Ventura Capell, Enric|||0000-0003-3519-4135
Electronic version of an article published as International Journal of Algebra and Computation, Vol. 34, No. 4, 2024, pp. 439-470 DOI: 10.1142/S0218196724500176 © 2024 World Scientific Publishing Company https://www.worldscientific.com/doi/10.1142/S0218196724500176, Given a finitely generated subgroup H of a free group F, we present an algorithm which computes g_1, ..., g_m \in F, such that the set of elements g \in F, for which there exists a non-trivial H-equation having g as a solution is precisely the disjoint union of the double cosets H \sqcup Hg_1H \sqcup \cdots \sqcup Hg_mH. Moreover, we present an algorithm which, given a finitely generated subgroup H \leq F and an element g \in F, computes a finite set of elements from H \ast \langle x \rangle (of the minimum possible cardinality) generating, as a normal subgroup, the “ideal” I_H(g) \trianglelefteq H \ast \langle x \rangle of all polynomials w(x), such that w(g) = 1. The algorithms, as well as the proofs, are based on the graph-theoretic techniques introduced by Stallings and on the more classical combinatorial techniques of Nielsen transformations. The key notion here is that of dependence of an element g \in F on a subgroup H. We also study the corresponding notions of dependence sequence and dependence closure of a subgroup., The first named author acknowledges the support of the Austrian Science Fund (FWF) project P29355-N35. The second named author acknowledges partial support from the Spanish Agencia Estatal de Investigaci ́on, through grants MTM2017-82740-P and PID2021-126851NB-100 (AEI/ FEDER, UE)., Peer Reviewed
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Decidability of the Brinkmann problems for endomorphisms of the free group

  • Carvalho, André
  • Delgado Rodríguez, Jordi
The version of record of this article, first published in Archiv der mathematik, is available online at Publisher’s website: http://dx.doi.org/10.1007/s00013-024-02029-2, Building on the work of Brinkmann and Logan, we show that both the Brinkmann problem and the Brinkmann conjugacy problem are decidable for endomorphisms of the free group Fn., The first author is funded by national funds through the FCT - Fundação para a Ciência e a Tecnologia, I.P., under the scope of the projects UIDB/00297/2020 and UIDP/00297/2020 (Center for Mathematics and Applications). The second author acknowledges support from the Spanish Agencia Estatal de Investigación through grant PID2021-126851NB-I00 (AEI/ FEDER, UE), as well as from the Universitat Politècnica de Catalunya in the form of a “María Zambrano” scholarship, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Dependence over subgroups of free groups

  • Rosenmann, Amnon
  • Ventura Capell, Enric
Electronic version of an article published as International Journal of Algebra and Computation, Vol. 34, No. 4, 2024, pp. 439-470 DOI: 10.1142/S0218196724500176 © 2024 World Scientific Publishing Company https://www.worldscientific.com/doi/10.1142/S0218196724500176, Given a finitely generated subgroup H of a free group F, we present an algorithm which computes g_1, ..., g_m \in F, such that the set of elements g \in F, for which there exists a non-trivial H-equation having g as a solution is precisely the disjoint union of the double cosets H \sqcup Hg_1H \sqcup \cdots \sqcup Hg_mH. Moreover, we present an algorithm which, given a finitely generated subgroup H \leq F and an element g \in F, computes a finite set of elements from H \ast \langle x \rangle (of the minimum possible cardinality) generating, as a normal subgroup, the “ideal” I_H(g) \trianglelefteq H \ast \langle x \rangle of all polynomials w(x), such that w(g) = 1. The algorithms, as well as the proofs, are based on the graph-theoretic techniques introduced by Stallings and on the more classical combinatorial techniques of Nielsen transformations. The key notion here is that of dependence of an element g \in F on a subgroup H. We also study the corresponding notions of dependence sequence and dependence closure of a subgroup., The first named author acknowledges the support of the Austrian Science Fund (FWF) project P29355-N35. The second named author acknowledges partial support from the Spanish Agencia Estatal de Investigaci ́on, through grants MTM2017-82740-P and PID2021-126851NB-100 (AEI/ FEDER, UE)., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Computing H-equations with 2-by-2 integral matrices

  • Bastardas Ferrer, Gemma
  • Ventura Capell, Enric
We study the transference through finite index extensions of the notion of equational coherence, as well as its effective counterpart. We deduce an explicit algorithm for solving the following algorithmic problem about size two integral invertible matrices: “given h1,..., hr; g ¿ PSL2 (Z), decide whether g is algebraic over the subgroup H = <h1,..., hr> <= PSL2 (Z) (i.e., whether there exist a non-trivial H-equation w(x) ¿ H¿<x> such that w(g) = 1) and, in the affirmative case, compute finitely many such H-equations w1(x),..., ws(x) ¿ H¿<x> further satisfying that any w(x) ¿ H¿<x> with w(g) = 1 is a product of conjugates of w1(x),..., ws(x)”. The same problem for square matrices of size 4 and bigger is unsolvable., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Computation of endo-fixed closures in free-abelian times free groups

  • Roy, Mallika
  • Ventura Capell, Enric
In this paper, we explore the behaviour of the fixed subgroups of endomorphisms of free-abelian times free (FATF) groups. We exhibit an algorithm which, given a finitely generated subgroup H of a FATF group G , decides whether H is the fixed subgroup of some (finite) family of endomorphisms of G and, in the affirmative case, finds such a family. The algorithm combines both combinatorial and algebraic methods., Peer Reviewed, Postprint (author's final draft)