Algorithm to find the n-th root in the free group












-1












$begingroup$


Given a word $w$ in the free group $F$, is there an algorithm to find it’s n-th root, if it exists?
Thanks!






group-theory algorithms roots free-groups







share|cite|improve this question











$endgroup$












  • $begingroup$
    What is your definition of a free group? What did you try t solve this problem?
    $endgroup$
    – Moishe Cohen
    Jan 6 at 16:49
















-1












$begingroup$


Given a word $w$ in the free group $F$, is there an algorithm to find it’s n-th root, if it exists?
Thanks!






group-theory algorithms roots free-groups







share|cite|improve this question











$endgroup$












  • $begingroup$
    What is your definition of a free group? What did you try t solve this problem?
    $endgroup$
    – Moishe Cohen
    Jan 6 at 16:49














-1












-1








-1





$begingroup$


Given a word $w$ in the free group $F$, is there an algorithm to find it’s n-th root, if it exists?
Thanks!






group-theory algorithms roots free-groups







share|cite|improve this question











$endgroup$




Given a word $w$ in the free group $F$, is there an algorithm to find it’s n-th root, if it exists?
Thanks!






group-theory algorithms roots free-groups




group-theory algorithms roots free-groups






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 6 at 13:55







Blu

















asked Jan 6 at 13:47









BluBlu

466




466












  • $begingroup$
    What is your definition of a free group? What did you try t solve this problem?
    $endgroup$
    – Moishe Cohen
    Jan 6 at 16:49


















  • $begingroup$
    What is your definition of a free group? What did you try t solve this problem?
    $endgroup$
    – Moishe Cohen
    Jan 6 at 16:49
















$begingroup$
What is your definition of a free group? What did you try t solve this problem?
$endgroup$
– Moishe Cohen
Jan 6 at 16:49




$begingroup$
What is your definition of a free group? What did you try t solve this problem?
$endgroup$
– Moishe Cohen
Jan 6 at 16:49










1 Answer
1






active

oldest

votes


















1












$begingroup$

If $w$ has an $n$th root, then so does every conjugate of it.
Among all pairs $(x,u)$ such that $w=u^{-1}x^nu$, pick one that minimizes first the length $|x|$ and then $|u|$.



If the first and last letter of $x$ are inverse of each other, i.e., $x=aya^{-1}$
for some letter $a$ and word $y$ with $|y|<|x|$, then $w=v^{-1}y^nv$ with $v=au$, contradicting minimality of $|x|$.
Hence $x^n$ is really just concatenation (i.e., without any cancellation among the factors).



If the first letters of $u$ and $x$ are the same, i.e., $u=av$, $x=ay$ for some letter $a$ and words $v,y$ with $|v|<|u|$, $|y|<|x|$, then
$w=v^{-1}a^{-1}(ay)^nav=v^{-1}(ya)^nv$, contradicting minimality (as $v|<|u|$ and $|ya|le |x|$).



Similarly, if the first letter of $u$ and the last letter of $x$ are inverses, i.e., $u=av$, $x=ya^{-1}$ for some letter $a$ and words $v,y$ with $|v|<|u|$, $|y|<|x|$, then $w=v^{-1}a^{-1}(ya^{-1})^nav=v^{-1}(a^{-1}y)^nv$, contradicting minimality.



We conclude that no cancellation occurs when multiplying the factors $u^{-1},x,x,ldots, x,u$.



This suggests the following algorithm:




  1. Let $uleftarrowepsilon$, $vleftarrow w$.

  2. If $|v|$ is a multiple of $n$ and is the simple concatenation of $n$ copies of its length $|v|/n$ prefix $x$, then output "$uxu^{-1} $" and terminate. (Note that this condition also triggers when $v=epsilon$, hence we may assume $vneepsilon$ in the next step)

  3. Let $aleftarrow operatorname{first}(v)$, $bleftarrow operatorname{last}(v)$.

  4. If $ane b^{-1}$ output "NOT AN $n$TH POWER" and terminate.


  5. (As $a=b^{-1}$, we have $ane b$, hence $|v|ge 2$ and so $v=av'b$ for some shorter word $v'$) Let $vleftarrow v'$, $uleftarrow ua$, and go back to step 2.






share|cite|improve this answer









$endgroup$













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


    }
    });














    draft saved

    draft discarded


















    StackExchange.ready(
    function () {
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3063874%2falgorithm-to-find-the-n-th-root-in-the-free-group%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









    1












    $begingroup$

    If $w$ has an $n$th root, then so does every conjugate of it.
    Among all pairs $(x,u)$ such that $w=u^{-1}x^nu$, pick one that minimizes first the length $|x|$ and then $|u|$.



    If the first and last letter of $x$ are inverse of each other, i.e., $x=aya^{-1}$
    for some letter $a$ and word $y$ with $|y|<|x|$, then $w=v^{-1}y^nv$ with $v=au$, contradicting minimality of $|x|$.
    Hence $x^n$ is really just concatenation (i.e., without any cancellation among the factors).



    If the first letters of $u$ and $x$ are the same, i.e., $u=av$, $x=ay$ for some letter $a$ and words $v,y$ with $|v|<|u|$, $|y|<|x|$, then
    $w=v^{-1}a^{-1}(ay)^nav=v^{-1}(ya)^nv$, contradicting minimality (as $v|<|u|$ and $|ya|le |x|$).



    Similarly, if the first letter of $u$ and the last letter of $x$ are inverses, i.e., $u=av$, $x=ya^{-1}$ for some letter $a$ and words $v,y$ with $|v|<|u|$, $|y|<|x|$, then $w=v^{-1}a^{-1}(ya^{-1})^nav=v^{-1}(a^{-1}y)^nv$, contradicting minimality.



    We conclude that no cancellation occurs when multiplying the factors $u^{-1},x,x,ldots, x,u$.



    This suggests the following algorithm:




    1. Let $uleftarrowepsilon$, $vleftarrow w$.

    2. If $|v|$ is a multiple of $n$ and is the simple concatenation of $n$ copies of its length $|v|/n$ prefix $x$, then output "$uxu^{-1} $" and terminate. (Note that this condition also triggers when $v=epsilon$, hence we may assume $vneepsilon$ in the next step)

    3. Let $aleftarrow operatorname{first}(v)$, $bleftarrow operatorname{last}(v)$.

    4. If $ane b^{-1}$ output "NOT AN $n$TH POWER" and terminate.


    5. (As $a=b^{-1}$, we have $ane b$, hence $|v|ge 2$ and so $v=av'b$ for some shorter word $v'$) Let $vleftarrow v'$, $uleftarrow ua$, and go back to step 2.






    share|cite|improve this answer









    $endgroup$


















      1












      $begingroup$

      If $w$ has an $n$th root, then so does every conjugate of it.
      Among all pairs $(x,u)$ such that $w=u^{-1}x^nu$, pick one that minimizes first the length $|x|$ and then $|u|$.



      If the first and last letter of $x$ are inverse of each other, i.e., $x=aya^{-1}$
      for some letter $a$ and word $y$ with $|y|<|x|$, then $w=v^{-1}y^nv$ with $v=au$, contradicting minimality of $|x|$.
      Hence $x^n$ is really just concatenation (i.e., without any cancellation among the factors).



      If the first letters of $u$ and $x$ are the same, i.e., $u=av$, $x=ay$ for some letter $a$ and words $v,y$ with $|v|<|u|$, $|y|<|x|$, then
      $w=v^{-1}a^{-1}(ay)^nav=v^{-1}(ya)^nv$, contradicting minimality (as $v|<|u|$ and $|ya|le |x|$).



      Similarly, if the first letter of $u$ and the last letter of $x$ are inverses, i.e., $u=av$, $x=ya^{-1}$ for some letter $a$ and words $v,y$ with $|v|<|u|$, $|y|<|x|$, then $w=v^{-1}a^{-1}(ya^{-1})^nav=v^{-1}(a^{-1}y)^nv$, contradicting minimality.



      We conclude that no cancellation occurs when multiplying the factors $u^{-1},x,x,ldots, x,u$.



      This suggests the following algorithm:




      1. Let $uleftarrowepsilon$, $vleftarrow w$.

      2. If $|v|$ is a multiple of $n$ and is the simple concatenation of $n$ copies of its length $|v|/n$ prefix $x$, then output "$uxu^{-1} $" and terminate. (Note that this condition also triggers when $v=epsilon$, hence we may assume $vneepsilon$ in the next step)

      3. Let $aleftarrow operatorname{first}(v)$, $bleftarrow operatorname{last}(v)$.

      4. If $ane b^{-1}$ output "NOT AN $n$TH POWER" and terminate.


      5. (As $a=b^{-1}$, we have $ane b$, hence $|v|ge 2$ and so $v=av'b$ for some shorter word $v'$) Let $vleftarrow v'$, $uleftarrow ua$, and go back to step 2.






      share|cite|improve this answer









      $endgroup$
















        1












        1








        1





        $begingroup$

        If $w$ has an $n$th root, then so does every conjugate of it.
        Among all pairs $(x,u)$ such that $w=u^{-1}x^nu$, pick one that minimizes first the length $|x|$ and then $|u|$.



        If the first and last letter of $x$ are inverse of each other, i.e., $x=aya^{-1}$
        for some letter $a$ and word $y$ with $|y|<|x|$, then $w=v^{-1}y^nv$ with $v=au$, contradicting minimality of $|x|$.
        Hence $x^n$ is really just concatenation (i.e., without any cancellation among the factors).



        If the first letters of $u$ and $x$ are the same, i.e., $u=av$, $x=ay$ for some letter $a$ and words $v,y$ with $|v|<|u|$, $|y|<|x|$, then
        $w=v^{-1}a^{-1}(ay)^nav=v^{-1}(ya)^nv$, contradicting minimality (as $v|<|u|$ and $|ya|le |x|$).



        Similarly, if the first letter of $u$ and the last letter of $x$ are inverses, i.e., $u=av$, $x=ya^{-1}$ for some letter $a$ and words $v,y$ with $|v|<|u|$, $|y|<|x|$, then $w=v^{-1}a^{-1}(ya^{-1})^nav=v^{-1}(a^{-1}y)^nv$, contradicting minimality.



        We conclude that no cancellation occurs when multiplying the factors $u^{-1},x,x,ldots, x,u$.



        This suggests the following algorithm:




        1. Let $uleftarrowepsilon$, $vleftarrow w$.

        2. If $|v|$ is a multiple of $n$ and is the simple concatenation of $n$ copies of its length $|v|/n$ prefix $x$, then output "$uxu^{-1} $" and terminate. (Note that this condition also triggers when $v=epsilon$, hence we may assume $vneepsilon$ in the next step)

        3. Let $aleftarrow operatorname{first}(v)$, $bleftarrow operatorname{last}(v)$.

        4. If $ane b^{-1}$ output "NOT AN $n$TH POWER" and terminate.


        5. (As $a=b^{-1}$, we have $ane b$, hence $|v|ge 2$ and so $v=av'b$ for some shorter word $v'$) Let $vleftarrow v'$, $uleftarrow ua$, and go back to step 2.






        share|cite|improve this answer









        $endgroup$



        If $w$ has an $n$th root, then so does every conjugate of it.
        Among all pairs $(x,u)$ such that $w=u^{-1}x^nu$, pick one that minimizes first the length $|x|$ and then $|u|$.



        If the first and last letter of $x$ are inverse of each other, i.e., $x=aya^{-1}$
        for some letter $a$ and word $y$ with $|y|<|x|$, then $w=v^{-1}y^nv$ with $v=au$, contradicting minimality of $|x|$.
        Hence $x^n$ is really just concatenation (i.e., without any cancellation among the factors).



        If the first letters of $u$ and $x$ are the same, i.e., $u=av$, $x=ay$ for some letter $a$ and words $v,y$ with $|v|<|u|$, $|y|<|x|$, then
        $w=v^{-1}a^{-1}(ay)^nav=v^{-1}(ya)^nv$, contradicting minimality (as $v|<|u|$ and $|ya|le |x|$).



        Similarly, if the first letter of $u$ and the last letter of $x$ are inverses, i.e., $u=av$, $x=ya^{-1}$ for some letter $a$ and words $v,y$ with $|v|<|u|$, $|y|<|x|$, then $w=v^{-1}a^{-1}(ya^{-1})^nav=v^{-1}(a^{-1}y)^nv$, contradicting minimality.



        We conclude that no cancellation occurs when multiplying the factors $u^{-1},x,x,ldots, x,u$.



        This suggests the following algorithm:




        1. Let $uleftarrowepsilon$, $vleftarrow w$.

        2. If $|v|$ is a multiple of $n$ and is the simple concatenation of $n$ copies of its length $|v|/n$ prefix $x$, then output "$uxu^{-1} $" and terminate. (Note that this condition also triggers when $v=epsilon$, hence we may assume $vneepsilon$ in the next step)

        3. Let $aleftarrow operatorname{first}(v)$, $bleftarrow operatorname{last}(v)$.

        4. If $ane b^{-1}$ output "NOT AN $n$TH POWER" and terminate.


        5. (As $a=b^{-1}$, we have $ane b$, hence $|v|ge 2$ and so $v=av'b$ for some shorter word $v'$) Let $vleftarrow v'$, $uleftarrow ua$, and go back to step 2.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Jan 6 at 17:15









        Hagen von EitzenHagen von Eitzen

        277k22269496




        277k22269496






























            draft saved

            draft discarded




















































            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.




            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3063874%2falgorithm-to-find-the-n-th-root-in-the-free-group%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

            1300-talet

            Image
            Den här artikeln handlar om hundraårsperioden 1300–1399. För decenniet 1300–1309, se 1300-talet (decennium). .mw-parser-output .infobox{border:1px solid #aaa;background-color:#f9f9f9;color:black;margin:.5em 0 .5em 1em;padding:.2em;float:right;clear:right;width:22em;text-align:left;font-size:88%;line-height:1.6em}.mw-parser-output .infobox td,.mw-parser-output .infobox th{vertical-align:top;padding:0 .2em}.mw-parser-output .infobox caption{font-size:larger}.mw-parser-output .infobox.bordered{border-collapse:collapse}.mw-parser-output .infobox.bordered td,.mw-parser-output .infobox.bordered th{border:1px solid #aaa}.mw-parser-output .infobox.bordered .borderless td,.mw-parser-output .infobox.bordered .borderless th{border:0}.mw-parser-output .infobox-showbutton .mw-collapsible-text{color:inherit}.mw-parser-output .infobox.bordered .mergedtoprow td,.mw-parser-output .infobox.bordered .mergedtoprow th{border:0;border-top:1px solid #aaa;border-right:1px solid #aaa}.mw-parser-output ...
            Read more

            1300-talet

            Image
            Den här artikeln handlar om hundraårsperioden 1300–1399. För decenniet 1300–1309, se 1300-talet (decennium). .mw-parser-output .infobox{border:1px solid #aaa;background-color:#f9f9f9;color:black;margin:.5em 0 .5em 1em;padding:.2em;float:right;clear:right;width:22em;text-align:left;font-size:88%;line-height:1.6em}.mw-parser-output .infobox td,.mw-parser-output .infobox th{vertical-align:top;padding:0 .2em}.mw-parser-output .infobox caption{font-size:larger}.mw-parser-output .infobox.bordered{border-collapse:collapse}.mw-parser-output .infobox.bordered td,.mw-parser-output .infobox.bordered th{border:1px solid #aaa}.mw-parser-output .infobox.bordered .borderless td,.mw-parser-output .infobox.bordered .borderless th{border:0}.mw-parser-output .infobox-showbutton .mw-collapsible-text{color:inherit}.mw-parser-output .infobox.bordered .mergedtoprow td,.mw-parser-output .infobox.bordered .mergedtoprow th{border:0;border-top:1px solid #aaa;border-right:1px solid #aaa}.mw-parser-output ...
            Read more

            Display a custom attribute below product name in the front-end Magento 1.9.3.8

            Image
            0 I need to display a custom attribute bellow the product name and I don't know how can I call this attribute. I am editing the file /app/design/frontend/templatemela/MAG100219_1/template/catalog/product/view.phtml But how can I call this attribute in php? I tried calling a string echo with the name I put in the attribute, but it didn't work. Code is as below: <div class="page-title product-title"> <h1><?php echo $_helper->productAttribute($_product, $_product->getName(), 'name') ?></h1> </div> <div class="codigoinmetro"> <h2><?php echo $_helper->productAttribute($_product, $_product->getName(), 'registroinmetro') ?></h2> </div> php attrib...
            Read more