English

Ehrhart polynomial for lattice squares, cubes and hypercubes

Number Theory 2016-03-18 v2

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.

Keywords

Cite

@article{arxiv.1508.03643,
  title  = {Ehrhart polynomial for lattice squares, cubes and hypercubes},
  author = {Eugen J. Ionascu},
  journal= {arXiv preprint arXiv:1508.03643},
  year   = {2016}
}

Comments

23 pages and three figures

R2 v1 2026-06-22T10:34:11.075Z