Pasar al contenido principal

METODOS GEOMETRICOS EN TEORIA DE GRUPOS

MTM2017-82740-P

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal de Fomento de la Investigación Científica y Técnica de Excelencia
Subprograma Subprograma Estatal de Generación de Conocimiento
Convocatoria Proyectos de I+D (Excelencia / Generación de Conocimiento)
Año convocatoria 2017
Plan Estatal 2017-2020 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): 23
Encontrada(s) 1 página(s)

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

Degrees of compression and inertia for free-abelian times free groups

  • Roy, Mallika|||0000-0002-9730-5980
  • Ventura Capell, Enric|||0000-0003-3519-4135
© 2020. Elsevier, We introduce the concepts of degree of inertia, diG(H), and degree of compression,dcG(H), of a finitely generated subgroupHof a given groupG. For the case of direct productsof free-abelian and free groups, we compute the degree of compression and give an upper boundfor the degree of inertia. Imposing some technical assumptions to the supremum involved in thedefinition of degree of inertia, we introduce the notion called restricted degree of inertia, di'G(H),and, again for the caseZm×Fn, we provide an explicit formula relating it to the restricted degreeof inertia of its projection to the free part, di'Fn(Hp)., Both authors are partially supported by the Spanish Agencia Estatalde Investigación, through grant MTM2017-82740-P (AEI/ FEDER, UE), and also by the “María de Maeztu” Programme for Units of Excellence in R&D (MDM-2014-0445), Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

A list of applications of stallings automata

  • Delgado Pin, Jordi|||0000-0003-4546-8355
  • Ventura Capell, Enric|||0000-0003-3519-4135
This survey is intended to be a fast (and reasonably updated) reference for the theory of Stallings automata and its applications to the study of subgroups of the free group, with the main accent on algorithmic aspects. Consequently, results concerning finitely generated subgroups have greater prominence in the paper. However, when possible, we try to state the results with more generality, including the usually overlooked non-(finitely-generated) case., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Autòmats de Stallings, un camí d'anada i tornada

  • Ventura Capell, Enric|||0000-0003-3519-4135
  • Delgado Rodríguez, Jordi|||0000-0002-8365-8929
En aquest article revisem algunes de les propietats fonamentals del grup lliure i fem una exposició detallada de la teoria dels autòmats de Stallings, una interpretació geomètrica dels seus subgrups que ha estat (i segueix essent) immensament fructífera, tant com a mitjà per a entendre resultats clàssics com com a font de nous resultats. N’expliquem alguns dels més rellevants., Els autors agraïm el suport parcial rebut de l’Agencia Estatal de Investigación, a través del projecte de recerca MTM2017-82740-P (AEI/FEDER, UE). El primer autor va realitzar la primera part d’aquest treball a la Universitat del País Basc (UPV/EHU) amb suport parcial del MINECO a través del projecte PID2019- 107444GA-I00, i del Govern basc amb el projecte IT974-16.
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Fixed subgroups in direct products of surface groups of Euclidean type

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

Relative order and spectrum in free and related groups

  • Delgado Rodríguez, Jordi|||0000-0002-8365-8929
  • Ventura Capell, Enric|||0000-0003-3519-4135
  • Zakharov, Alexander
We consider a natural generalization of the concept of order of an element in a group: an element g ¿ G is said to have order k in a subgroup H (resp., in a coset Hu) of a group G if k is the first strictly positive integer such that gk ¿ H (resp., gk ¿ Hu). We study this notion and its algorithmic properties in the realm of free groups and some related families. Both positive and negative (algorithmic) results emerge in this setting. On the positive side, among other results, we prove that the order of elements, the set of orders (called spectrum), and the set of preorders (i.e., the set of elements of a given order) w.r.t. finitely generated subgroups are always computable in free and free times free-abelian groups. On the negative side, we provide examples of groups and subgroups having essentially any subset of natural numbers as relative spectrum; in particular, non-recursive and even non-recursively enumerable sets of natural numbers. Also, we take advantage of Mikhailova’s construction to see that the spectrum membership problem is unsolvable for direct products of nonabelian free groups., The first named author was partially supported by MINECO grant PID2019-107444GA-I00 and the Basque Government grant IT974-16. The second named author acknowledges partial support from the Spanish Agencia Estatal de Investigación, through grant MTM2017-82740-P (AEI/ FEDER, UE), and also from the Graduate School of Mathematics through the María de Maeztu Programme for Units of Excellence in R&D (MDM-2014-0445). The third named author was partially supported by (Polish) Narodowe Centrum Nauki, grant UMO-2018/31/G/ST1/02681., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Probabilistic nilpotence in infinite groups

  • Ventura Capell, Enric|||0000-0003-3519-4135
  • Martino, Armando
  • Tointon, Matthew C.H.
  • Valiunas, Motiejus
The version of record is available online at: http://dx.doi.org/10.1007/s11856-021-2168-3 The first and third authors gratefully acknowledge the grant SEV-20150554 which partially funded their stay at the ICMAT, where a part of the research for this paper was done. The second author was supported by grant FN 200021_163417/1 of the Swiss National Fund for scientific research., The ‘degree of k-step nilpotence’ of a finite group G is the proportion of the tuples (x1,…, xk+1 ¿ Gk+1 for which the simple commutator [x1, …, xk+1] is equal to the identity. In this paper we study versions of this for an infinite group G, with the degree of nilpotence defined by sampling G in various natural ways, such as with a random walk, or with a Følner sequence if G is amenable. In our first main result we show that if G is finitely generated, then the degree of k-step nilpotence is positive if and only if G is virtually k-step nilpotent (Theorem 1.5). This generalises both an earlier result of the second author treating the case k = 1 and a result of Shalev for finite groups, and uses techniques from both of these earlier results. We also show, using the notion of polynomial mappings of groups developed by Leibman and others, that to a large extent the degree of nilpotence does not depend on the method of sampling (Theorem 1.12). As part of our argument we generalise a result of Leibman by showing that if ¿ is a polynomial mapping into a torsion-free nilpotent group, then the set of roots of ¿ is sparse in a certain sense (Theorem 5.1). In our second main result we consider the case where G is residually finite but not necessarily finitely generated. Here we show that if the degree of k-step nilpotence of the finite quotients of G is uniformly bounded from below, then G is virtually k-step nilpotent (Theorem 1.19), answering a question of Shalev. As part of our proof we show that degree of nilpotence of finite groups is sub-multiplicative with respect to quotients (Theorem 1.21), generalising a result of Gallagher., Peer Reviewed
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)

Intersection configurations in free and free times free-abelian groups

  • Delgado Rodríguez, Jordi|||0000-0002-8365-8929
  • Roy, Mallika|||0000-0002-9730-5980
  • Ventura Capell, Enric|||0000-0003-3519-4135
In this paper, we study intersection configurations – which describe the behaviour of multiple (finite) intersections of subgroups with respect to finite generability – in the realm of free and free times free-abelian (FTFA) groups. We say that a configuration is realizable in a group G if there exist subgroups H1,…,Hk¿G realizing it. It is well known that free groups Fn satisfy the Howson property: the intersection of any two finitely generated subgroups is again finitely generated. We show that the Howson property is indeed the only obstruction for multiple intersection configurations to be realizable within nonabelian free groups. On the contrary, FTFA groups Fn×Zm are well known to be non-Howson. We also study multiple intersections within FTFA groups, providing an algorithm to decide, given k=2 finitely generated subgroups, whether their intersection is again finitely generated and, in the affirmative case, compute a ‘basis’ for it. We finally prove that any intersection configuration is realizable in an FTFA group Fn×Zm , for n=2 and large enough m . As a consequence, we exhibit finitely presented groups where every intersection configuration is realizable., We are grateful to the anonymous referee for the detailed report on the initial version of this paper, which pointed out an overly coarse approach to the proof of the delicate Theorem 2.14. This feedback enabled us to refine it to its current final form. The three authors acknowledge support from the Spanish Agencia Estatal de Investigación through grant MTM2017-82740-P (AEI/ FEDER, UE). The first named author was also partially supported by MINECO grant PID2019-107444GA-I00 and the Basque Government grant IT974- 16, and thanks for the support provided from the Universitat Politècnica de Catalunya through a María Zambrano grant. The second named author would like to express gratitude for the hospitality received from the Universidad del País Vasco (UPV/EHU) and for the support provided through a Margarita Salas grant from the Universitat Politècnica de Catalunya., 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
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

An irrational-slope Thompson’s group

  • Burillo Puig, José|||0000-0002-1078-3614
  • Nucinkis, Brita
  • Reeves, Lawrence
The purpose of this paper is to study the properties of the irrational-slope Thompson’s group Ft introduced by Cleary in [11]. We construct presentations, both finite and infinite, and we describe its combinatorial structure using binary trees. We show that its commutator group is simple. Finally, inspired by the case of Thompson’s group F, we define a unique normal form for the elements of the group and study the metric properties for the elements based on this normal form. As a corollary, we see that several embeddings of F in Ft are undistorted., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Onto extensions of free groups

  • Ventura Capell, Enric|||0000-0003-3519-4135
  • Mijares, Sebastià
Rationale Cocaine addiction is a chronic relapsing disorder that lacks of an effective treatment. Isoflavones are a family of compounds present in different plants and vegetables like soybeans that share a common chemical structure. Previous studies have described that synthetic derivatives from the natural isoflavone daidzin can modulate cocaine addiction, by a mechanism suggested to involve aldehyde-dehydrogenase (ALDH) activities. An extension of subgroups H 6 K 6 FA of the free group of rank |A| = r > 2 is called onto when, for every ambient basis A 0 , the Stallings graph GA0 (K) is a quotient of GA0 (H). Algebraic extensions are onto and the converse implication was conjectured by Miasnikov–Ventura–Weil, and resolved in the negative, first by Parzanchevski–Puder for rank r = 2, and recently by Kolodner for general rank. In this note we study properties of this new type of extension among free groups (as well as the fully onto variant), and investigate their corresponding closure operators. Interestingly, the natural attempt for a dual notion –into extensions– becomes trivial, making a Takahasi type theorem not possible in this setting., The first named author acknowledges support from the Spanish Agencia Estatal de Investigación within the grants for PhD candidate researchers FPI 2019 (AEI/FSE, EU). The second named author acknowledge partial support from the Spanish Agencia Estatal de Investigación, through grant MTM2017-82740-P (AEI/ FEDER, UE), and also from the Graduate School of Mathematics through the “María de Maeztu” Programme for Units of Excellence in R&D (MDM-2014-0445)., Peer Reviewed
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)

Degrees of compression and inertia for free-abelian times free groups

  • Roy, Mallika
  • Ventura Capell, Enric
© 2020. Elsevier, We introduce the concepts of degree of inertia, diG(H), and degree of compression,dcG(H), of a finitely generated subgroupHof a given groupG. For the case of direct productsof free-abelian and free groups, we compute the degree of compression and give an upper boundfor the degree of inertia. Imposing some technical assumptions to the supremum involved in thedefinition of degree of inertia, we introduce the notion called restricted degree of inertia, di'G(H),and, again for the caseZm×Fn, we provide an explicit formula relating it to the restricted degreeof inertia of its projection to the free part, di'Fn(Hp)., Both authors are partially supported by the Spanish Agencia Estatalde Investigación, through grant MTM2017-82740-P (AEI/ FEDER, UE), and also by the “María de Maeztu” Programme for Units of Excellence in R&D (MDM-2014-0445), Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

An irrational-slope Thompson’s group

  • Burillo Puig, José
  • Nucinkis, Brita
  • Reeves, Lawrence
The purpose of this paper is to study the properties of the irrational-slope Thompson’s group Ft introduced by Cleary in [11]. We construct presentations, both finite and infinite, and we describe its combinatorial structure using binary trees. We show that its commutator group is simple. Finally, inspired by the case of Thompson’s group F, we define a unique normal form for the elements of the group and study the metric properties for the elements based on this normal form. As a corollary, we see that several embeddings of F in Ft are undistorted., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Relative order and spectrum in free and related groups

  • Delgado Rodríguez, Jordi
  • Ventura Capell, Enric
  • Zakharov, Alexander
We consider a natural generalization of the concept of order of an element in a group: an element g ¿ G is said to have order k in a subgroup H (resp., in a coset Hu) of a group G if k is the first strictly positive integer such that gk ¿ H (resp., gk ¿ Hu). We study this notion and its algorithmic properties in the realm of free groups and some related families. Both positive and negative (algorithmic) results emerge in this setting. On the positive side, among other results, we prove that the order of elements, the set of orders (called spectrum), and the set of preorders (i.e., the set of elements of a given order) w.r.t. finitely generated subgroups are always computable in free and free times free-abelian groups. On the negative side, we provide examples of groups and subgroups having essentially any subset of natural numbers as relative spectrum; in particular, non-recursive and even non-recursively enumerable sets of natural numbers. Also, we take advantage of Mikhailova’s construction to see that the spectrum membership problem is unsolvable for direct products of nonabelian free groups., The first named author was partially supported by MINECO grant PID2019-107444GA-I00 and the Basque Government grant IT974-16. The second named author acknowledges partial support from the Spanish Agencia Estatal de Investigación, through grant MTM2017-82740-P (AEI/ FEDER, UE), and also from the Graduate School of Mathematics through the María de Maeztu Programme for Units of Excellence in R&D (MDM-2014-0445). The third named author was partially supported by (Polish) Narodowe Centrum Nauki, grant UMO-2018/31/G/ST1/02681., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Intersection configurations in free and free times free-abelian groups

  • Delgado Rodríguez, Jordi
  • Roy, Mallika
  • Ventura Capell, Enric
In this paper, we study intersection configurations – which describe the behaviour of multiple (finite) intersections of subgroups with respect to finite generability – in the realm of free and free times free-abelian (FTFA) groups. We say that a configuration is realizable in a group G if there exist subgroups H1,…,Hk¿G realizing it. It is well known that free groups Fn satisfy the Howson property: the intersection of any two finitely generated subgroups is again finitely generated. We show that the Howson property is indeed the only obstruction for multiple intersection configurations to be realizable within nonabelian free groups. On the contrary, FTFA groups Fn×Zm are well known to be non-Howson. We also study multiple intersections within FTFA groups, providing an algorithm to decide, given k=2 finitely generated subgroups, whether their intersection is again finitely generated and, in the affirmative case, compute a ‘basis’ for it. We finally prove that any intersection configuration is realizable in an FTFA group Fn×Zm , for n=2 and large enough m . As a consequence, we exhibit finitely presented groups where every intersection configuration is realizable., We are grateful to the anonymous referee for the detailed report on the initial version of this paper, which pointed out an overly coarse approach to the proof of the delicate Theorem 2.14. This feedback enabled us to refine it to its current final form. The three authors acknowledge support from the Spanish Agencia Estatal de Investigación through grant MTM2017-82740-P (AEI/ FEDER, UE). The first named author was also partially supported by MINECO grant PID2019-107444GA-I00 and the Basque Government grant IT974- 16, and thanks for the support provided from the Universitat Politècnica de Catalunya through a María Zambrano grant. The second named author would like to express gratitude for the hospitality received from the Universidad del País Vasco (UPV/EHU) and for the support provided through a Margarita Salas grant from the Universitat Politècnica de Catalunya., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Probabilistic nilpotence in infinite groups

  • Ventura Capell, Enric
  • Martino, Armando
  • Tointon, Matthew C.H.
  • Valiunas, Motiejus
The version of record is available online at: http://dx.doi.org/10.1007/s11856-021-2168-3 The first and third authors gratefully acknowledge the grant SEV-20150554 which partially funded their stay at the ICMAT, where a part of the research for this paper was done. The second author was supported by grant FN 200021_163417/1 of the Swiss National Fund for scientific research., The ‘degree of k-step nilpotence’ of a finite group G is the proportion of the tuples (x1,…, xk+1 ¿ Gk+1 for which the simple commutator [x1, …, xk+1] is equal to the identity. In this paper we study versions of this for an infinite group G, with the degree of nilpotence defined by sampling G in various natural ways, such as with a random walk, or with a Følner sequence if G is amenable. In our first main result we show that if G is finitely generated, then the degree of k-step nilpotence is positive if and only if G is virtually k-step nilpotent (Theorem 1.5). This generalises both an earlier result of the second author treating the case k = 1 and a result of Shalev for finite groups, and uses techniques from both of these earlier results. We also show, using the notion of polynomial mappings of groups developed by Leibman and others, that to a large extent the degree of nilpotence does not depend on the method of sampling (Theorem 1.12). As part of our argument we generalise a result of Leibman by showing that if ¿ is a polynomial mapping into a torsion-free nilpotent group, then the set of roots of ¿ is sparse in a certain sense (Theorem 5.1). In our second main result we consider the case where G is residually finite but not necessarily finitely generated. Here we show that if the degree of k-step nilpotence of the finite quotients of G is uniformly bounded from below, then G is virtually k-step nilpotent (Theorem 1.19), answering a question of Shalev. As part of our proof we show that degree of nilpotence of finite groups is sub-multiplicative with respect to quotients (Theorem 1.21), generalising a result of Gallagher., 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
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Autòmats de Stallings, un camí d'anada i tornada

  • Ventura Capell, Enric
  • Delgado Rodríguez, Jordi
En aquest article revisem algunes de les propietats fonamentals del grup lliure i fem una exposició detallada de la teoria dels autòmats de Stallings, una interpretació geomètrica dels seus subgrups que ha estat (i segueix essent) immensament fructífera, tant com a mitjà per a entendre resultats clàssics com com a font de nous resultats. N’expliquem alguns dels més rellevants., Els autors agraïm el suport parcial rebut de l’Agencia Estatal de Investigación, a través del projecte de recerca MTM2017-82740-P (AEI/FEDER, UE). El primer autor va realitzar la primera part d’aquest treball a la Universitat del País Basc (UPV/EHU) amb suport parcial del MINECO a través del projecte PID2019- 107444GA-I00, i del Govern basc amb el projecte IT974-16., Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

A list of applications of stallings automata

  • Delgado Pin, Jordi
  • Ventura Capell, Enric
This survey is intended to be a fast (and reasonably updated) reference for the theory of Stallings automata and its applications to the study of subgroups of the free group, with the main accent on algorithmic aspects. Consequently, results concerning finitely generated subgroups have greater prominence in the paper. However, when possible, we try to state the results with more generality, including the usually overlooked non-(finitely-generated) case., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Onto extensions of free groups

  • Ventura Capell, Enric
  • Mijares, Sebastià
Rationale Cocaine addiction is a chronic relapsing disorder that lacks of an effective treatment. Isoflavones are a family of compounds present in different plants and vegetables like soybeans that share a common chemical structure. Previous studies have described that synthetic derivatives from the natural isoflavone daidzin can modulate cocaine addiction, by a mechanism suggested to involve aldehyde-dehydrogenase (ALDH) activities. An extension of subgroups H 6 K 6 FA of the free group of rank |A| = r > 2 is called onto when, for every ambient basis A 0 , the Stallings graph GA0 (K) is a quotient of GA0 (H). Algebraic extensions are onto and the converse implication was conjectured by Miasnikov–Ventura–Weil, and resolved in the negative, first by Parzanchevski–Puder for rank r = 2, and recently by Kolodner for general rank. In this note we study properties of this new type of extension among free groups (as well as the fully onto variant), and investigate their corresponding closure operators. Interestingly, the natural attempt for a dual notion –into extensions– becomes trivial, making a Takahasi type theorem not possible in this setting., The first named author acknowledges support from the Spanish Agencia Estatal de Investigación within the grants for PhD candidate researchers FPI 2019 (AEI/FSE, EU). The second named author acknowledge partial support from the Spanish Agencia Estatal de Investigación, through grant MTM2017-82740-P (AEI/ FEDER, UE), and also from the Graduate School of Mathematics through the “María de Maeztu” Programme for Units of Excellence in R&D (MDM-2014-0445)., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Fixed subgroups in direct products of surface groups of Euclidean type

Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

An irrational-slope Thompson's group

  • Burillo, Jose|||0000-0002-1078-3614
  • Nucinkis, Brita|||0000-0002-6447-3945
  • Reeves, Lawrence
The purpose of this paper is to study the properties of the irrational-slope Thompson's group Fτ introduced by Cleary in [11]. We construct presentations, both finite and infinite, and we describe its combinatorial structure using binary trees. We show that its commutator group is simple. Finally, inspired by the case of Thompson's group F, we define a unique normal form for the elements of the group and study the metric properties for the elements based on this normal form. As a corollary, we see that several embeddings of F in Fτ are undistorted.