↓ Skip to main content
What is this page? Embed badge

Computing the continuous discretely : integer-point enumeration in polyhedra

Overview of attention for book
Cover of 'Computing the continuous discretely : integer-point enumeration in polyhedra'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 The Coin-Exchange Problem of Frobenius
  3. Altmetric Badge
    Chapter 2 A Gallery of Discrete Volumes
  4. Altmetric Badge
    Chapter 3 Counting Lattice Points in Polytopes:The Ehrhart Theory
  5. Altmetric Badge
    Chapter 4 Reciprocity
  6. Altmetric Badge
    Chapter 5 Face Numbers and the Dehn—Sommerville Relations in Ehrhartian Terms
  7. Altmetric Badge
    Chapter 6 Magic Squares
  8. Altmetric Badge
    Chapter 7 Finite Fourier Analysis
  9. Altmetric Badge
    Chapter 8 Dedekind Sums, the Building Blocks of Lattice-point Enumeration
  10. Altmetric Badge
    Chapter 9 The Decomposition of a Polytope into Its Cones
  11. Altmetric Badge
    Chapter 10 Euler—Maclaurin Summation in ℝ d
  12. Altmetric Badge
    Chapter 11 Solid Angles
  13. Altmetric Badge
    Chapter 12 A Discrete Version of Green’s Theorem Using Elliptic Functions
Attention for Chapter 8: Dedekind Sums, the Building Blocks of Lattice-point Enumeration
Altmetric Badge

Citations

dimensions_citation
65 Dimensions
Summary Dimensions citations
So far, Dimensions has found 65 publications that cite this research output.

65

The most recent citing publications are shown below. View all 65 publications that cite this research output on Dimensions.

This page shows the most recent citations of this research output.

Click here to find out how to access more activity.

This page is provided by Altmetric.