“Reidemeister moves” for self-intersecting loops












3














Reidemeister showed that just three basic moves (which manipulated crossings) were needed to test whether two knots were equivalent or "ambient isotopic." Suppose we expand the class of topological objects to permit self-intersection, as here:



self-intersecting



The notion of ambient isotopy applies to such objects. What is the smallest class of moves that guarantees one can transform such an object into any other ambient isotopic object?



I suspect the Reidemeister moves need be augmented by fairly trivial moves passing segments above or beneath the intersected crossing, but how would one prove that?






knot-theory







share|cite|improve this question



























    3














    Reidemeister showed that just three basic moves (which manipulated crossings) were needed to test whether two knots were equivalent or "ambient isotopic." Suppose we expand the class of topological objects to permit self-intersection, as here:



    self-intersecting



    The notion of ambient isotopy applies to such objects. What is the smallest class of moves that guarantees one can transform such an object into any other ambient isotopic object?



    I suspect the Reidemeister moves need be augmented by fairly trivial moves passing segments above or beneath the intersected crossing, but how would one prove that?






    knot-theory







    share|cite|improve this question

























      3












      3








      3


      1





      Reidemeister showed that just three basic moves (which manipulated crossings) were needed to test whether two knots were equivalent or "ambient isotopic." Suppose we expand the class of topological objects to permit self-intersection, as here:



      self-intersecting



      The notion of ambient isotopy applies to such objects. What is the smallest class of moves that guarantees one can transform such an object into any other ambient isotopic object?



      I suspect the Reidemeister moves need be augmented by fairly trivial moves passing segments above or beneath the intersected crossing, but how would one prove that?






      knot-theory







      share|cite|improve this question













      Reidemeister showed that just three basic moves (which manipulated crossings) were needed to test whether two knots were equivalent or "ambient isotopic." Suppose we expand the class of topological objects to permit self-intersection, as here:



      self-intersecting



      The notion of ambient isotopy applies to such objects. What is the smallest class of moves that guarantees one can transform such an object into any other ambient isotopic object?



      I suspect the Reidemeister moves need be augmented by fairly trivial moves passing segments above or beneath the intersected crossing, but how would one prove that?






      knot-theory




      knot-theory






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked 6 hours ago









      David G. Stork

      1,67811130




      1,67811130






















          1 Answer
          1






          active

          oldest

          votes


















          3














          These objects are called spatial graphs. A set of Reidemeister moves for them was found by Kauffman; see



          L H Kauffman, Invariants of graphs in three-space, Trans. Amer. Math. Soc. 311 (1989) 697–710.






          share|cite|improve this answer





















          • Perfect. Thanks so much for the reference. (accept) . Indeed, the additional moves are fairly straightforward (including the "twist" of segments at an intersection).
            – David G. Stork
            5 hours ago













          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
          });


          }
          });














          draft saved

          draft discarded


















          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathoverflow.net%2fquestions%2f319671%2freidemeister-moves-for-self-intersecting-loops%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









          3














          These objects are called spatial graphs. A set of Reidemeister moves for them was found by Kauffman; see



          L H Kauffman, Invariants of graphs in three-space, Trans. Amer. Math. Soc. 311 (1989) 697–710.






          share|cite|improve this answer





















          • Perfect. Thanks so much for the reference. (accept) . Indeed, the additional moves are fairly straightforward (including the "twist" of segments at an intersection).
            – David G. Stork
            5 hours ago


















          3














          These objects are called spatial graphs. A set of Reidemeister moves for them was found by Kauffman; see



          L H Kauffman, Invariants of graphs in three-space, Trans. Amer. Math. Soc. 311 (1989) 697–710.






          share|cite|improve this answer





















          • Perfect. Thanks so much for the reference. (accept) . Indeed, the additional moves are fairly straightforward (including the "twist" of segments at an intersection).
            – David G. Stork
            5 hours ago
















          3












          3








          3






          These objects are called spatial graphs. A set of Reidemeister moves for them was found by Kauffman; see



          L H Kauffman, Invariants of graphs in three-space, Trans. Amer. Math. Soc. 311 (1989) 697–710.






          share|cite|improve this answer












          These objects are called spatial graphs. A set of Reidemeister moves for them was found by Kauffman; see



          L H Kauffman, Invariants of graphs in three-space, Trans. Amer. Math. Soc. 311 (1989) 697–710.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered 5 hours ago









          Andy Putman

          31.2k5132212




          31.2k5132212












          • Perfect. Thanks so much for the reference. (accept) . Indeed, the additional moves are fairly straightforward (including the "twist" of segments at an intersection).
            – David G. Stork
            5 hours ago




















          • Perfect. Thanks so much for the reference. (accept) . Indeed, the additional moves are fairly straightforward (including the "twist" of segments at an intersection).
            – David G. Stork
            5 hours ago


















          Perfect. Thanks so much for the reference. (accept) . Indeed, the additional moves are fairly straightforward (including the "twist" of segments at an intersection).
          – David G. Stork
          5 hours ago






          Perfect. Thanks so much for the reference. (accept) . Indeed, the additional moves are fairly straightforward (including the "twist" of segments at an intersection).
          – David G. Stork
          5 hours ago




















          draft saved

          draft discarded




















































          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.





          Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


          Please pay close attention to the following guidance:


          • 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.


          To learn more, see our tips on writing great answers.




          draft saved


          draft discarded














          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathoverflow.net%2fquestions%2f319671%2freidemeister-moves-for-self-intersecting-loops%23new-answer', 'question_page');
          }
          );

          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







          -

          Popular posts from this blog

          Accessing regular linux commands in Huawei's Dopra Linux

          Image
          4 Backstory: I have a Huawei HG8245 router in my house and I want to change the default username/password. I've tried following this guide but the config file always gets reset. My ISP isn't helping either so I'm looking for other ways to accomplish this. The router has telnet access so this seems like a way to change the credentials. The first shell I gain access to looks like this: WAP> Pressing "?" gives me a list of available commands which I've pasted here, the two interesting ones are "su" and "shell". I can't seem to get su access, even after logging in as root (challenge password prompt, and then nothing happens), but shell gives me a proper linux shell. WAP>shell BusyBox v1.18.4 (2017-12-26 17:06:34 CST) built-in shell (ash) Enter 'hel...
          Read more

          Can't connect RFCOMM socket: Host is down

          Image
          up vote 3 down vote favorite I have bluez 5.4.3 and I am attempting to communicate with a ble device through minicom. These two deceives (my computer and a bluno nano) are alreadt paired and this has been my method so far. #bluetoothctl # pair xx:xx:xx:xx:xx:xx # exit Everything is working well so far then... #sudo rfcomm connect /dev/rfcomm0 xx:xx:xx:xx:xx:xx 1 & [1] 3665 Can't connect RFCOMM socket: Host is down Does anyone know how to resolve this issue? Any help would be very much appreciated. bluetooth bluez share | improve this question asked Feb 9 '17 at 18:46 Brandon Knape 46 2 ...
          Read more

          Kernel panic - not syncing: Fatal Exception in Interrupt

          Image
          0 Every day this error occured on my pc, kernel panic error on interrupt, what will be the problem? linux-mint share asked 6 mins ago Vinod Selvin Vinod Selvin 1 1 New contributor Vinod Selvin is a new contributor to this site. Take care in asking for clarification, commenting, and answering. Check out our Code of Conduct. add a comment ...
          Read more