Can one determine the dimension of a manifold given its 1-skeleton?
$begingroup$
This may be an easy question, but I can't think of the answer at hand.
Suppose that I have a triangulated $n$-manifold $M$ (satisfying any set of conditions that you feel like). Suppose that I give to you the 1-skeleton of the triangulation. Can you tell me anything about the dimension of $M$?
(For CW-decompositions, the answer is obviously no: every sphere can be given a CW decomposition with no 1-cells. However, if it is a triangulation instead...)
gn.general-topology manifolds simplicial-complexes triangulations
asked Jan 6 at 19:31
Simon RoseSimon Rose
3,7812444
$endgroup$
add a comment |
$begingroup$
This may be an easy question, but I can't think of the answer at hand.
Suppose that I have a triangulated $n$-manifold $M$ (satisfying any set of conditions that you feel like). Suppose that I give to you the 1-skeleton of the triangulation. Can you tell me anything about the dimension of $M$?
(For CW-decompositions, the answer is obviously no: every sphere can be given a CW decomposition with no 1-cells. However, if it is a triangulation instead...)
gn.general-topology manifolds simplicial-complexes triangulations
asked Jan 6 at 19:31
Simon RoseSimon Rose
3,7812444
$endgroup$
1
$begingroup$
Interesting starting point: can $S^n$ and $S^m$ be triangluated with isomorphic $1$-skeleta?
$endgroup$
– Jeff Strom
Jan 6 at 19:39
add a comment |
$begingroup$
This may be an easy question, but I can't think of the answer at hand.
Suppose that I have a triangulated $n$-manifold $M$ (satisfying any set of conditions that you feel like). Suppose that I give to you the 1-skeleton of the triangulation. Can you tell me anything about the dimension of $M$?
(For CW-decompositions, the answer is obviously no: every sphere can be given a CW decomposition with no 1-cells. However, if it is a triangulation instead...)
gn.general-topology manifolds simplicial-complexes triangulations
asked Jan 6 at 19:31
Simon RoseSimon Rose
3,7812444
$endgroup$
This may be an easy question, but I can't think of the answer at hand.
Suppose that I have a triangulated $n$-manifold $M$ (satisfying any set of conditions that you feel like). Suppose that I give to you the 1-skeleton of the triangulation. Can you tell me anything about the dimension of $M$?
(For CW-decompositions, the answer is obviously no: every sphere can be given a CW decomposition with no 1-cells. However, if it is a triangulation instead...)
gn.general-topology manifolds simplicial-complexes triangulations
gn.general-topology manifolds simplicial-complexes triangulations
asked Jan 6 at 19:31
Simon RoseSimon Rose
3,7812444
asked Jan 6 at 19:31
Simon RoseSimon Rose
3,7812444
asked Jan 6 at 19:31
Simon RoseSimon Rose
3,7812444
asked Jan 6 at 19:31
Simon RoseSimon Rose
3,7812444
asked Jan 6 at 19:31
Simon RoseSimon Rose
3,7812444
3,7812444
1
$begingroup$
Interesting starting point: can $S^n$ and $S^m$ be triangluated with isomorphic $1$-skeleta?
$endgroup$
– Jeff Strom
Jan 6 at 19:39
add a comment |
1
$begingroup$
Interesting starting point: can $S^n$ and $S^m$ be triangluated with isomorphic $1$-skeleta?
$endgroup$
– Jeff Strom
Jan 6 at 19:39
1
1
$begingroup$
Interesting starting point: can $S^n$ and $S^m$ be triangluated with isomorphic $1$-skeleta?
$endgroup$
– Jeff Strom
Jan 6 at 19:39
$begingroup$
Interesting starting point: can $S^n$ and $S^m$ be triangluated with isomorphic $1$-skeleta?
$endgroup$
– Jeff Strom
Jan 6 at 19:39
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
You cannot hope to find the dimension exactly from the 1-skeleton alone. The complete graph on seven vertices is both the 1-skeleton of a triangulation of the two dimensional torus and of the five dimensional sphere.
However, we can alway upperbound the dimension by one less than the connectivity of the given graph! It is a theorem of Barnette from "Decompositions of homology manifolds and their graphs" that the connectivity of the 1-skeleton of a d-dimensional manifold is at least d+1.
answered Jan 6 at 20:39
Gjergji ZaimiGjergji Zaimi
62.6k4163309
$endgroup$
10
$begingroup$
For every $ngeq dgeq 4$ there is a triangulation of a $(d-1)$-sphere (in fact, a simplicial polytope) with $n$ vertices, whose 1-skeleton is the complete graph $K_n$. These are the cyclic polytopes.
$endgroup$
– Richard Stanley
Jan 6 at 23:49
1
$begingroup$
Well, that kind of answers my next question as to whether or not simply connected might make a difference...
$endgroup$
– Simon Rose
Jan 9 at 21:09
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: "504"
};
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%2fmathoverflow.net%2fquestions%2f320232%2fcan-one-determine-the-dimension-of-a-manifold-given-its-1-skeleton%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 cannot hope to find the dimension exactly from the 1-skeleton alone. The complete graph on seven vertices is both the 1-skeleton of a triangulation of the two dimensional torus and of the five dimensional sphere.
However, we can alway upperbound the dimension by one less than the connectivity of the given graph! It is a theorem of Barnette from "Decompositions of homology manifolds and their graphs" that the connectivity of the 1-skeleton of a d-dimensional manifold is at least d+1.
answered Jan 6 at 20:39
Gjergji ZaimiGjergji Zaimi
62.6k4163309
$endgroup$
10
$begingroup$
For every $ngeq dgeq 4$ there is a triangulation of a $(d-1)$-sphere (in fact, a simplicial polytope) with $n$ vertices, whose 1-skeleton is the complete graph $K_n$. These are the cyclic polytopes.
$endgroup$
– Richard Stanley
Jan 6 at 23:49
1
$begingroup$
Well, that kind of answers my next question as to whether or not simply connected might make a difference...
$endgroup$
– Simon Rose
Jan 9 at 21:09
add a comment |
$begingroup$
You cannot hope to find the dimension exactly from the 1-skeleton alone. The complete graph on seven vertices is both the 1-skeleton of a triangulation of the two dimensional torus and of the five dimensional sphere.
However, we can alway upperbound the dimension by one less than the connectivity of the given graph! It is a theorem of Barnette from "Decompositions of homology manifolds and their graphs" that the connectivity of the 1-skeleton of a d-dimensional manifold is at least d+1.
answered Jan 6 at 20:39
Gjergji ZaimiGjergji Zaimi
62.6k4163309
$endgroup$
10
$begingroup$
For every $ngeq dgeq 4$ there is a triangulation of a $(d-1)$-sphere (in fact, a simplicial polytope) with $n$ vertices, whose 1-skeleton is the complete graph $K_n$. These are the cyclic polytopes.
$endgroup$
– Richard Stanley
Jan 6 at 23:49
1
$begingroup$
Well, that kind of answers my next question as to whether or not simply connected might make a difference...
$endgroup$
– Simon Rose
Jan 9 at 21:09
add a comment |
$begingroup$
You cannot hope to find the dimension exactly from the 1-skeleton alone. The complete graph on seven vertices is both the 1-skeleton of a triangulation of the two dimensional torus and of the five dimensional sphere.
However, we can alway upperbound the dimension by one less than the connectivity of the given graph! It is a theorem of Barnette from "Decompositions of homology manifolds and their graphs" that the connectivity of the 1-skeleton of a d-dimensional manifold is at least d+1.
answered Jan 6 at 20:39
Gjergji ZaimiGjergji Zaimi
62.6k4163309
$endgroup$
You cannot hope to find the dimension exactly from the 1-skeleton alone. The complete graph on seven vertices is both the 1-skeleton of a triangulation of the two dimensional torus and of the five dimensional sphere.
However, we can alway upperbound the dimension by one less than the connectivity of the given graph! It is a theorem of Barnette from "Decompositions of homology manifolds and their graphs" that the connectivity of the 1-skeleton of a d-dimensional manifold is at least d+1.
answered Jan 6 at 20:39
Gjergji ZaimiGjergji Zaimi
62.6k4163309
answered Jan 6 at 20:39
Gjergji ZaimiGjergji Zaimi
62.6k4163309
answered Jan 6 at 20:39
Gjergji ZaimiGjergji Zaimi
62.6k4163309
answered Jan 6 at 20:39
Gjergji ZaimiGjergji Zaimi
62.6k4163309
62.6k4163309
10
$begingroup$
For every $ngeq dgeq 4$ there is a triangulation of a $(d-1)$-sphere (in fact, a simplicial polytope) with $n$ vertices, whose 1-skeleton is the complete graph $K_n$. These are the cyclic polytopes.
$endgroup$
– Richard Stanley
Jan 6 at 23:49
1
$begingroup$
Well, that kind of answers my next question as to whether or not simply connected might make a difference...
$endgroup$
– Simon Rose
Jan 9 at 21:09
add a comment |
10
$begingroup$
For every $ngeq dgeq 4$ there is a triangulation of a $(d-1)$-sphere (in fact, a simplicial polytope) with $n$ vertices, whose 1-skeleton is the complete graph $K_n$. These are the cyclic polytopes.
$endgroup$
– Richard Stanley
Jan 6 at 23:49
1
$begingroup$
Well, that kind of answers my next question as to whether or not simply connected might make a difference...
$endgroup$
– Simon Rose
Jan 9 at 21:09
10
10
$begingroup$
For every $ngeq dgeq 4$ there is a triangulation of a $(d-1)$-sphere (in fact, a simplicial polytope) with $n$ vertices, whose 1-skeleton is the complete graph $K_n$. These are the cyclic polytopes.
$endgroup$
– Richard Stanley
Jan 6 at 23:49
$begingroup$
For every $ngeq dgeq 4$ there is a triangulation of a $(d-1)$-sphere (in fact, a simplicial polytope) with $n$ vertices, whose 1-skeleton is the complete graph $K_n$. These are the cyclic polytopes.
$endgroup$
– Richard Stanley
Jan 6 at 23:49
1
1
$begingroup$
Well, that kind of answers my next question as to whether or not simply connected might make a difference...
$endgroup$
– Simon Rose
Jan 9 at 21:09
$begingroup$
Well, that kind of answers my next question as to whether or not simply connected might make a difference...
$endgroup$
– Simon Rose
Jan 9 at 21:09
add a comment |
Thanks for contributing an answer to MathOverflow!
- 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%2fmathoverflow.net%2fquestions%2f320232%2fcan-one-determine-the-dimension-of-a-manifold-given-its-1-skeleton%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
1
$begingroup$
Interesting starting point: can $S^n$ and $S^m$ be triangluated with isomorphic $1$-skeleta?
$endgroup$
– Jeff Strom
Jan 6 at 19:39