On the volume of a polytope in Rn

Computing the volume and integral points of a polytope in Rn is a very important subject in different areas of mathematics. Chapter one give a short introduction, provide a sketch of what polytope looks like and how they behave with many examples. Some methods for finding the volumeof a convex polytope are recalled. Chapter two, present some methods for computing the coefficients of Ehrhart polynomial that depend on the concepts of residue theorem in complex analysis. Chapter three, a method for finding the volume of a cyclic polytope is presented and some basic concepts and remarks about the cyclic polytope and their volumes are discussed with their Ehrhart polynomials. We find a general formula for the number of integral points. To the best of our knowledge, this result seems to be new. The analysis should be useful to professionals in combinatorial, algebraic geometry, cryptography, and integer programming.

Autorentext

Fatema A.S.has M.Sc. degree from university of Technology in 2009 in Applied Mathematics with specialization combinatorial. She is assistant lecture in 2009,and published articles inside Iraq.Assoc.prof.Dr.Shatha A.S.has Ph.D.degree from Al-Nahrain University in 2005 in Applied Mathematics and computer application with specialization combinatoril.