Évaluation asymptotique de l'ordre maximum d'un élément du groupe symétrique (Q3715205)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3943945
Language Label Description Also known as
default for all languages
No label defined
    English
    Évaluation asymptotique de l'ordre maximum d'un élément du groupe symétrique
    scientific article; zbMATH DE number 3943945

      Statements

      Évaluation asymptotique de l'ordre maximum d'un élément du groupe symétrique (English)
      0 references
      0 references
      0 references
      0 references
      1988
      0 references
      symmetric group
      0 references
      number of prime factors
      0 references
      upper bounds
      0 references
      superior highly composite numbers
      0 references
      asymptotic formula
      0 references
      maximum order
      0 references
      arithmetic function
      0 references
      Let \(S_ n\) be the symmetric group of n elements, and \(g(n)=\max_{\sigma \in S_ n}(order of \sigma).\) E. Landau first considered this function, and proved \(\log g(n)\sim \sqrt{n \log n}.\) Let Li x be a primitive of 1/log x, and \(\omega\) (N) the number of prime factors of N. We prove: \[ \log g(n)=\sqrt{Li^{-1} n}+A(n),\quad \omega (g(n))=Li(\sqrt{Li^{-1} n})+B(n). \] Various upper bounds for the error terms A(n) and B(n) are given, under different possible hypotheses for the error term in the prime number theorem. These upper bounds are shown to be best possible. The tools are the techniques of the superior highly composite numbers of Ramanujan, explicit formulae in number theory, and the \(\Omega\)-theorems of Landau.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references