Counting sequences with exactly d distinct elements
$begingroup$
What is the number of sequences $(x_1,...,x_q) in mathcal{X}^q$ with exactly $d$ distinct elements, for some $1 leq d leq q$?
combinatorics
$endgroup$
add a comment |
$begingroup$
What is the number of sequences $(x_1,...,x_q) in mathcal{X}^q$ with exactly $d$ distinct elements, for some $1 leq d leq q$?
combinatorics
$endgroup$
add a comment |
$begingroup$
What is the number of sequences $(x_1,...,x_q) in mathcal{X}^q$ with exactly $d$ distinct elements, for some $1 leq d leq q$?
combinatorics
$endgroup$
What is the number of sequences $(x_1,...,x_q) in mathcal{X}^q$ with exactly $d$ distinct elements, for some $1 leq d leq q$?
combinatorics
combinatorics
asked Jan 24 at 6:29
Alex GriloAlex Grilo
1162
1162
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
You don't say what $X$ is, but if it has $x$ elements, then the answer is
$binom{x}d$ times the solution when $X={1,2,ldots,d}$. In that case, the solution is the number of surjections from ${1,2,ldots,q}$
to ${1,2,ldots,d}$ which is $d!S(q,d)$ with $S(q,d)$ a Stirling number of
the second kind.
$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%2f3085549%2fcounting-sequences-with-exactly-d-distinct-elements%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 don't say what $X$ is, but if it has $x$ elements, then the answer is
$binom{x}d$ times the solution when $X={1,2,ldots,d}$. In that case, the solution is the number of surjections from ${1,2,ldots,q}$
to ${1,2,ldots,d}$ which is $d!S(q,d)$ with $S(q,d)$ a Stirling number of
the second kind.
$endgroup$
add a comment |
$begingroup$
You don't say what $X$ is, but if it has $x$ elements, then the answer is
$binom{x}d$ times the solution when $X={1,2,ldots,d}$. In that case, the solution is the number of surjections from ${1,2,ldots,q}$
to ${1,2,ldots,d}$ which is $d!S(q,d)$ with $S(q,d)$ a Stirling number of
the second kind.
$endgroup$
add a comment |
$begingroup$
You don't say what $X$ is, but if it has $x$ elements, then the answer is
$binom{x}d$ times the solution when $X={1,2,ldots,d}$. In that case, the solution is the number of surjections from ${1,2,ldots,q}$
to ${1,2,ldots,d}$ which is $d!S(q,d)$ with $S(q,d)$ a Stirling number of
the second kind.
$endgroup$
You don't say what $X$ is, but if it has $x$ elements, then the answer is
$binom{x}d$ times the solution when $X={1,2,ldots,d}$. In that case, the solution is the number of surjections from ${1,2,ldots,q}$
to ${1,2,ldots,d}$ which is $d!S(q,d)$ with $S(q,d)$ a Stirling number of
the second kind.
answered Jan 24 at 6:41
Lord Shark the UnknownLord Shark the Unknown
106k1161133
106k1161133
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%2f3085549%2fcounting-sequences-with-exactly-d-distinct-elements%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