01976nam0 2200397 i 450 SUN011316320180104123350.4090.00N978-1-4939-2969-620180103d2015 |0engc50 baengUS|||| |||||*Computing the continuous discretelyinteger-point enumeration in polyhedraMatthias Beck, Sinai Robinswith illustrations by David Austin2. edNew YorkSpringer2015XX, 285 p.ill.24 cm001SUN00240192001 *Undergraduate texts in mathematics210 BerlinSpringer1958-.11-XXNumber theory [MSC 2020]MFSUNC01968805A15Exact enumeration problems, generating functions [MSC 2020]MFSUNC02155811P21Lattice points in specified regions [MSC 2020]MFSUNC02182511H06Lattices and convex bodies (number-theoretic aspects) [MSC 2020]MFSUNC02196805B15Orthogonal arrays, Latin squares, Room squares [MSC 2020]MFSUNC02217352B20Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) [MSC 2020]MFSUNC02392152B05Combinatorial properties (number of faces, shortest paths, etc.) [MSC 2020]MFSUNC033552USNew YorkSUNL000011Beck, MatthiasSUNV087300299625Robins, SinaiSUNV087301299626Austin, DavidSUNV087302440SpringerSUNV000178650ITSOL20210503RICAhttp://dx.doi.org/10.1007/978-1-4939-2969-6SUN0113163UFFICIO DI BIBLIOTECA DEL DIPARTIMENTO DI MATEMATICA E FISICA08CONS e-book 0146 08eMF146 20180103 Computing the continuous discretely729624UNICAMPANIA