Relevance of Landau's Algorithm for Denesting Radicals












3














I just came across a Wikipedia article Nested Radicals that mentions Landau's Algorithm for deciding, whether a nested radical can be denested, but that Wikipedia article is just a stub.
Googling "Landau's Algorithms" produces references to the Wang and Landau Algorithm.




Question:



What role does Landau's Algorithm play in mathematical research, i.e. did it pave the way for further progress, e.g. towards a deterministic algorithm for denesting radicals, or did it "just" solve an isolated problem?



I am asking because the original article is freely accessible online, but isn't described in the omniscient Wikipedia.

Is my impression right, that because Ramanujan provided some examples of denested radicals, that the topic is of some relevance?











share|cite|improve this question



























    3














    I just came across a Wikipedia article Nested Radicals that mentions Landau's Algorithm for deciding, whether a nested radical can be denested, but that Wikipedia article is just a stub.
    Googling "Landau's Algorithms" produces references to the Wang and Landau Algorithm.




    Question:



    What role does Landau's Algorithm play in mathematical research, i.e. did it pave the way for further progress, e.g. towards a deterministic algorithm for denesting radicals, or did it "just" solve an isolated problem?



    I am asking because the original article is freely accessible online, but isn't described in the omniscient Wikipedia.

    Is my impression right, that because Ramanujan provided some examples of denested radicals, that the topic is of some relevance?











    share|cite|improve this question

























      3












      3








      3







      I just came across a Wikipedia article Nested Radicals that mentions Landau's Algorithm for deciding, whether a nested radical can be denested, but that Wikipedia article is just a stub.
      Googling "Landau's Algorithms" produces references to the Wang and Landau Algorithm.




      Question:



      What role does Landau's Algorithm play in mathematical research, i.e. did it pave the way for further progress, e.g. towards a deterministic algorithm for denesting radicals, or did it "just" solve an isolated problem?



      I am asking because the original article is freely accessible online, but isn't described in the omniscient Wikipedia.

      Is my impression right, that because Ramanujan provided some examples of denested radicals, that the topic is of some relevance?











      share|cite|improve this question













      I just came across a Wikipedia article Nested Radicals that mentions Landau's Algorithm for deciding, whether a nested radical can be denested, but that Wikipedia article is just a stub.
      Googling "Landau's Algorithms" produces references to the Wang and Landau Algorithm.




      Question:



      What role does Landau's Algorithm play in mathematical research, i.e. did it pave the way for further progress, e.g. towards a deterministic algorithm for denesting radicals, or did it "just" solve an isolated problem?



      I am asking because the original article is freely accessible online, but isn't described in the omniscient Wikipedia.

      Is my impression right, that because Ramanujan provided some examples of denested radicals, that the topic is of some relevance?








      algebraic-number-theory algorithms






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked 2 hours ago









      Manfred Weis

      4,44521339




      4,44521339






















          1 Answer
          1






          active

          oldest

          votes


















          2














          This 2017 article Gkioulekas - On the denesting of nested square roots summarizes the status of this topic. Landau's algorithm is not a "final" solution because it runs in exponential time with respect to the depth of the expression that one is attempting to denest. To find a general algorithm that runs in polynomial time remains an open problem. See also this related MSE posting.






          share|cite|improve this answer























          • Maybe it's just me, but I thought I remembered a massive re-organisation that rendered all ResearchGate links pointing to the wrong place. (Maybe I'm thinking of CiteSeer.) Anyway, though it can probably rot even more easily, here's a link to the article on the author's home page: Gkioulekas - On the de-nesting of nested square roots.
            – LSpice
            1 hour ago










          • Also, I edited to add the name of the author of the paper, but apparently did so while you were making your own edit, with the result that the system thought I was deleting your edit. I apologise, and think I have restored your intended edit.
            – LSpice
            1 hour 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%2f319874%2frelevance-of-landaus-algorithm-for-denesting-radicals%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









          2














          This 2017 article Gkioulekas - On the denesting of nested square roots summarizes the status of this topic. Landau's algorithm is not a "final" solution because it runs in exponential time with respect to the depth of the expression that one is attempting to denest. To find a general algorithm that runs in polynomial time remains an open problem. See also this related MSE posting.






          share|cite|improve this answer























          • Maybe it's just me, but I thought I remembered a massive re-organisation that rendered all ResearchGate links pointing to the wrong place. (Maybe I'm thinking of CiteSeer.) Anyway, though it can probably rot even more easily, here's a link to the article on the author's home page: Gkioulekas - On the de-nesting of nested square roots.
            – LSpice
            1 hour ago










          • Also, I edited to add the name of the author of the paper, but apparently did so while you were making your own edit, with the result that the system thought I was deleting your edit. I apologise, and think I have restored your intended edit.
            – LSpice
            1 hour ago
















          2














          This 2017 article Gkioulekas - On the denesting of nested square roots summarizes the status of this topic. Landau's algorithm is not a "final" solution because it runs in exponential time with respect to the depth of the expression that one is attempting to denest. To find a general algorithm that runs in polynomial time remains an open problem. See also this related MSE posting.






          share|cite|improve this answer























          • Maybe it's just me, but I thought I remembered a massive re-organisation that rendered all ResearchGate links pointing to the wrong place. (Maybe I'm thinking of CiteSeer.) Anyway, though it can probably rot even more easily, here's a link to the article on the author's home page: Gkioulekas - On the de-nesting of nested square roots.
            – LSpice
            1 hour ago










          • Also, I edited to add the name of the author of the paper, but apparently did so while you were making your own edit, with the result that the system thought I was deleting your edit. I apologise, and think I have restored your intended edit.
            – LSpice
            1 hour ago














          2












          2








          2






          This 2017 article Gkioulekas - On the denesting of nested square roots summarizes the status of this topic. Landau's algorithm is not a "final" solution because it runs in exponential time with respect to the depth of the expression that one is attempting to denest. To find a general algorithm that runs in polynomial time remains an open problem. See also this related MSE posting.






          share|cite|improve this answer














          This 2017 article Gkioulekas - On the denesting of nested square roots summarizes the status of this topic. Landau's algorithm is not a "final" solution because it runs in exponential time with respect to the depth of the expression that one is attempting to denest. To find a general algorithm that runs in polynomial time remains an open problem. See also this related MSE posting.







          share|cite|improve this answer














          share|cite|improve this answer



          share|cite|improve this answer








          edited 1 hour ago









          LSpice

          2,82322627




          2,82322627










          answered 1 hour ago









          Carlo Beenakker

          73.3k9165274




          73.3k9165274












          • Maybe it's just me, but I thought I remembered a massive re-organisation that rendered all ResearchGate links pointing to the wrong place. (Maybe I'm thinking of CiteSeer.) Anyway, though it can probably rot even more easily, here's a link to the article on the author's home page: Gkioulekas - On the de-nesting of nested square roots.
            – LSpice
            1 hour ago










          • Also, I edited to add the name of the author of the paper, but apparently did so while you were making your own edit, with the result that the system thought I was deleting your edit. I apologise, and think I have restored your intended edit.
            – LSpice
            1 hour ago


















          • Maybe it's just me, but I thought I remembered a massive re-organisation that rendered all ResearchGate links pointing to the wrong place. (Maybe I'm thinking of CiteSeer.) Anyway, though it can probably rot even more easily, here's a link to the article on the author's home page: Gkioulekas - On the de-nesting of nested square roots.
            – LSpice
            1 hour ago










          • Also, I edited to add the name of the author of the paper, but apparently did so while you were making your own edit, with the result that the system thought I was deleting your edit. I apologise, and think I have restored your intended edit.
            – LSpice
            1 hour ago
















          Maybe it's just me, but I thought I remembered a massive re-organisation that rendered all ResearchGate links pointing to the wrong place. (Maybe I'm thinking of CiteSeer.) Anyway, though it can probably rot even more easily, here's a link to the article on the author's home page: Gkioulekas - On the de-nesting of nested square roots.
          – LSpice
          1 hour ago




          Maybe it's just me, but I thought I remembered a massive re-organisation that rendered all ResearchGate links pointing to the wrong place. (Maybe I'm thinking of CiteSeer.) Anyway, though it can probably rot even more easily, here's a link to the article on the author's home page: Gkioulekas - On the de-nesting of nested square roots.
          – LSpice
          1 hour ago












          Also, I edited to add the name of the author of the paper, but apparently did so while you were making your own edit, with the result that the system thought I was deleting your edit. I apologise, and think I have restored your intended edit.
          – LSpice
          1 hour ago




          Also, I edited to add the name of the author of the paper, but apparently did so while you were making your own edit, with the result that the system thought I was deleting your edit. I apologise, and think I have restored your intended edit.
          – LSpice
          1 hour 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%2f319874%2frelevance-of-landaus-algorithm-for-denesting-radicals%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

          Eastern Orthodox Church

          Zagreb

          Understanding the information contained in the Deep Space Network XML data?