Ehrhart polynomial for lattice squares, cubes and hypercubes

preprint2016arXivOpen access

Abstract

In this paper we are constructing integer lattice squares, cubes or hypercubes in Rd\mathbb R^d with d∈{2,3,4}d\in \{2,3,4\}. For squares and cubes we find a complete description of their Ehrhart polynomial. For hypercubes, we compute one of the coefficients and show that there exists a simple linear relation between the other two unknown coefficients. This allows as to formulate a conjecture of what the Ehrhart polynomial is in this case.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.