Number of minima in a ribbon disk? The 2019 Stack Overflow Developer Survey Results Are In ...
How are presidential pardons supposed to be used?
Python - Fishing Simulator
How to stretch delimiters to envolve matrices inside of a kbordermatrix?
First use of “packing” as in carrying a gun
does high air pressure throw off wheel balance?
What are these Gizmos at Izaña Atmospheric Research Center in Spain?
Keeping a retro style to sci-fi spaceships?
Can a novice safely splice in wire to lengthen 5V charging cable?
ELI5: Why do they say that Israel would have been the fourth country to land a spacecraft on the Moon and why do they call it low cost?
Take groceries in checked luggage
What can I do if neighbor is blocking my solar panels intentionally?
Does Parliament need to approve the new Brexit delay to 31 October 2019?
Is every episode of "Where are my Pants?" identical?
Windows 10: How to Lock (not sleep) laptop on lid close?
How should I replace vector<uint8_t>::const_iterator in an API?
Why can't devices on different VLANs, but on the same subnet, communicate?
Typeface like Times New Roman but with "tied" percent sign
He got a vote 80% that of Emmanuel Macron’s
How does ice melt when immersed in water?
Can the DM override racial traits?
How can I define good in a religion that claims no moral authority?
Why is the object placed in the middle of the sentence here?
What force causes entropy to increase?
Did the UK government pay "millions and millions of dollars" to try to snag Julian Assange?
Number of minima in a ribbon disk?
The 2019 Stack Overflow Developer Survey Results Are In
Announcing the arrival of Valued Associate #679: Cesar Manara
Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern)What is a 2-surgery on a disk?fundamental group of ribbon knotadditivity of crossing number of composite knotsgenus of knot and crossing number invariantsWhat is the relationship between the Euler number of Seifert surface of a link and its linking numberPotential proof for the Slice-Ribbon conjecture (may be wrong).Is there a nontrivial oriented link with two components with linking number 0 which is related to the unknot by a single skein relation?Bounds on the number of knots with a fixed number of crossingsAlternating and Non-Altenating Knot projections with same crossing number?Framed Links are Ribbon Graphs
$begingroup$
I am asking this question mainly with the hope of finding a reference to (presumably well-trodden) topic. Let $K$ be a ribbon knot and define $I(K)$ to be the minimum over number of minima of all ribbon disks of $K$ ("I" for invariant - I'm guessing that it has a name and a literature).
Is there a family of ribbon knots that show that $I(K)$ can be arbitrarily large? In other words, how do I get a hold on lower bounds for $I(K)$ - hopefully without assuming slice = ribbon.
geometric-topology knot-theory knot-invariants
$endgroup$
add a comment |
$begingroup$
I am asking this question mainly with the hope of finding a reference to (presumably well-trodden) topic. Let $K$ be a ribbon knot and define $I(K)$ to be the minimum over number of minima of all ribbon disks of $K$ ("I" for invariant - I'm guessing that it has a name and a literature).
Is there a family of ribbon knots that show that $I(K)$ can be arbitrarily large? In other words, how do I get a hold on lower bounds for $I(K)$ - hopefully without assuming slice = ribbon.
geometric-topology knot-theory knot-invariants
$endgroup$
add a comment |
$begingroup$
I am asking this question mainly with the hope of finding a reference to (presumably well-trodden) topic. Let $K$ be a ribbon knot and define $I(K)$ to be the minimum over number of minima of all ribbon disks of $K$ ("I" for invariant - I'm guessing that it has a name and a literature).
Is there a family of ribbon knots that show that $I(K)$ can be arbitrarily large? In other words, how do I get a hold on lower bounds for $I(K)$ - hopefully without assuming slice = ribbon.
geometric-topology knot-theory knot-invariants
$endgroup$
I am asking this question mainly with the hope of finding a reference to (presumably well-trodden) topic. Let $K$ be a ribbon knot and define $I(K)$ to be the minimum over number of minima of all ribbon disks of $K$ ("I" for invariant - I'm guessing that it has a name and a literature).
Is there a family of ribbon knots that show that $I(K)$ can be arbitrarily large? In other words, how do I get a hold on lower bounds for $I(K)$ - hopefully without assuming slice = ribbon.
geometric-topology knot-theory knot-invariants
geometric-topology knot-theory knot-invariants
asked Jan 27 at 23:28
user101010user101010
1,972516
1,972516
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
A handle decomposition of a ribbon disk gives a band presentation of the knot. If I understand how this goes correctly, the band presentation is an unlink along with attached bands between them such that
performing embedded arc surgery along these bands (which carry framing information for the surgery) gives the knot, and
if the unknots are thought of as vertices and the bands as edges, the graph forms a tree (since loops in the graph would correspond to a maxima, which don't exist).
The number of components in the unlink is the number of minima, and so your $I(K)$ is the minimal number of such components over all band presentations of the ribbon knot $K$.
For example, here is a band presentation of a square knot:
By the way, there appear to be some moves that can go between any two band presentations for the same ribbon disk of a ribbon knot:
(See at least Figure 3 of https://arxiv.org/abs/1804.09169 or the paper they cite:
Swenton, Frank J., On a calculus for 2-knots and surfaces in 4-space, J. Knot Theory Ramifications 10, No. 8, 1133-1141 (2001). ZBL1001.57044.). I wonder what additional moves you might need to go between any two ribbon disks.
Anyway, there is a nice way to calculate a group that is the homomorphic image of the fundamental group of the knot complement from such a band presentation, as you are probably aware:
Johnson, Dennis, Homomorphs of knot groups, Proc. Am. Math. Soc. 78, 135-138 (1980). ZBL0435.57003.
Each unknot is assigned a generator, and each band sum introduces a single additional relation depending on which unknots the band passes through. This implies that $I(K)geq operatorname{rank}(pi_1(S^3-K))$, where the rank is the minimal number of generators over all presentations of the finitely generated group $pi_1(S^3-K)$.
The following paper implies that there are knot groups of arbitrary rank:
Weidmann, Richard, On the rank of amalgamated products and product knot groups, Math. Ann. 312, No. 4, 761-771 (1998). ZBL0926.20019.
In particular, the $n$-fold connect sum of any nontrivial ribbon knot $K$ has $I(mathop{#}_nK)geq operatorname{rank}(pi_1(S^3-mathop{#}_nK))geq n+1$.
(If there were a way to modify Johnson's construction to generate prime knots, then one could get an infinite family of prime ribbon knots with arbitrary rank.)
$endgroup$
1
$begingroup$
Thanks Kyle, this is great! I had forgotten about the Johnson paper and I did not know about that result of Weidmann - that is exactly the sort of fact that I was looking for!!
$endgroup$
– user101010
Feb 5 at 0:29
$begingroup$
@user101010 I've realized I misunderstood the kind of group presentation you get from Johnson's construction and that you only get particular quotients of the fundamental group; the ranks of these groups are lower bounds for the rank of the fundamental group itself. I think $I(mathop{#}_n K)geq n+1$ still applies, though.
$endgroup$
– Kyle Miller
Feb 7 at 0:05
add a comment |
$begingroup$
Since the Johnson paper only gives a quotient of the knot group, it is not clear why $I(#_n K)geq n$, and in particular, it is not clear if $I$ can be arbitrarily large. Am I missing something obvious?
$endgroup$
add a comment |
Your Answer
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%2f3090261%2fnumber-of-minima-in-a-ribbon-disk%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
A handle decomposition of a ribbon disk gives a band presentation of the knot. If I understand how this goes correctly, the band presentation is an unlink along with attached bands between them such that
performing embedded arc surgery along these bands (which carry framing information for the surgery) gives the knot, and
if the unknots are thought of as vertices and the bands as edges, the graph forms a tree (since loops in the graph would correspond to a maxima, which don't exist).
The number of components in the unlink is the number of minima, and so your $I(K)$ is the minimal number of such components over all band presentations of the ribbon knot $K$.
For example, here is a band presentation of a square knot:
By the way, there appear to be some moves that can go between any two band presentations for the same ribbon disk of a ribbon knot:
(See at least Figure 3 of https://arxiv.org/abs/1804.09169 or the paper they cite:
Swenton, Frank J., On a calculus for 2-knots and surfaces in 4-space, J. Knot Theory Ramifications 10, No. 8, 1133-1141 (2001). ZBL1001.57044.). I wonder what additional moves you might need to go between any two ribbon disks.
Anyway, there is a nice way to calculate a group that is the homomorphic image of the fundamental group of the knot complement from such a band presentation, as you are probably aware:
Johnson, Dennis, Homomorphs of knot groups, Proc. Am. Math. Soc. 78, 135-138 (1980). ZBL0435.57003.
Each unknot is assigned a generator, and each band sum introduces a single additional relation depending on which unknots the band passes through. This implies that $I(K)geq operatorname{rank}(pi_1(S^3-K))$, where the rank is the minimal number of generators over all presentations of the finitely generated group $pi_1(S^3-K)$.
The following paper implies that there are knot groups of arbitrary rank:
Weidmann, Richard, On the rank of amalgamated products and product knot groups, Math. Ann. 312, No. 4, 761-771 (1998). ZBL0926.20019.
In particular, the $n$-fold connect sum of any nontrivial ribbon knot $K$ has $I(mathop{#}_nK)geq operatorname{rank}(pi_1(S^3-mathop{#}_nK))geq n+1$.
(If there were a way to modify Johnson's construction to generate prime knots, then one could get an infinite family of prime ribbon knots with arbitrary rank.)
$endgroup$
1
$begingroup$
Thanks Kyle, this is great! I had forgotten about the Johnson paper and I did not know about that result of Weidmann - that is exactly the sort of fact that I was looking for!!
$endgroup$
– user101010
Feb 5 at 0:29
$begingroup$
@user101010 I've realized I misunderstood the kind of group presentation you get from Johnson's construction and that you only get particular quotients of the fundamental group; the ranks of these groups are lower bounds for the rank of the fundamental group itself. I think $I(mathop{#}_n K)geq n+1$ still applies, though.
$endgroup$
– Kyle Miller
Feb 7 at 0:05
add a comment |
$begingroup$
A handle decomposition of a ribbon disk gives a band presentation of the knot. If I understand how this goes correctly, the band presentation is an unlink along with attached bands between them such that
performing embedded arc surgery along these bands (which carry framing information for the surgery) gives the knot, and
if the unknots are thought of as vertices and the bands as edges, the graph forms a tree (since loops in the graph would correspond to a maxima, which don't exist).
The number of components in the unlink is the number of minima, and so your $I(K)$ is the minimal number of such components over all band presentations of the ribbon knot $K$.
For example, here is a band presentation of a square knot:
By the way, there appear to be some moves that can go between any two band presentations for the same ribbon disk of a ribbon knot:
(See at least Figure 3 of https://arxiv.org/abs/1804.09169 or the paper they cite:
Swenton, Frank J., On a calculus for 2-knots and surfaces in 4-space, J. Knot Theory Ramifications 10, No. 8, 1133-1141 (2001). ZBL1001.57044.). I wonder what additional moves you might need to go between any two ribbon disks.
Anyway, there is a nice way to calculate a group that is the homomorphic image of the fundamental group of the knot complement from such a band presentation, as you are probably aware:
Johnson, Dennis, Homomorphs of knot groups, Proc. Am. Math. Soc. 78, 135-138 (1980). ZBL0435.57003.
Each unknot is assigned a generator, and each band sum introduces a single additional relation depending on which unknots the band passes through. This implies that $I(K)geq operatorname{rank}(pi_1(S^3-K))$, where the rank is the minimal number of generators over all presentations of the finitely generated group $pi_1(S^3-K)$.
The following paper implies that there are knot groups of arbitrary rank:
Weidmann, Richard, On the rank of amalgamated products and product knot groups, Math. Ann. 312, No. 4, 761-771 (1998). ZBL0926.20019.
In particular, the $n$-fold connect sum of any nontrivial ribbon knot $K$ has $I(mathop{#}_nK)geq operatorname{rank}(pi_1(S^3-mathop{#}_nK))geq n+1$.
(If there were a way to modify Johnson's construction to generate prime knots, then one could get an infinite family of prime ribbon knots with arbitrary rank.)
$endgroup$
1
$begingroup$
Thanks Kyle, this is great! I had forgotten about the Johnson paper and I did not know about that result of Weidmann - that is exactly the sort of fact that I was looking for!!
$endgroup$
– user101010
Feb 5 at 0:29
$begingroup$
@user101010 I've realized I misunderstood the kind of group presentation you get from Johnson's construction and that you only get particular quotients of the fundamental group; the ranks of these groups are lower bounds for the rank of the fundamental group itself. I think $I(mathop{#}_n K)geq n+1$ still applies, though.
$endgroup$
– Kyle Miller
Feb 7 at 0:05
add a comment |
$begingroup$
A handle decomposition of a ribbon disk gives a band presentation of the knot. If I understand how this goes correctly, the band presentation is an unlink along with attached bands between them such that
performing embedded arc surgery along these bands (which carry framing information for the surgery) gives the knot, and
if the unknots are thought of as vertices and the bands as edges, the graph forms a tree (since loops in the graph would correspond to a maxima, which don't exist).
The number of components in the unlink is the number of minima, and so your $I(K)$ is the minimal number of such components over all band presentations of the ribbon knot $K$.
For example, here is a band presentation of a square knot:
By the way, there appear to be some moves that can go between any two band presentations for the same ribbon disk of a ribbon knot:
(See at least Figure 3 of https://arxiv.org/abs/1804.09169 or the paper they cite:
Swenton, Frank J., On a calculus for 2-knots and surfaces in 4-space, J. Knot Theory Ramifications 10, No. 8, 1133-1141 (2001). ZBL1001.57044.). I wonder what additional moves you might need to go between any two ribbon disks.
Anyway, there is a nice way to calculate a group that is the homomorphic image of the fundamental group of the knot complement from such a band presentation, as you are probably aware:
Johnson, Dennis, Homomorphs of knot groups, Proc. Am. Math. Soc. 78, 135-138 (1980). ZBL0435.57003.
Each unknot is assigned a generator, and each band sum introduces a single additional relation depending on which unknots the band passes through. This implies that $I(K)geq operatorname{rank}(pi_1(S^3-K))$, where the rank is the minimal number of generators over all presentations of the finitely generated group $pi_1(S^3-K)$.
The following paper implies that there are knot groups of arbitrary rank:
Weidmann, Richard, On the rank of amalgamated products and product knot groups, Math. Ann. 312, No. 4, 761-771 (1998). ZBL0926.20019.
In particular, the $n$-fold connect sum of any nontrivial ribbon knot $K$ has $I(mathop{#}_nK)geq operatorname{rank}(pi_1(S^3-mathop{#}_nK))geq n+1$.
(If there were a way to modify Johnson's construction to generate prime knots, then one could get an infinite family of prime ribbon knots with arbitrary rank.)
$endgroup$
A handle decomposition of a ribbon disk gives a band presentation of the knot. If I understand how this goes correctly, the band presentation is an unlink along with attached bands between them such that
performing embedded arc surgery along these bands (which carry framing information for the surgery) gives the knot, and
if the unknots are thought of as vertices and the bands as edges, the graph forms a tree (since loops in the graph would correspond to a maxima, which don't exist).
The number of components in the unlink is the number of minima, and so your $I(K)$ is the minimal number of such components over all band presentations of the ribbon knot $K$.
For example, here is a band presentation of a square knot:
By the way, there appear to be some moves that can go between any two band presentations for the same ribbon disk of a ribbon knot:
(See at least Figure 3 of https://arxiv.org/abs/1804.09169 or the paper they cite:
Swenton, Frank J., On a calculus for 2-knots and surfaces in 4-space, J. Knot Theory Ramifications 10, No. 8, 1133-1141 (2001). ZBL1001.57044.). I wonder what additional moves you might need to go between any two ribbon disks.
Anyway, there is a nice way to calculate a group that is the homomorphic image of the fundamental group of the knot complement from such a band presentation, as you are probably aware:
Johnson, Dennis, Homomorphs of knot groups, Proc. Am. Math. Soc. 78, 135-138 (1980). ZBL0435.57003.
Each unknot is assigned a generator, and each band sum introduces a single additional relation depending on which unknots the band passes through. This implies that $I(K)geq operatorname{rank}(pi_1(S^3-K))$, where the rank is the minimal number of generators over all presentations of the finitely generated group $pi_1(S^3-K)$.
The following paper implies that there are knot groups of arbitrary rank:
Weidmann, Richard, On the rank of amalgamated products and product knot groups, Math. Ann. 312, No. 4, 761-771 (1998). ZBL0926.20019.
In particular, the $n$-fold connect sum of any nontrivial ribbon knot $K$ has $I(mathop{#}_nK)geq operatorname{rank}(pi_1(S^3-mathop{#}_nK))geq n+1$.
(If there were a way to modify Johnson's construction to generate prime knots, then one could get an infinite family of prime ribbon knots with arbitrary rank.)
edited Feb 5 at 18:47
answered Feb 4 at 1:48
Kyle MillerKyle Miller
10.1k930
10.1k930
1
$begingroup$
Thanks Kyle, this is great! I had forgotten about the Johnson paper and I did not know about that result of Weidmann - that is exactly the sort of fact that I was looking for!!
$endgroup$
– user101010
Feb 5 at 0:29
$begingroup$
@user101010 I've realized I misunderstood the kind of group presentation you get from Johnson's construction and that you only get particular quotients of the fundamental group; the ranks of these groups are lower bounds for the rank of the fundamental group itself. I think $I(mathop{#}_n K)geq n+1$ still applies, though.
$endgroup$
– Kyle Miller
Feb 7 at 0:05
add a comment |
1
$begingroup$
Thanks Kyle, this is great! I had forgotten about the Johnson paper and I did not know about that result of Weidmann - that is exactly the sort of fact that I was looking for!!
$endgroup$
– user101010
Feb 5 at 0:29
$begingroup$
@user101010 I've realized I misunderstood the kind of group presentation you get from Johnson's construction and that you only get particular quotients of the fundamental group; the ranks of these groups are lower bounds for the rank of the fundamental group itself. I think $I(mathop{#}_n K)geq n+1$ still applies, though.
$endgroup$
– Kyle Miller
Feb 7 at 0:05
1
1
$begingroup$
Thanks Kyle, this is great! I had forgotten about the Johnson paper and I did not know about that result of Weidmann - that is exactly the sort of fact that I was looking for!!
$endgroup$
– user101010
Feb 5 at 0:29
$begingroup$
Thanks Kyle, this is great! I had forgotten about the Johnson paper and I did not know about that result of Weidmann - that is exactly the sort of fact that I was looking for!!
$endgroup$
– user101010
Feb 5 at 0:29
$begingroup$
@user101010 I've realized I misunderstood the kind of group presentation you get from Johnson's construction and that you only get particular quotients of the fundamental group; the ranks of these groups are lower bounds for the rank of the fundamental group itself. I think $I(mathop{#}_n K)geq n+1$ still applies, though.
$endgroup$
– Kyle Miller
Feb 7 at 0:05
$begingroup$
@user101010 I've realized I misunderstood the kind of group presentation you get from Johnson's construction and that you only get particular quotients of the fundamental group; the ranks of these groups are lower bounds for the rank of the fundamental group itself. I think $I(mathop{#}_n K)geq n+1$ still applies, though.
$endgroup$
– Kyle Miller
Feb 7 at 0:05
add a comment |
$begingroup$
Since the Johnson paper only gives a quotient of the knot group, it is not clear why $I(#_n K)geq n$, and in particular, it is not clear if $I$ can be arbitrarily large. Am I missing something obvious?
$endgroup$
add a comment |
$begingroup$
Since the Johnson paper only gives a quotient of the knot group, it is not clear why $I(#_n K)geq n$, and in particular, it is not clear if $I$ can be arbitrarily large. Am I missing something obvious?
$endgroup$
add a comment |
$begingroup$
Since the Johnson paper only gives a quotient of the knot group, it is not clear why $I(#_n K)geq n$, and in particular, it is not clear if $I$ can be arbitrarily large. Am I missing something obvious?
$endgroup$
Since the Johnson paper only gives a quotient of the knot group, it is not clear why $I(#_n K)geq n$, and in particular, it is not clear if $I$ can be arbitrarily large. Am I missing something obvious?
answered Mar 22 at 21:16
Sucharit SarkarSucharit Sarkar
101
101
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%2f3090261%2fnumber-of-minima-in-a-ribbon-disk%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