TOPICS
Search

Möbius Problem


Let A={a_1,a_2,...} be a free Abelian semigroup, where a_1 is the identity element, and let mu(n) be the Möbius function. Define mu(a_n) on the elements of the semigroup analogously to the definition of mu(n) (as (-1)^r if n is the product of r distinct primes) by regarding generators of the semigroup as primes. Then the Möbius problem asks if the properties

1. a<b implies ac<bc for a,b,c in A, where A has the linear order a_1<a_2<...,

2. mu(a_n)=mu(n) for all n,

imply that

 a_(mn)=a_ma_n

for all m,n>=1. Informally, the problem asks "Is the multiplication law on the positive integers uniquely determined by the values of the Möbius function and the property that multiplication respects order?

The problem is known to be true for all mn<=74 if mu(a_n)=mu(n) for all n<=240 (Flath and Zulauf 1995).


See also

Braun's Conjecture, Möbius Function

Explore with Wolfram|Alpha

References

Flath, A. and Zulauf, A. "Does the Möbius Function Determine Multiplicative Arithmetic?" Amer. Math. Monthly 102, 354-256, 1995.

Referenced on Wolfram|Alpha

Möbius Problem

Cite this as:

Weisstein, Eric W. "Möbius Problem." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/MoebiusProblem.html

Subject classifications