Results 21 to 30 of about 49,915 (165)
When the intrinsic algebraic entropy is not really intrinsic
The intrinsic algebraic entropy ent(ɸ) of an endomorphism ɸ of an Abelian group G can be computed using fully inert subgroups of ɸ-invariant sections of G, instead of the whole family of ɸ-inert subgroups.
Goldsmith Brendan, Salce Luigi
doaj +1 more source
On groups and counter automata [PDF]
We study finitely generated groups whose word problems are accepted by counter automata. We show that a group has word problem accepted by a blind n-counter automaton in the sense of Greibach if and only if it is virtually free abelian of rank n; this ...
Dixon J. D. +8 more
core +2 more sources
Groups and semigroups with a one-counter word problem [PDF]
We prove that a finitely generated semigroup whose word problem is a one-counter language has a linear growth function. This provides us with a very strong restriction on the structure of such a semigroup, which, in particular, yields an elementary proof
Holt, Derek F. +2 more
core +1 more source
On almost finitely generated nilpotent groups
A nilpotent group G is fgp if Gp, is finitely generated (fg) as a p-local group for all primes p; it is fg-like if there exists a nilpotent fg group H such that Gp≃Hp for all primes p.
Peter Hilton, Robert Militello
doaj +1 more source
Rigidity of graph products of abelian groups
We show that if $G$ is a group and $G$ has a graph-product decomposition with finitely-generated abelian vertex groups, then $G$ has two canonical decompositions as a graph product of groups: a unique decomposition in which each vertex group is a ...
Gutierrez, Mauricio, Piggott, Adam
core +1 more source
Let $Y$ be a principal homogeneous space of an abelian surface, or a K3 surface, over a finitely generated extension of
ANTHONY VÁRILLY-ALVARADO, BIANCA VIRAY
doaj +1 more source
Algorithmic Methods for Finitely Generated Abelian Groups
The main base of the intent to apply (matrix) algorithms for derivation of results on Abelian groups is the fact that if written additively, representation of elements and relations turns to linear matrix and vector algebra of integer elements. The authors prefer to use a different mode of writing.
Cohen, Henri +2 more
openaire +2 more sources
On abelian subgroups of finitely generated metabelian groups [PDF]
In this note we introduce the class of $\mathcal H$-groups (or Hall groups) related to the class of $\mathcal B$-groups defined by Ph. Hall in 1950's. Establishing some basic properties of Hall groups we use them to obtain results concerning embeddings of abelian groups.
Mikaelian, Vahagn H. +1 more
openaire +3 more sources
On the automorphism group of generalized Baumslag-Solitar groups
A generalized Baumslag-Solitar group (GBS group) is a finitely generated group $G$ which acts on a tree with all edge and vertex stabilizers infinite cyclic.
Bass +15 more
core +1 more source
The n-ary adding machine and solvable groups [PDF]
We describe under a various conditions abelian subgroups of the automorphism group $Aut(T_n)$ of the regular $n$-ary tree $T_n$, which are normalized by the $n$-ary adding machine $tau=(e,dots, e,tau)sigma_tau$ where $sigma_tau$ is the $n$-cycle $(0, 1 ...
Josimar Da Silva Rocha, Said Sidki
doaj

