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
Parents
307
Hűckel molecular orbitals of Mőbius-type conformations of annulenes
E. Heilbronner · Tetrahedron Letters · 1964 · 525 citations
Natural Sciences, Chemistry, Physics +12
Fourier meets möbius: fast subset convolution
Andreas Björklund, Thore Husfeldt, Petteri Kaski et al. · 2007 · 278 citations
1–5 of 307
484
6
h-index
5
h-index
5
h-index
4
h-index
4
h-index
1–5 of 484
328

Centre National de la Recherche Scientifique
Paris, France
10 h-index
16 publications
436 citations
University of Michigan
Ann Arbor, United States
7 h-index
7 publications
226 citations
Massachusetts Institute of Technology
Cambridge, United States
6 h-index
8 publications
461 citations

University of Turku
Turku, Finland
4 h-index
6 publications
147 citations
University of California San Diego
San Diego, United States
4 h-index
6 publications
443 citations

Carleton University
Ottawa, Canada
4 h-index
6 publications
289 citations

KTH Royal Institute of Technology
Stockholm, Sweden
4 h-index
4 publications
65 citations
Michigan State University
East Lansing, United States
4 h-index
4 publications
127 citations
1–8 of 328
7 publications · 528 citations
7
h-index
6 publications · 99 citations
6
h-index
6 publications · 123 citations
6
h-index
Repository · 6 publications · 154 citations
6
h-index
5 publications · 127 citations
5
h-index
1–5