# Ehrhart polynomial

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2011

2011

- 2011

Several polytopes arise from finite graphs. For edge and symmetric edge polytopes, in particular, exhaustive computation of the… (More)

Is this relevant?

2008

2008

- Discrete & Computational Geometry
- 2008

M. Beck, J. De Loera, M. Develin, J. Pfeifle and R. Stanley found that the roots of the Ehrhart polynomial of a d-dimensional… (More)

Is this relevant?

2007

2007

- Discrete & Computational Geometry
- 2007

We determine lattice polytopes of smallest volume with a given number of interior lattice points. We show that the Ehrhart… (More)

Is this relevant?

2006

2006

- 2006

There is a simple formula for the Ehrhart polynomial of a cyclic polytope. The purpose of this paper is to show that the same… (More)

Is this relevant?

2004

2004

- 2004

The n Birkhoff polytope is the set of all doubly stochastic n × n matrices, that is, those matrices with nonnegative real… (More)

Is this relevant?

2003

2003

- Discrete & Computational Geometry
- 2003

The n Birkhoff polytope is the set of all doubly stochastic n × n matrices, that is, those matrices with nonnegative real… (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- 1996

In order to produce efficient parallel programs, optimizing compilers need to include an analysis of the initial sequential code… (More)

Is this relevant?

1996

1996

- 1996

The problem of counting the number of lattice points inside a lattice polytope in Rn has been studied from a variety of… (More)

Is this relevant?

1995

1995

- 1995

LetA be a subspace arrangement and let χ(A, t) be the characteristic polynomial of its intersection latticeL(A). We show that if… (More)

Is this relevant?

1994

1994

- Discrete & Computational Geometry
- 1994

The problem of counting integral points in polyhedra has been of interest for a long time. It is known that generally this… (More)

Is this relevant?