Maximal Dimension of Unit Simplices
نویسندگان
چکیده
Abstract. For an arbitrary field F the maximal number ω(Fn) of points in Fn mutually distance 1 apart with respect to the standard inner product is investigated. If the characteristic char(F) is different from 2, then the values of ω(Fn) lie between n − 1 and n + 2. In particular, we answer completely for which n a simplex of q points with edge length 1 can be embedded in rational n-space. Our results imply for almost all even n that ω(Qn) = n and for almost all odd n that ω(Qn) = n− 1.
منابع مشابه
Maximal integral simplices with no interior integer points
In this paper, we consider integral maximal lattice-free simplices. Such simplices have integer vertices and contain integer points in the relative interior of each of their facets, but no integer point is allowed in the full interior. In dimension three, we show that any integral maximal latticefree simplex is equivalent to one of seven simplices up to unimodular transformation. For higher dim...
متن کاملVolume and Lattice Points of Reflexive Simplices
Using new number-theoretic bounds on the denominators of unit fractions summing up to one, we show that in any dimension d ≥ 4 there is only one d-dimensional reflexive simplex having maximal volume. Moreover, only these reflexive simplices can admit an edge that has the maximal number of lattice points possible for an edge of a reflexive simplex. In general, these simplices are also expected t...
متن کاملOn the Maximal Width of Empty Lattice Simplices
A k-dimensional lattice simplex σ ⊆ Rd is the convex hull of k + 1 affinely independent integer points. General lattice polytopes are obtained by taking convex hulls of arbitrary finite subsets of Zd . A lattice simplex or polytope is called empty if it intersects the lattice Zd only at its vertices. (Such polytopes are studied also under the names elementary and latticefree.) In dimensions d >...
متن کاملEnumerating Triangulations for Products of Two Simplices and for Arbitrary Configurations of Points
We propose algorithms to enumerate (1) classes of regular triangulations in respect of symmetry for products of two simplices and (2) all triangulations, regular or not, for arbitrary con gurations of points. There are many results for triangulations in two dimension, but little is known for higher dimensions. Both objects we enumerate in this paper are for general dimensions. Products of two s...
متن کاملNoncrossing partitions and the shard intersection order
We define a new lattice structure (W, ) on the elements of a finite Coxeter group W. This lattice, called the shard intersection order, is weaker than the weak order and has the noncrossing partition lattice NC(W ) as a sublattice. The new construction of NC(W ) yields a new proof that NC(W ) is a lattice. The shard intersection order is graded and its rank generating function is the W -Euleria...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete & Computational Geometry
دوره 34 شماره
صفحات -
تاریخ انتشار 2005