Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Hi, overflowers.

I was interested in a sharp lower bound for the number of lattice points (say, integral lattice points) inside the tetrahedron defined by the coordinate hyperplanes and $x_1/a_1+...+x_n/a_n=1$, with $a_1,...,a_n \in {\mathbf R}$ (rational coefficients may be enough, although I think it doesn't help a lot).

I know there is a good upper bound from the "rough part" of so-called GLY conjecture, which has already been proved by Yau & Zhang; but I just can't find a similar result for lower bounds.

Thanks a lot.

share|improve this question
add comment

Your Answer

 
discard

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

Browse other questions tagged or ask your own question.