Counting inversions of random elements in coxeter groups The 2019 Stack Overflow Developer Survey Results Are InRecurrence representation(s): $a(n+1)=a(n)(n-1/2)+o(1/n)$ and $a(n+1)=a(n)(n-1/2+o(1/n))$Finite/Infinite Coxeter GroupsA question on Coxeter groupsProof about coxeter groupsGroups - InversionsA question about Coxeter groups.Number of conjugacy classes or bounds for the index of stabilizers on finite Coxeter groups.Reference request: Inversions and $sum_win Wq^ell(w)$ for arbitrary Coxeter groupsThe ratio of Raw Maxima of Mahonian numbers in terms of groupsCoxeter length in the symmetric group equals number of inversions

Am I thawing this London Broil safely?

What to do when moving next to a bird sanctuary with a loosely-domesticated cat?

Why isn't the circumferential light around the M87 black hole's event horizon symmetric?

Button changing it's text & action. Good or terrible?

Multiply Two Integer Polynomials

Worn-tile Scrabble

What tool would a Roman-age civilization have for the breaking of silver and other metals into dust?

Why was M87 targetted for the Event Horizon Telescope instead of Sagittarius A*?

Why not take a picture of a closer black hole?

Write faster on AT24C32

How to save as into a customized destination on macOS?

Loose spokes after only a few rides

A poker game description that does not feel gimmicky

How are circuits which use complex ICs normally simulated?

Is an up-to-date browser secure on an out-of-date OS?

Is flight data recorder erased after every flight?

For what reasons would an animal species NOT cross a *horizontal* land bridge?

What could be the right powersource for 15 seconds lifespan disposable giant chainsaw?

Can a flute soloist sit?

Time travel alters history but people keep saying nothing's changed

How to answer pointed "are you quitting" questioning when I don't want them to suspect

Can a rogue use sneak attack with weapons that have the thrown property even if they are not thrown?

Identify boardgame from Big movie

How to deal with fear of taking dependencies



Counting inversions of random elements in coxeter groups



The 2019 Stack Overflow Developer Survey Results Are InRecurrence representation(s): $a(n+1)=a(n)(n-1/2)+o(1/n)$ and $a(n+1)=a(n)(n-1/2+o(1/n))$Finite/Infinite Coxeter GroupsA question on Coxeter groupsProof about coxeter groupsGroups - InversionsA question about Coxeter groups.Number of conjugacy classes or bounds for the index of stabilizers on finite Coxeter groups.Reference request: Inversions and $sum_win Wq^ell(w)$ for arbitrary Coxeter groupsThe ratio of Raw Maxima of Mahonian numbers in terms of groupsCoxeter length in the symmetric group equals number of inversions










1












$begingroup$


I am trying to find a general interperetation to the following facts (pls be patient to read it).



  1. Let's look at the property of Kendall-Mann numbers $M(n)$ which are row maxima of Triangle of Mahonian numbers $T(n,k)$ (the number of permutations of 1..n with k inversions).
    According to Richard Stanley $$ left| Pleft( fracmathrminv(pi)-frac 12nchoose 2sqrtn(n-1)(2n+5)/72leq xright)-Phi(x)right| leq fracCsqrtn, $$
    where $Phi(x)$ denotes the standard normal distribution. From this it is immediate that $M(n+1)/M(n)=n-frac 12+o(1)$


  2. Looking at combinatorial proof for the property of Kendall-Mann numbers numbers at MO
    $M(n) approx c n!/n^3/2$ and
    $$fracM(n+1)M(n) approx frac(n+1)(n+1)^-3/2n^-3/2 = n (1+1/n)^-1/2 approx n-1/2.$$
    This is pretty the same result as #1.


  3. Reading through Counting inversions and descents of random elements in finite Coxeter groups I noticed Corollary 3.2 (page 6 of the article) that mean and variance of W-Mahonian distribution depend on the types of groups, i.e. $A_n$, $B_n$, $D_n$. By and large it's about $n^3/2$ like for #1 and #2.


This results in the similar 'structure': $approx n-1/2$ .



So I wonder why? I am looking for a general explanation to the facts.
I guess this is due to Cayley theorem but I need a more detailed explanation.










share|cite|improve this question











$endgroup$
















    1












    $begingroup$


    I am trying to find a general interperetation to the following facts (pls be patient to read it).



    1. Let's look at the property of Kendall-Mann numbers $M(n)$ which are row maxima of Triangle of Mahonian numbers $T(n,k)$ (the number of permutations of 1..n with k inversions).
      According to Richard Stanley $$ left| Pleft( fracmathrminv(pi)-frac 12nchoose 2sqrtn(n-1)(2n+5)/72leq xright)-Phi(x)right| leq fracCsqrtn, $$
      where $Phi(x)$ denotes the standard normal distribution. From this it is immediate that $M(n+1)/M(n)=n-frac 12+o(1)$


    2. Looking at combinatorial proof for the property of Kendall-Mann numbers numbers at MO
      $M(n) approx c n!/n^3/2$ and
      $$fracM(n+1)M(n) approx frac(n+1)(n+1)^-3/2n^-3/2 = n (1+1/n)^-1/2 approx n-1/2.$$
      This is pretty the same result as #1.


    3. Reading through Counting inversions and descents of random elements in finite Coxeter groups I noticed Corollary 3.2 (page 6 of the article) that mean and variance of W-Mahonian distribution depend on the types of groups, i.e. $A_n$, $B_n$, $D_n$. By and large it's about $n^3/2$ like for #1 and #2.


    This results in the similar 'structure': $approx n-1/2$ .



    So I wonder why? I am looking for a general explanation to the facts.
    I guess this is due to Cayley theorem but I need a more detailed explanation.










    share|cite|improve this question











    $endgroup$














      1












      1








      1





      $begingroup$


      I am trying to find a general interperetation to the following facts (pls be patient to read it).



      1. Let's look at the property of Kendall-Mann numbers $M(n)$ which are row maxima of Triangle of Mahonian numbers $T(n,k)$ (the number of permutations of 1..n with k inversions).
        According to Richard Stanley $$ left| Pleft( fracmathrminv(pi)-frac 12nchoose 2sqrtn(n-1)(2n+5)/72leq xright)-Phi(x)right| leq fracCsqrtn, $$
        where $Phi(x)$ denotes the standard normal distribution. From this it is immediate that $M(n+1)/M(n)=n-frac 12+o(1)$


      2. Looking at combinatorial proof for the property of Kendall-Mann numbers numbers at MO
        $M(n) approx c n!/n^3/2$ and
        $$fracM(n+1)M(n) approx frac(n+1)(n+1)^-3/2n^-3/2 = n (1+1/n)^-1/2 approx n-1/2.$$
        This is pretty the same result as #1.


      3. Reading through Counting inversions and descents of random elements in finite Coxeter groups I noticed Corollary 3.2 (page 6 of the article) that mean and variance of W-Mahonian distribution depend on the types of groups, i.e. $A_n$, $B_n$, $D_n$. By and large it's about $n^3/2$ like for #1 and #2.


      This results in the similar 'structure': $approx n-1/2$ .



      So I wonder why? I am looking for a general explanation to the facts.
      I guess this is due to Cayley theorem but I need a more detailed explanation.










      share|cite|improve this question











      $endgroup$




      I am trying to find a general interperetation to the following facts (pls be patient to read it).



      1. Let's look at the property of Kendall-Mann numbers $M(n)$ which are row maxima of Triangle of Mahonian numbers $T(n,k)$ (the number of permutations of 1..n with k inversions).
        According to Richard Stanley $$ left| Pleft( fracmathrminv(pi)-frac 12nchoose 2sqrtn(n-1)(2n+5)/72leq xright)-Phi(x)right| leq fracCsqrtn, $$
        where $Phi(x)$ denotes the standard normal distribution. From this it is immediate that $M(n+1)/M(n)=n-frac 12+o(1)$


      2. Looking at combinatorial proof for the property of Kendall-Mann numbers numbers at MO
        $M(n) approx c n!/n^3/2$ and
        $$fracM(n+1)M(n) approx frac(n+1)(n+1)^-3/2n^-3/2 = n (1+1/n)^-1/2 approx n-1/2.$$
        This is pretty the same result as #1.


      3. Reading through Counting inversions and descents of random elements in finite Coxeter groups I noticed Corollary 3.2 (page 6 of the article) that mean and variance of W-Mahonian distribution depend on the types of groups, i.e. $A_n$, $B_n$, $D_n$. By and large it's about $n^3/2$ like for #1 and #2.


      This results in the similar 'structure': $approx n-1/2$ .



      So I wonder why? I am looking for a general explanation to the facts.
      I guess this is due to Cayley theorem but I need a more detailed explanation.







      combinatorics group-theory finite-groups coxeter-groups permutation-cycles






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Apr 6 at 19:27







      Mikhail Gaichenkov

















      asked Apr 5 at 20:20









      Mikhail GaichenkovMikhail Gaichenkov

      6610




      6610




















          0






          active

          oldest

          votes












          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%2f3176370%2fcounting-inversions-of-random-elements-in-coxeter-groups%23new-answer', 'question_page');

          );

          Post as a guest















          Required, but never shown

























          0






          active

          oldest

          votes








          0






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes















          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%2f3176370%2fcounting-inversions-of-random-elements-in-coxeter-groups%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

          Hidroelektrana Sadržaj Povijest | Podjela hidroelektrana | Snaga dobivena u hidroelektranama | Dijelovi hidroelektrane | Uloga hidroelektrana u suvremenom svijetu | Prednosti hidroelektrana | Nedostaci hidroelektrana | Države s najvećom proizvodnjom hidro-električne energije | Deset najvećih hidroelektrana u svijetu | Hidroelektrane u Hrvatskoj | Izvori | Poveznice | Vanjske poveznice | Navigacijski izbornikTechnical Report, Version 2Zajedničkom poslužiteljuHidroelektranaHEP Proizvodnja d.o.o. - Hidroelektrane u Hrvatskoj

          Bosc Connection Yimello Approaching Angry The produce zaps the market. 구성 기록되다 변경...

          WordPress Information needed