Exact value of exponential growth rate depends on generating setBall growth function of a quotientQuestion on...
Tiptoe or tiphoof? Adjusting words to better fit fantasy races
Was Spock the First Vulcan in Starfleet?
Is the destination of a commercial flight important for the pilot?
Implement the Thanos sorting algorithm
Is there a problem with hiding "forgot password" until it's needed?
How to Reset Passwords on Multiple Websites Easily?
Crossing the line between justified force and brutality
when is out of tune ok?
Method to test if a number is a perfect power?
Shortcut for value of this indefinite integral?
Is this apparent Class Action settlement a spam message?
Inappropriate reference requests from Journal reviewers
Class Action - which options I have?
Failed to fetch jessie backports repository
What does "I’d sit this one out, Cap," imply or mean in the context?
Pre-amplifier input protection
Return the Closest Prime Number
What is the difference between "behavior" and "behaviour"?
How does it work when somebody invests in my business?
Energy of the particles in the particle accelerator
How do scammers retract money, while you can’t?
Is `x >> pure y` equivalent to `liftM (const y) x`
Would a high gravity rocky planet be guaranteed to have an atmosphere?
How does the UK government determine the size of a mandate?
Exact value of exponential growth rate depends on generating set
Ball growth function of a quotientQuestion on alphabet of a free group and its generating setConjugacy class of commutators of generators for a free group.find a special free subsemigroupAre free products of exponential growth?Proof that elements of a free generating set have infinite order.Rank of Non-Abelian Quotient GroupMust a group of exponential growth is virtually free?Does a group have polynomial growth of the same degree under all generating sets?Is there any relationship between growth rate and amenability?
$begingroup$
I am trying to solve an exercise from Clara Loh's Geometric Group Theory: An introduction. The problem uses the exponential growth rate of a finitely generated group $G$ with generating set $S$. The exponential growth rate is then defined as the limit
$$ rho_{G,S} = inf_{rin mathbb{N }_{>0}} (beta_{G,S}(r))^{1/r}, $$
where $beta_{G,S}$ is the growth function of $G$.
The question is then the following: Given a free group F of rank 2, freely generated by ${a,b}$ and consider the set $S:= {a,b,aba^{-1},a^2} subset F $.
Show that
$$rho_{F,{a,b}} neq rho_{F,S}. $$
I know that $rho_{F,{a,b}} = 3$, since for general free groups of rank $n$ and freely generating set $T$ we have
$$beta_{G,T} (r) = 1 + frac{n}{n-1} ( (2n-1)^r -1).$$
Moreover, I know that we can always find a subset of $S$ (in this case ${a,b}$) which will freely generating a free subgroup of $F$ of rank 2. Hence $rho_{F,S} geq rho_{F,{a,b}} = 3$.
So I am trying to prove that this inequality is strict. For this I tried to understand $beta_{F,S}(r)$ by drawing a Calay-graph up to $r=2$. For larger $r$ this gets a bit messy. But what I do observe from drawing this, is the fact that $beta_{F,S}(r) > beta_{F,{a,b}}(r)$. But taking the infimum does not guarantee strictness of this inequality.
I am somehow hoping that it is possible to show $beta_{F,S}(r)$ grows by an additional factor of $3^r$, but I am far from prooving anything like this.
Some hints on how to tackle this problem are very welcome. Thank you.
free-groups geometric-group-theory subgroup-growth
$endgroup$
add a comment |
$begingroup$
I am trying to solve an exercise from Clara Loh's Geometric Group Theory: An introduction. The problem uses the exponential growth rate of a finitely generated group $G$ with generating set $S$. The exponential growth rate is then defined as the limit
$$ rho_{G,S} = inf_{rin mathbb{N }_{>0}} (beta_{G,S}(r))^{1/r}, $$
where $beta_{G,S}$ is the growth function of $G$.
The question is then the following: Given a free group F of rank 2, freely generated by ${a,b}$ and consider the set $S:= {a,b,aba^{-1},a^2} subset F $.
Show that
$$rho_{F,{a,b}} neq rho_{F,S}. $$
I know that $rho_{F,{a,b}} = 3$, since for general free groups of rank $n$ and freely generating set $T$ we have
$$beta_{G,T} (r) = 1 + frac{n}{n-1} ( (2n-1)^r -1).$$
Moreover, I know that we can always find a subset of $S$ (in this case ${a,b}$) which will freely generating a free subgroup of $F$ of rank 2. Hence $rho_{F,S} geq rho_{F,{a,b}} = 3$.
So I am trying to prove that this inequality is strict. For this I tried to understand $beta_{F,S}(r)$ by drawing a Calay-graph up to $r=2$. For larger $r$ this gets a bit messy. But what I do observe from drawing this, is the fact that $beta_{F,S}(r) > beta_{F,{a,b}}(r)$. But taking the infimum does not guarantee strictness of this inequality.
I am somehow hoping that it is possible to show $beta_{F,S}(r)$ grows by an additional factor of $3^r$, but I am far from prooving anything like this.
Some hints on how to tackle this problem are very welcome. Thank you.
free-groups geometric-group-theory subgroup-growth
$endgroup$
$begingroup$
You don't need to draw a Cayley graph to, at least, compute $beta_S(3)$.
$endgroup$
– YCor
Mar 15 at 20:28
$begingroup$
Perhaps I don't have to. But still, counting the number of elements in lower radius balls won't give me any insight on how the growth function exactly behaves for arbitrarely r. So this is where I'm stuck.
$endgroup$
– Trenzalore96
Mar 16 at 10:01
$begingroup$
counting them, maybe not, but listing them, possibly yes. Or drawing, in the standard Cayley graph (with respect to ${a,b}$), the $r$-ball with respect to the generating subset $S$, for $r=3$ and maybe even $r=4$. So as to have a guess about higher values of $r$.
$endgroup$
– YCor
Mar 16 at 10:03
$begingroup$
Alright, in this fashion I'm able to see that we add in each $r$-ball, at least $4 times 7^r$ elements. Hence taking $n$ the number of generators in $S$ (i.e. $n=4$), I obtain that $$beta_{F,S}(r) > 1 + 4 sum_{i=0}^{r-1} (2n-1)^i = 1 + frac{4}{2(n-1)}((2n-1)^r-1). $$ Hence, computing the exponential growth rate of the growth function on the right gives us $2n-1 = 7$. Therefore, $rho_{F,S} geq 7 > 3 = rho_{F,{a,b}}$ and so $rho_{F,S} neq rho_{F,{a,b}}$.
$endgroup$
– Trenzalore96
Mar 16 at 13:20
add a comment |
$begingroup$
I am trying to solve an exercise from Clara Loh's Geometric Group Theory: An introduction. The problem uses the exponential growth rate of a finitely generated group $G$ with generating set $S$. The exponential growth rate is then defined as the limit
$$ rho_{G,S} = inf_{rin mathbb{N }_{>0}} (beta_{G,S}(r))^{1/r}, $$
where $beta_{G,S}$ is the growth function of $G$.
The question is then the following: Given a free group F of rank 2, freely generated by ${a,b}$ and consider the set $S:= {a,b,aba^{-1},a^2} subset F $.
Show that
$$rho_{F,{a,b}} neq rho_{F,S}. $$
I know that $rho_{F,{a,b}} = 3$, since for general free groups of rank $n$ and freely generating set $T$ we have
$$beta_{G,T} (r) = 1 + frac{n}{n-1} ( (2n-1)^r -1).$$
Moreover, I know that we can always find a subset of $S$ (in this case ${a,b}$) which will freely generating a free subgroup of $F$ of rank 2. Hence $rho_{F,S} geq rho_{F,{a,b}} = 3$.
So I am trying to prove that this inequality is strict. For this I tried to understand $beta_{F,S}(r)$ by drawing a Calay-graph up to $r=2$. For larger $r$ this gets a bit messy. But what I do observe from drawing this, is the fact that $beta_{F,S}(r) > beta_{F,{a,b}}(r)$. But taking the infimum does not guarantee strictness of this inequality.
I am somehow hoping that it is possible to show $beta_{F,S}(r)$ grows by an additional factor of $3^r$, but I am far from prooving anything like this.
Some hints on how to tackle this problem are very welcome. Thank you.
free-groups geometric-group-theory subgroup-growth
$endgroup$
I am trying to solve an exercise from Clara Loh's Geometric Group Theory: An introduction. The problem uses the exponential growth rate of a finitely generated group $G$ with generating set $S$. The exponential growth rate is then defined as the limit
$$ rho_{G,S} = inf_{rin mathbb{N }_{>0}} (beta_{G,S}(r))^{1/r}, $$
where $beta_{G,S}$ is the growth function of $G$.
The question is then the following: Given a free group F of rank 2, freely generated by ${a,b}$ and consider the set $S:= {a,b,aba^{-1},a^2} subset F $.
Show that
$$rho_{F,{a,b}} neq rho_{F,S}. $$
I know that $rho_{F,{a,b}} = 3$, since for general free groups of rank $n$ and freely generating set $T$ we have
$$beta_{G,T} (r) = 1 + frac{n}{n-1} ( (2n-1)^r -1).$$
Moreover, I know that we can always find a subset of $S$ (in this case ${a,b}$) which will freely generating a free subgroup of $F$ of rank 2. Hence $rho_{F,S} geq rho_{F,{a,b}} = 3$.
So I am trying to prove that this inequality is strict. For this I tried to understand $beta_{F,S}(r)$ by drawing a Calay-graph up to $r=2$. For larger $r$ this gets a bit messy. But what I do observe from drawing this, is the fact that $beta_{F,S}(r) > beta_{F,{a,b}}(r)$. But taking the infimum does not guarantee strictness of this inequality.
I am somehow hoping that it is possible to show $beta_{F,S}(r)$ grows by an additional factor of $3^r$, but I am far from prooving anything like this.
Some hints on how to tackle this problem are very welcome. Thank you.
free-groups geometric-group-theory subgroup-growth
free-groups geometric-group-theory subgroup-growth
asked Mar 15 at 18:15
Trenzalore96Trenzalore96
1
1
$begingroup$
You don't need to draw a Cayley graph to, at least, compute $beta_S(3)$.
$endgroup$
– YCor
Mar 15 at 20:28
$begingroup$
Perhaps I don't have to. But still, counting the number of elements in lower radius balls won't give me any insight on how the growth function exactly behaves for arbitrarely r. So this is where I'm stuck.
$endgroup$
– Trenzalore96
Mar 16 at 10:01
$begingroup$
counting them, maybe not, but listing them, possibly yes. Or drawing, in the standard Cayley graph (with respect to ${a,b}$), the $r$-ball with respect to the generating subset $S$, for $r=3$ and maybe even $r=4$. So as to have a guess about higher values of $r$.
$endgroup$
– YCor
Mar 16 at 10:03
$begingroup$
Alright, in this fashion I'm able to see that we add in each $r$-ball, at least $4 times 7^r$ elements. Hence taking $n$ the number of generators in $S$ (i.e. $n=4$), I obtain that $$beta_{F,S}(r) > 1 + 4 sum_{i=0}^{r-1} (2n-1)^i = 1 + frac{4}{2(n-1)}((2n-1)^r-1). $$ Hence, computing the exponential growth rate of the growth function on the right gives us $2n-1 = 7$. Therefore, $rho_{F,S} geq 7 > 3 = rho_{F,{a,b}}$ and so $rho_{F,S} neq rho_{F,{a,b}}$.
$endgroup$
– Trenzalore96
Mar 16 at 13:20
add a comment |
$begingroup$
You don't need to draw a Cayley graph to, at least, compute $beta_S(3)$.
$endgroup$
– YCor
Mar 15 at 20:28
$begingroup$
Perhaps I don't have to. But still, counting the number of elements in lower radius balls won't give me any insight on how the growth function exactly behaves for arbitrarely r. So this is where I'm stuck.
$endgroup$
– Trenzalore96
Mar 16 at 10:01
$begingroup$
counting them, maybe not, but listing them, possibly yes. Or drawing, in the standard Cayley graph (with respect to ${a,b}$), the $r$-ball with respect to the generating subset $S$, for $r=3$ and maybe even $r=4$. So as to have a guess about higher values of $r$.
$endgroup$
– YCor
Mar 16 at 10:03
$begingroup$
Alright, in this fashion I'm able to see that we add in each $r$-ball, at least $4 times 7^r$ elements. Hence taking $n$ the number of generators in $S$ (i.e. $n=4$), I obtain that $$beta_{F,S}(r) > 1 + 4 sum_{i=0}^{r-1} (2n-1)^i = 1 + frac{4}{2(n-1)}((2n-1)^r-1). $$ Hence, computing the exponential growth rate of the growth function on the right gives us $2n-1 = 7$. Therefore, $rho_{F,S} geq 7 > 3 = rho_{F,{a,b}}$ and so $rho_{F,S} neq rho_{F,{a,b}}$.
$endgroup$
– Trenzalore96
Mar 16 at 13:20
$begingroup$
You don't need to draw a Cayley graph to, at least, compute $beta_S(3)$.
$endgroup$
– YCor
Mar 15 at 20:28
$begingroup$
You don't need to draw a Cayley graph to, at least, compute $beta_S(3)$.
$endgroup$
– YCor
Mar 15 at 20:28
$begingroup$
Perhaps I don't have to. But still, counting the number of elements in lower radius balls won't give me any insight on how the growth function exactly behaves for arbitrarely r. So this is where I'm stuck.
$endgroup$
– Trenzalore96
Mar 16 at 10:01
$begingroup$
Perhaps I don't have to. But still, counting the number of elements in lower radius balls won't give me any insight on how the growth function exactly behaves for arbitrarely r. So this is where I'm stuck.
$endgroup$
– Trenzalore96
Mar 16 at 10:01
$begingroup$
counting them, maybe not, but listing them, possibly yes. Or drawing, in the standard Cayley graph (with respect to ${a,b}$), the $r$-ball with respect to the generating subset $S$, for $r=3$ and maybe even $r=4$. So as to have a guess about higher values of $r$.
$endgroup$
– YCor
Mar 16 at 10:03
$begingroup$
counting them, maybe not, but listing them, possibly yes. Or drawing, in the standard Cayley graph (with respect to ${a,b}$), the $r$-ball with respect to the generating subset $S$, for $r=3$ and maybe even $r=4$. So as to have a guess about higher values of $r$.
$endgroup$
– YCor
Mar 16 at 10:03
$begingroup$
Alright, in this fashion I'm able to see that we add in each $r$-ball, at least $4 times 7^r$ elements. Hence taking $n$ the number of generators in $S$ (i.e. $n=4$), I obtain that $$beta_{F,S}(r) > 1 + 4 sum_{i=0}^{r-1} (2n-1)^i = 1 + frac{4}{2(n-1)}((2n-1)^r-1). $$ Hence, computing the exponential growth rate of the growth function on the right gives us $2n-1 = 7$. Therefore, $rho_{F,S} geq 7 > 3 = rho_{F,{a,b}}$ and so $rho_{F,S} neq rho_{F,{a,b}}$.
$endgroup$
– Trenzalore96
Mar 16 at 13:20
$begingroup$
Alright, in this fashion I'm able to see that we add in each $r$-ball, at least $4 times 7^r$ elements. Hence taking $n$ the number of generators in $S$ (i.e. $n=4$), I obtain that $$beta_{F,S}(r) > 1 + 4 sum_{i=0}^{r-1} (2n-1)^i = 1 + frac{4}{2(n-1)}((2n-1)^r-1). $$ Hence, computing the exponential growth rate of the growth function on the right gives us $2n-1 = 7$. Therefore, $rho_{F,S} geq 7 > 3 = rho_{F,{a,b}}$ and so $rho_{F,S} neq rho_{F,{a,b}}$.
$endgroup$
– Trenzalore96
Mar 16 at 13:20
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3149628%2fexact-value-of-exponential-growth-rate-depends-on-generating-set%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3149628%2fexact-value-of-exponential-growth-rate-depends-on-generating-set%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
$begingroup$
You don't need to draw a Cayley graph to, at least, compute $beta_S(3)$.
$endgroup$
– YCor
Mar 15 at 20:28
$begingroup$
Perhaps I don't have to. But still, counting the number of elements in lower radius balls won't give me any insight on how the growth function exactly behaves for arbitrarely r. So this is where I'm stuck.
$endgroup$
– Trenzalore96
Mar 16 at 10:01
$begingroup$
counting them, maybe not, but listing them, possibly yes. Or drawing, in the standard Cayley graph (with respect to ${a,b}$), the $r$-ball with respect to the generating subset $S$, for $r=3$ and maybe even $r=4$. So as to have a guess about higher values of $r$.
$endgroup$
– YCor
Mar 16 at 10:03
$begingroup$
Alright, in this fashion I'm able to see that we add in each $r$-ball, at least $4 times 7^r$ elements. Hence taking $n$ the number of generators in $S$ (i.e. $n=4$), I obtain that $$beta_{F,S}(r) > 1 + 4 sum_{i=0}^{r-1} (2n-1)^i = 1 + frac{4}{2(n-1)}((2n-1)^r-1). $$ Hence, computing the exponential growth rate of the growth function on the right gives us $2n-1 = 7$. Therefore, $rho_{F,S} geq 7 > 3 = rho_{F,{a,b}}$ and so $rho_{F,S} neq rho_{F,{a,b}}$.
$endgroup$
– Trenzalore96
Mar 16 at 13:20