Number of rooted trees
$begingroup$
Compute the number $t_n$ of rooted trees with n nodes described by the following equation:
We know that we cannot construct such tree for all $n$ (where $n$ is natural number).
For example, we can construct trees for $n's$ based on formula above:
$n=7$
$n=7+2*7$
$n=7+2*7+4*7$
$n=7+2*7+4*7+8*7$
How can I compute $t_n$ for arbitrary n?
trees
asked Dec 4 '18 at 14:28
GlionGlion
334
$endgroup$
add a comment |
$begingroup$
Compute the number $t_n$ of rooted trees with n nodes described by the following equation:
We know that we cannot construct such tree for all $n$ (where $n$ is natural number).
For example, we can construct trees for $n's$ based on formula above:
$n=7$
$n=7+2*7$
$n=7+2*7+4*7$
$n=7+2*7+4*7+8*7$
How can I compute $t_n$ for arbitrary n?
trees
asked Dec 4 '18 at 14:28
GlionGlion
334
$endgroup$
add a comment |
$begingroup$
Compute the number $t_n$ of rooted trees with n nodes described by the following equation:
We know that we cannot construct such tree for all $n$ (where $n$ is natural number).
For example, we can construct trees for $n's$ based on formula above:
$n=7$
$n=7+2*7$
$n=7+2*7+4*7$
$n=7+2*7+4*7+8*7$
How can I compute $t_n$ for arbitrary n?
trees
asked Dec 4 '18 at 14:28
GlionGlion
334
$endgroup$
Compute the number $t_n$ of rooted trees with n nodes described by the following equation:
We know that we cannot construct such tree for all $n$ (where $n$ is natural number).
For example, we can construct trees for $n's$ based on formula above:
$n=7$
$n=7+2*7$
$n=7+2*7+4*7$
$n=7+2*7+4*7+8*7$
How can I compute $t_n$ for arbitrary n?
trees
trees
asked Dec 4 '18 at 14:28
GlionGlion
334
asked Dec 4 '18 at 14:28
GlionGlion
334
edited Dec 4 '18 at 14:33
Glion
asked Dec 4 '18 at 14:28
GlionGlion
334
asked Dec 4 '18 at 14:28
GlionGlion
334
asked Dec 4 '18 at 14:28
GlionGlion
334
334
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
You can solve this by defining your $T$ as a functional equation for a generating function $T(z)$ and then compute $t_n$, which is the $n^{th}$ coefficient of $T(z)$. This will give you all possible combinations of the trees with $n$ nodes.
Solving the functional equation
$T(z) = z^4 + z^2 * T(z)^2$
gives you
$T(z) = frac{1 - sqrt{1-4z^6}}{2z^2}$
The only thing left now is to compute:
$t_n = [z^n]T(z)$
From here on I think it is clear what to do. The only thing tricky left is the $z^6$ under the square root, which can be dealt with by substitution.
answered Dec 5 '18 at 14:00
LogiCLogiC
263
$endgroup$
add a comment |
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%2f3025656%2fnumber-of-rooted-trees%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
You can solve this by defining your $T$ as a functional equation for a generating function $T(z)$ and then compute $t_n$, which is the $n^{th}$ coefficient of $T(z)$. This will give you all possible combinations of the trees with $n$ nodes.
Solving the functional equation
$T(z) = z^4 + z^2 * T(z)^2$
gives you
$T(z) = frac{1 - sqrt{1-4z^6}}{2z^2}$
The only thing left now is to compute:
$t_n = [z^n]T(z)$
From here on I think it is clear what to do. The only thing tricky left is the $z^6$ under the square root, which can be dealt with by substitution.
answered Dec 5 '18 at 14:00
LogiCLogiC
263
$endgroup$
add a comment |
$begingroup$
You can solve this by defining your $T$ as a functional equation for a generating function $T(z)$ and then compute $t_n$, which is the $n^{th}$ coefficient of $T(z)$. This will give you all possible combinations of the trees with $n$ nodes.
Solving the functional equation
$T(z) = z^4 + z^2 * T(z)^2$
gives you
$T(z) = frac{1 - sqrt{1-4z^6}}{2z^2}$
The only thing left now is to compute:
$t_n = [z^n]T(z)$
From here on I think it is clear what to do. The only thing tricky left is the $z^6$ under the square root, which can be dealt with by substitution.
answered Dec 5 '18 at 14:00
LogiCLogiC
263
$endgroup$
add a comment |
$begingroup$
You can solve this by defining your $T$ as a functional equation for a generating function $T(z)$ and then compute $t_n$, which is the $n^{th}$ coefficient of $T(z)$. This will give you all possible combinations of the trees with $n$ nodes.
Solving the functional equation
$T(z) = z^4 + z^2 * T(z)^2$
gives you
$T(z) = frac{1 - sqrt{1-4z^6}}{2z^2}$
The only thing left now is to compute:
$t_n = [z^n]T(z)$
From here on I think it is clear what to do. The only thing tricky left is the $z^6$ under the square root, which can be dealt with by substitution.
answered Dec 5 '18 at 14:00
LogiCLogiC
263
$endgroup$
You can solve this by defining your $T$ as a functional equation for a generating function $T(z)$ and then compute $t_n$, which is the $n^{th}$ coefficient of $T(z)$. This will give you all possible combinations of the trees with $n$ nodes.
Solving the functional equation
$T(z) = z^4 + z^2 * T(z)^2$
gives you
$T(z) = frac{1 - sqrt{1-4z^6}}{2z^2}$
The only thing left now is to compute:
$t_n = [z^n]T(z)$
From here on I think it is clear what to do. The only thing tricky left is the $z^6$ under the square root, which can be dealt with by substitution.
answered Dec 5 '18 at 14:00
LogiCLogiC
263
answered Dec 5 '18 at 14:00
LogiCLogiC
263
answered Dec 5 '18 at 14:00
LogiCLogiC
263
answered Dec 5 '18 at 14:00
LogiCLogiC
263
263
add a comment |
add a comment |
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%2f3025656%2fnumber-of-rooted-trees%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
