scholarly journals Growth of linear semigroups

1996 ◽  
Vol 60 (1) ◽  
pp. 18-30 ◽  
Author(s):  
Jan Okniński
Keyword(s):  
Finite Rank ◽  
Polynomial Growth ◽  
Growth Function ◽  
Unipotent Radical ◽  
Maximal Degree ◽  
Finitely Generated ◽  
Group Of Fractions

AbstractWe show that the growth function of a finitely generated linear semigroup S ⊆ Mn(K) is controlled by its behaviour on finitely many cancellative subsemigroups of S. If the growth of S is polynomially bounded, then every cancellative subsemigroup T of S has a group of fractions G ⊆ Mn (K) which is nilpotent-by-finite and of finite rank. We prove that the latter condition, strengthened by the hypothesis that every such G has a finite unipotent radical, is sufficient for S to have a polynomial growth. Moreover, the degree of growth of S is then bounded by a polynomial f(n, r) in n and the maximal degree r of growth of finitely generated cancellative T ⊆ S.

scholarly journals A MEALY MACHINE WITH POLYNOMIAL GROWTH OF IRRATIONAL DEGREE

2008 ◽  
Vol 18 (01) ◽  
pp. 59-82 ◽  
Author(s):  
LAURENT BARTHOLDI ◽  
ILLYA I. REZNYKOV
Keyword(s):  
Polynomial Growth ◽  
Growth Function ◽  
Finitely Generated ◽  
Mealy Machine ◽  
A Chain

We consider a very simple Mealy machine (two nontrivial states over a two-symbol alphabet), and derive some properties of the semigroup it generates. It is an infinite, finitely generated semigroup, and we show that the growth function of its balls behaves asymptotically like ℓα, for [Formula: see text]; that the semigroup satisfies the identity g6 = g4; and that its lattice of two-sided ideals is a chain.

THE BURNSIDE PROBLEM FOR GROUPS OF LOW QUADRATIC GROWTH

1996 ◽  
Vol 06 (03) ◽  
pp. 369-377
Author(s):  
ROBERTO INCITTI
Keyword(s):  
Infinite Order ◽  
Polynomial Growth ◽  
Growth Function ◽  
Infinite Group ◽  
Quadratic Growth ◽  
Burnside Problem ◽  
Finitely Generated ◽  
Combinatorial Argument ◽  
Groups Of Polynomial Growth ◽  
Generating System

We show with a combinatorial argument that a finitely generated infinite group whose growth function relative to some finite generating system is less or equal to [Formula: see text], r<2, contains an element of infinite order. This result is aimed at investigating the combinatorial nature of M. Gromov’s theorem on groups of polynomial growth.

Isomorphisms of Prime Goldie Semi-Principal Left Ideal Rings, II

1988 ◽  
Vol 31 (3) ◽  
pp. 374-379 ◽  
Author(s):  
Kenneth G. Wolfson
Keyword(s):  
Left Ideal ◽  
Endomorphism Ring ◽  
Finite Rank ◽  
Sufficient Conditions ◽  
Free Module ◽  
Necessary And Sufficient Conditions ◽  
Finitely Generated ◽  
Ore Domain ◽  
Necessary And Sufficient

AbstractA prime Goldie ring K, in which each finitely generated left ideal is principal is the endomorphism ring E(F, A) of a free module A, of finite rank, over an Ore domain F. We determine necessary and sufficient conditions to insure that whenever K ≅ E(F, A) ≅ E(G, B) (with A and B free and finitely generated over domains F and G) then (F, A) is semi-linearly isomorphic to (G, B). We also show, by example, that it is possible for K ≅ E(F, A ) ≅ E(G, B), with F and G, not isomorphic.

scholarly journals A note on groups with separable finitely generated subgroups

1987 ◽  
Vol 36 (1) ◽  
pp. 153-160 ◽  
Author(s):  
R. G. Burns ◽  
A. Karrass ◽  
D. Solitar
Keyword(s):  
Free Group ◽  
Finite Rank ◽  
Cyclic Extension ◽  
Normal Subgroups ◽  
Finitely Generated ◽  
Positive Direction ◽  
One Relator Groups

An example is given of an infinite cyclic extension of a free group of finite rank in which not every finitely generated subgroup is finitely separable. This answers negatively the question of Peter Scott as to whether in all finitely generated 3-manifold groups the finitely generated subgroups are finitely separable. In the positive direction it is shown that in knot groups and one-relator groups with centre, the finitely generated normal subgroups are finitely separable.

scholarly journals The primitivity index function for a free group, and untangling closed curves on hyperbolic surfaces.With the appendix by Khalid Bou–Rabee

2017 ◽  
Vol 166 (1) ◽  
pp. 83-121
Author(s):  
NEHA GUPTA ◽  
ILYA KAPOVICH
Keyword(s):  
Lower Bounds ◽  
Free Group ◽  
Growth Function ◽  
Residual Finiteness ◽  
Closed Geodesics ◽  
Hyperbolic Surfaces ◽  
Finitely Generated ◽  
Closed Curves ◽  
Index Function ◽  
Finite Covers

AbstractMotivated by the results of Scott and Patel about “untangling” closed geodesics in finite covers of hyperbolic surfaces, we introduce and study primitivity, simplicity and non-filling index functions for finitely generated free groups. We obtain lower bounds for these functions and relate these free group results back to the setting of hyperbolic surfaces. An appendix by Khalid Bou–Rabee connects the primitivity index functionfprim(n,FN) to the residual finiteness growth function forFN.

IDENTITIES AND A BOUNDED HEIGHT CONDITION FOR SEMIGROUPS

2003 ◽  
Vol 13 (05) ◽  
pp. 565-583 ◽  
Author(s):  
L. M. SHNEERSON
Keyword(s):  
Polynomial Growth ◽  
Nilpotent Groups ◽  
The Other ◽  
Finitely Generated ◽  
Different Types ◽  
Associative Rings ◽  
Nontrivial Identity

We consider two different types of bounded height condition for semigroups. The first one originates from the classical Shirshov's bounded height theorem for associative rings. The second which is weaker, in fact was introduced by Wolf and also used by Bass for calculating the growth of finitely generated (f.g.) nilpotent groups. Both conditions yield polynomial growth. We give the first two examples of f.g. semigroups which have bounded height and do not satisfy any nontrivial identity. One of these semigroups does not have bounded height in the sense of Shirshov and the other satisfies the classical bounded height condition. This develops further one of the main results of the author's paper (J. Algebra, 1993) where the first examples of f.g. semigroups of polynomial growth and without nontrivial identities were given.

scholarly journals ON THE COMPLEXITY OF THE WHITEHEAD MINIMIZATION PROBLEM

2007 ◽  
Vol 17 (08) ◽  
pp. 1611-1634 ◽  
Author(s):  
ABDÓ ROIG ◽  
ENRIC VENTURA ◽  
PASCAL WEIL
Keyword(s):  
Free Group ◽  
Polynomial Time ◽  
Minimization Problem ◽  
Finite Rank ◽  
Polynomial Algorithm ◽  
Minimum Size ◽  
Input Word ◽  
Finitely Generated ◽  
Factor Problem

The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank free group. We give the first fully polynomial algorithm to solve this problem, that is, an algorithm that is polynomial both in the length of the input word and in the rank of the free group. Earlier algorithms had an exponential dependency in the rank of the free group. It follows that the primitivity problem — to decide whether a word is an element of some basis of the free group — and the free factor problem can also be solved in polynomial time.

A note on the cohomology of metabelian groups

1985 ◽  
Vol 98 (3) ◽  
pp. 437-445 ◽  
Author(s):  
P. H. Kropholler
Keyword(s):  
Finite Rank ◽  
Metabelian Group ◽  
Finitely Generated ◽  
Metabelian Groups ◽  
Soluble Groups

The cohomology of finitely generated metabelian groups has been studied in a series of papers by Bieri, Groves, and Strebel [2, 3, 4]. In particular, Bieri and Groves [2] have shown that every metabelian group of type (FP)∞ is of finite rank, and so is virtually of type (FP). The purpose of the present paper is to provide a generalization of this result and to use our methods to prove the existence of a pathological class of finitely generated soluble groups.

Sign in / Sign up

Export Citation Format

Share Document