arXiv (All)
open access
Ehrhart Polynomials of Triangles in $\mathbb{R}^3$
We present two ways of constructing Ehrhart polynomials corresponding to certain triangles in $\mathbb{R}^3$. One of our methods employs Popoviciu's Theorem, while the other method uses a version of Pick's Theorem adapted to rank-2 lattices in $\mathbb{R}^3$. We then apply our methods to linear Diop
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Multiple Lattice Packings and Coverings of the Plane with Triangles#1324956
- On the paucity of lattice triangles#677539
- On the paucity of lattice triangles#674340
- Lattice coverings by parallelotopes containing cube vertices#1356908
- There are no Riesz bases of exponentials in balls and triangles#1012612
Record · ID 1356235
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive