PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
June 20, 2026Izvestiya Mathematics0 citations

Almost empty simplices and Klein polyhedra

View Full Paper
OGOleg N. GermanАИАндрей Анатольевич Илларионов

Key Points

  • The aim is to determine volume bounds of simplices with certain integer points and to derive an asymptotic formula for the average number of vertices in Klein polyhedra.
  • Defined simplices as structures with integer vertices and specific conditions on interior points.
  • Derived volume bounds based on the location of integer points.
  • Examined the average number of vertices in Klein polyhedra across integer lattices with a fixed determinant.
  • Proved that the volume of a simplex is bounded by a dimension-dependent quantity under specific conditions.
  • Established an asymptotic formula for the average number of vertices in Klein polyhedra for dimensions greater than 2.
  • Demonstrated that without the specific conditions, the volume can be arbitrarily large.

Abstract

Let be an n-simplex in Rⁿ with integer vertices containing exactly one integer point a distinct from its vertices. We prove that if a is contained in the interior of or in the relative interior of a facet of, then the volume of is bounded by a quantity depending only on the dimension n; otherwise, the volume of can be arbitrarily large. This result is applied to derive an asymptotic formula for the average number of vertices of Klein polyhedra. The averaging is taken over the Klein polyhedra of s-dimensional integer lattices of fixed determinant N, where N is a growing parameter. Such a formula was known only for s=2, 3. If is a lattice in Rˢ of rank s, then its Klein polyhedron is defined as the convex hull of non-zero points of contained in a given orthant.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

German et al. (2026) studied this question.

synapsesocial.com/papers/6a3631a1db0793dc1a538779https://doi.org/10.4213/im9683e
Ask AI
Helpful
Bookmark
Share
View Full Paper