Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ UPCommons. Portal de...arrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
Recolector de Ciencia Abierta, RECOLECTA
Article . 2024 . Peer-reviewed
License: CC BY
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
zbMATH Open
Article . 2024
Data sources: zbMATH Open
International Journal of Algebra and Computation
Article . 2024 . Peer-reviewed
Data sources: Crossref
https://dx.doi.org/10.48550/ar...
Article . 2021
License: CC BY
Data sources: Datacite
versions View all 6 versions
addClaim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

Dependence over subgroups of free groups

Authors: Amnon Rosenmann; Enric Ventura;

Dependence over subgroups of free groups

Abstract

Given a finitely generated subgroup H of a free group F, we present an algorithm which computes [Formula: see text], such that the set of elements [Formula: see text], for which there exists a non-trivial H-equation having g as a solution is precisely the disjoint union of the double cosets [Formula: see text]. Moreover, we present an algorithm which, given a finitely generated subgroup [Formula: see text] and an element [Formula: see text], computes a finite set of elements from [Formula: see text] (of the minimum possible cardinality) generating, as a normal subgroup, the “ideal” [Formula: see text] of all “polynomials” [Formula: see text], such that [Formula: see text]. 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 [Formula: see text] on a subgroup H. We also study the corresponding notions of dependence sequence and dependence closure of a subgroup.

Keywords

Generators, relations, and presentations of groups, Free nonabelian groups, Group Theory (math.GR), algebraic extension in free groups, equations over free groups, Classificació AMS::20 Group theory and generalizations::20F Special aspects of infinite or finite groups, Algebraic geometry over groups; equations over groups, dependence in free groups, Nielsen transformations, Àrees temàtiques de la UPC::Matemàtiques i estadística::Àlgebra, Algebraic extension in free groups, Classificació AMS::20 Group theory and generalizations::20E Structure and classification of infinite or finite groups, FOS: Mathematics, Dependence in free groups, Stallings foldings, Equations over free groups, Geometric group theory, Mathematics - Group Theory, 20F70

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    0
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
0
Average
Average
Average
Green