Learn More
The problem of counting the number of lattice points inside a lattice polytope in R n has been studied from a variety of perspectives, including the recent work of Pommersheim and Kantor-Khovanskii using toric varieties and Cappell-Shaneson using Grothendieck-Riemann-Roch. Here we show that the Ehrhart polynomial of a lattice n-simplex has a simple(More)
In view of the clear evidence that urokinase type plasminogen activator (uPA) plays an important role in the processes of tumor cell metastasis, aortic aneurysm, and multiple sclerosis, it has become a target of choice for pharmacological intervention. The goal of this study was thus to determine the presence of inhibitors of uPA in plants known(More)
We study the number of lattice points in integer dilates of the open rational polytope P = ((x 1 ; : : : ; xn) 2 R n >0 : n X k=1 x k a k < 1) ; where a 1 ; : : : ; an are positive integers. This polytope is closely related to the Frobenius problem: given relatively prime positive integers a 1 ; : : : ; an, nd the largest value of t (the Frobe-nius number)(More)
  • 1