<?xml version="1.0" encoding="UTF-8"?>

<record version="5" id="6172">
 <title>growth</title>
 <name>Growth</name>
 <created>2004-09-14 13:32:37</created>
 <modified>2005-12-30 10:40:55</modified>
 <type>Definition</type>
 <creator id="2727" name="mathcam"/>
 <author id="4804" name="Grayum"/>
 <classification>
	<category scheme="msc" code="20E99"/>
	<category scheme="msc" code="20F99"/>
 </classification>
 <defines>
	<concept>polynomial growth</concept>
	<concept>intermediate growth</concept>
	<concept>exponential growth</concept>
 </defines>
 <related>
	<object name="GrowthOfExponentialFunction"/>
 </related>
 <preamble>% this is the default PlanetMath preamble.  as your knowledge
% of TeX increases, you will probably want to edit this, but
% it should be fine as is for beginners.

% almost certainly you want these
\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsfonts}

% used for TeXing text within eps files
%\usepackage{psfrag}
% need this for including graphics (\includegraphics)
%\usepackage{graphicx}
% for neatly defining theorems and propositions
\usepackage{amsthm}
% making logically defined graphics
%\usepackage{xypic}

% there are many more packages, add them here as you need them

% define commands here</preamble>
 <content>Let $G$ be a finitely generated group with generating set $A$ (closed under inverses).

For $g=a_1a_2\ldots a_m\in G$, $a_i\in A$, let $l(g)$ be the minimum value of $m$.

Define $$\gamma(n)=\mid\{g\in G:l(g)\le n\}\mid$$.

The function $\gamma$ is called the \emph{growth function} for $G$ with generating set $A$.  If $\gamma$ is either

(a) bounded above by a polynomial function,

(b) bounded below by an exponential function, or

(c) neither,

then this condition is preserved under changing the generating set for $G$.  Respectively, then, $G$ is said to have

(a) \emph{polynomial growth},

(b) \emph{exponential growth}, or

(c) \emph{intermediate growth}.


For a survey on the topic, see:
R. I. Grigorchuk, On growth in group theory, Proceedings of the
International Congress of Mathematicians, Kyoto 1990, Volume I,
II (Math. Soc. Japan, 1991), pages 325 to 338.

Note that, as the generating set is assumed to be closed under inverses, we need only have $G$ as a semigroup - as such, the above applies equally well in semigroup theory.</content>
</record>
