AbstractThe genus of the graph of any less-than-one-24th group, in the sense of Greendlinger, all of whose relators are of equal lengths, is shown to be decidable via the existence of an algorithm
AbstractThe classical results of Magnus on one-relator groups (such as the Freiheitssatz and the sol...
In this thesis we study algorithmic aspects of balanced group presentations which are finite present...
AbstractWe introduce “endomorphic presentations,” or L-presentations: group presentations whose rela...
AbstractThe genus of the graph of any less-than-one-24th group, in the sense of Greendlinger, all of...
AbstractAny graph is a subgraph of a Cayley diagram. Planar graphs are subgraphs of planar Cayley di...
AbstractAny graph is a subgraph of a Cayley diagram. Planar graphs are subgraphs of planar Cayley di...
We consider groups defined by non-empty balanced presentations with the property that each relator i...
The genus of a group is the minimum genus for any Cayley color graph of the group. Using the structu...
We obtain an effective enumeration of the family of finitely generated groups admitting a faithful,...
We present a metric condition which describes the geometry of classical small cancellation groups an...
AbstractWe conjecture that every finite groupGhas a short presentation (in terms of generators and r...
Groups defined by presentations for which the components of the corresponding star graph are the inc...
AbstractAn example is given of a finite group A of order 144, with a generating set X = {x, y} such ...
AbstractThe genus of a finite group is the minimum genus over all surfaces containing an imbedded Ca...
We conjecture that every finite group G has a short presentation (in terms of generators and relatio...
AbstractThe classical results of Magnus on one-relator groups (such as the Freiheitssatz and the sol...
In this thesis we study algorithmic aspects of balanced group presentations which are finite present...
AbstractWe introduce “endomorphic presentations,” or L-presentations: group presentations whose rela...
AbstractThe genus of the graph of any less-than-one-24th group, in the sense of Greendlinger, all of...
AbstractAny graph is a subgraph of a Cayley diagram. Planar graphs are subgraphs of planar Cayley di...
AbstractAny graph is a subgraph of a Cayley diagram. Planar graphs are subgraphs of planar Cayley di...
We consider groups defined by non-empty balanced presentations with the property that each relator i...
The genus of a group is the minimum genus for any Cayley color graph of the group. Using the structu...
We obtain an effective enumeration of the family of finitely generated groups admitting a faithful,...
We present a metric condition which describes the geometry of classical small cancellation groups an...
AbstractWe conjecture that every finite groupGhas a short presentation (in terms of generators and r...
Groups defined by presentations for which the components of the corresponding star graph are the inc...
AbstractAn example is given of a finite group A of order 144, with a generating set X = {x, y} such ...
AbstractThe genus of a finite group is the minimum genus over all surfaces containing an imbedded Ca...
We conjecture that every finite group G has a short presentation (in terms of generators and relatio...
AbstractThe classical results of Magnus on one-relator groups (such as the Freiheitssatz and the sol...
In this thesis we study algorithmic aspects of balanced group presentations which are finite present...
AbstractWe introduce “endomorphic presentations,” or L-presentations: group presentations whose rela...
DOI
Add to ORKG