Maximum number of elements of $X subset mathbb{R}^n$ such that the discrete metric in $X$ is induced by the...
$begingroup$
What is the maximum number of elements of $X subset mathbb{R}^n$ such that the discrete metric in $X$ is induced by the eucliean one in $mathbb{R}^n$?
It's easy to verify that if $n=1$, then the answer is $2$. The case $n = 2$ has already been solved (What is the maximum number of points that a subspace $X subset mathbb{R}²$ can have so that $mathbb{R}²$ induces the discrete metric in $X$?), whose answer is 3. In similar way with solid geomtry, one can prove that if $n=3$, then the answer is 4. So, a reasonable conjecture is $n+1$. However, I couldn't find a solution for $n>3$.
metric-spaces
$endgroup$
add a comment |
$begingroup$
What is the maximum number of elements of $X subset mathbb{R}^n$ such that the discrete metric in $X$ is induced by the eucliean one in $mathbb{R}^n$?
It's easy to verify that if $n=1$, then the answer is $2$. The case $n = 2$ has already been solved (What is the maximum number of points that a subspace $X subset mathbb{R}²$ can have so that $mathbb{R}²$ induces the discrete metric in $X$?), whose answer is 3. In similar way with solid geomtry, one can prove that if $n=3$, then the answer is 4. So, a reasonable conjecture is $n+1$. However, I couldn't find a solution for $n>3$.
metric-spaces
$endgroup$
add a comment |
$begingroup$
What is the maximum number of elements of $X subset mathbb{R}^n$ such that the discrete metric in $X$ is induced by the eucliean one in $mathbb{R}^n$?
It's easy to verify that if $n=1$, then the answer is $2$. The case $n = 2$ has already been solved (What is the maximum number of points that a subspace $X subset mathbb{R}²$ can have so that $mathbb{R}²$ induces the discrete metric in $X$?), whose answer is 3. In similar way with solid geomtry, one can prove that if $n=3$, then the answer is 4. So, a reasonable conjecture is $n+1$. However, I couldn't find a solution for $n>3$.
metric-spaces
$endgroup$
What is the maximum number of elements of $X subset mathbb{R}^n$ such that the discrete metric in $X$ is induced by the eucliean one in $mathbb{R}^n$?
It's easy to verify that if $n=1$, then the answer is $2$. The case $n = 2$ has already been solved (What is the maximum number of points that a subspace $X subset mathbb{R}²$ can have so that $mathbb{R}²$ induces the discrete metric in $X$?), whose answer is 3. In similar way with solid geomtry, one can prove that if $n=3$, then the answer is 4. So, a reasonable conjecture is $n+1$. However, I couldn't find a solution for $n>3$.
metric-spaces
metric-spaces
asked Jan 14 at 20:06
Rafael DeigaRafael Deiga
672311
672311
add a comment |
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%2f3073681%2fmaximum-number-of-elements-of-x-subset-mathbbrn-such-that-the-discrete-me%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%2f3073681%2fmaximum-number-of-elements-of-x-subset-mathbbrn-such-that-the-discrete-me%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