Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Suppose $S$ is a subset of $\mathbb{R}^n$ defined by a system of finitely many polynomial inequalities with integer coefficients. Assume that $S$ is not bounded, but $S$ has finite volume $v$ as a subset of $\mathbb{R}^n$. Can anyone describe an algorithm for generating a sequence of rational numbers that converges to $v$ from above?

share|cite|improve this question
I take it that you are given the inequalities, but you aren't given $v$? – Gerry Myerson Sep 3 '12 at 2:31
@Gerry Myerson: Exactly. I don't see how to systematically approximate $v$ from above given an arbitrary set of inequalities for which $v$ is finite. – falang Sep 10 '12 at 22:47

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.