{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":17,"n_cols":5,"rows_kept":17,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[13,2,13,3],[14,2,14,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910151934403321"]
[null,null,"Autore",null,"Barvinok Alexander"]
[null,null,"Titolo",null,"Integer Points in Polyhedra [[electronic resource] /] / Alexander Barvinok"]
[null,null,"Pubbl/distr/stampa",null,"Zuerich, Switzerland, : European Mathematical Society Publishing House, 2008"]
[null,null,"ISBN",null,"3-03719-552-5"]
[null,null,"Descrizione fisica",null,"1 online resource (199 pages)"]
[null,null,"Collana",null,"Zurich Lectures in Advanced Mathematics (ZLAM)"]
[null,null,"Classificazione",null,"52-xx05-xx11-xx"]
[null,null,"Soggetti",null,"Finite geometry"]
[{"$nulls":4},"Algebraic number theory"]
[{"$nulls":4},"Convex and discrete geometry"]
[{"$nulls":4},"Combinatorics"]
[{"$nulls":4},"Number theory"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Sommario/riassunto","This is a self-contained exposition of several core aspects of the theory of rational polyhedra  with a view towards algorithmic applications to efficient counting of integer points,  a problem arising in many areas of pure and applied mathematics. The approach is based  on the consistent development and application of the apparatus of generating functions  and the algebra of polyhedra. Topics range from classical, such as the Euler characteristic,  continued fractions, Ehrhart polynomial, Minkowski Convex Body Theorem, and the Lenstra-  Lenstra-Lovász lattice reduction algorithm, to recent advances such as the Berline-Vergne  local formula.     The text is intended for graduate students and researchers. Prerequisites are a modest background in linear algebra and analysis as well as some general mathematical maturity. Numerous figures, exercises of varying degree of difficulty as well as references to the literature and publicly available software make the text suitable for a graduate course."]