Möbius Function

The Möbius Function is an arithmetic function defined on the set of positive integers that assigns values based on the prime factorization of an integer, specifically distinguishing between square-free integers with an even or odd number of prime factors and those with repeated prime factors.

307

Publications

12.5K

Citations

484

Authors

328

Institutions

Publications per year

2017–2026

31

Variants

Mobius Function

Authors

484

  1. MG
    Michel Grabisch

    Université Paris 1 Panthéon-Sorbonne, France

    6 publications · 672 citations

    6

    h-index

  2. AB
    Anders Björner

    KTH Royal Institute of Technology, Sweden

    5 publications · 137 citations

    5

    h-index

  3. LL
    László Lovász

    Eötvös Loránd University, Hungary

    5 publications · 1.3K citations

    5

    h-index

  4. BE
    Bruce E. Sagan

    Michigan State University, United States

    4 publications · 127 citations

    4

    h-index

  5. NC
    Nan‐Xian Chen

    University of Science and Technology Beijing, China

    4 publications · 391 citations

    4

    h-index

1–5 of 484

Venues

  1. Advances in Mathematics

    7 publications · 528 citations

    7

    h-index

  2. Acta Arithmetica

    6 publications · 99 citations

    6

    h-index

  3. Journal of the London Mathematical Society

    6 publications · 123 citations

    6

    h-index

  4. arXiv (Cornell University)

    Repository · 6 publications · 154 citations

    6

    h-index

  5. Pacific Journal of Mathematics

    5 publications · 127 citations

    5

    h-index

1–5