8
$\begingroup$

Suppose two elements of the ring of periods are given by their systems of polynomial inequalities with rational coefficients. Is there a known algorithm deciding their equality? Is it known if their equality is algorithmically decidable at all?

It is quite obvious that if they are not equal, then it can be shown after finite number of steps just by evaluating them with big enough precision. The difficult part is when they are equal.

$\endgroup$
2
  • 2
    $\begingroup$ There is a deep conjecture here which is explained nicely in the paper of Kontsevich-Zagier. $\endgroup$ Dec 8, 2011 at 22:05
  • 3
    $\begingroup$ This is Problem 1 of Kontsevich-Zagier. They say: "Problem 1 therefore looks completely intratable now and may remain so for many years" (page 7). ihes.fr/~maxim/TEXTS/Periods.pdf $\endgroup$ Dec 9, 2011 at 4:02

1 Answer 1

7
$\begingroup$

There is no known algorithm for that, and it is unknown if such an algorithm exists.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.