Weighted projective spaces and reflexive simplices

 We derive a classification algorithm for reflexive simplices in arbitrary fixed dimension. It is based on the assignment of a weight Q ? ℕ ⁿ⁺¹ to an integral n-simplex, the construction, up to an isomorphism, of all simplices with given weight Q, and the characterization in terms of the weight as to when a simplex with reduced weight is reflexive. This also yields a convex-geometric reproof of the characterization in terms of weights for weighted projective spaces to have at most Gorenstein singularities. Received: 30 March 1999 / Revised version: 18 October 2001     

Largest integral simplices with one interior integral point: Solution of Hensley's conjecture and related results

For each dimension d, d-dimensional integral simplices with exactly one interior integral point have bounded volume. This was first shown by Hensley. Explicit volume bounds were determined by Hensley, Lagarias and Ziegler, Pikhurko, and Averkov. In this paper we determine the exact upper volume bound for such simplices and characterize the volume-maximizing simplices. We also determine the sharp upper bound on the coefficient of asymmetry of an integral polytope with a single interior integral point. This result confirms a conjecture of Hensley from 1983. Moreover, for an integral simplex with precisely one interior integral point, we give bounds on the volumes of its faces, the barycentric coordinates of the interior integral point and its number of integral points. Furthermore, we prove a bound on the lattice diameter of integral polytopes with a fixed number of interior integral points. The presented results have applications in toric geometry and in integer optimization.     

Delaunay configurations and multivariate splines: A generalization of a result of B. N. Delaunay

In the 1920s, B. N. Delaunay proved that the dual graph of the Voronoi diagram of a discrete set of points in a Euclidean space gives rise to a collection of simplices, whose circumspheres contain no points from this set in their interior. Such Delaunay simplices tessellate the convex hull of these points. An equivalent formulation of this property is that the characteristic functions of the Delaunay simplices form a partition of unity. In the paper this result is generalized to the so-called Delaunay configurations. These are defined by considering all simplices for which the interiors of their circumspheres contain a fixed number of points from the given set, in contrast to the Delaunay simplices, whose circumspheres are empty. It is proved that every family of Delaunay configurations generates a partition of unity, formed by the so-called simplex splines. These are compactly supported piecewise polynomial functions which are multivariate analogs of the well-known univariate B-splines. It is also shown that the linear span of the simplex splines contains all algebraic polynomials of degree not exceeding the degree of the splines.

     

h-Vectors of Gorenstein polytopes

We show that the Ehrhart h-vector of an integer Gorenstein polytope with a regular unimodular triangulation satisfies McMullen's g-theorem; in particular, it is unimodal. This result generalizes a recent theorem of Athanasiadis (conjectured by Stanley) for compressed polytopes. It is derived from a more general theorem on Gorenstein affine normal monoids M: one can factor K[M] (K a field) by a “long” regular sequence in such a way that the quotient is still a normal affine monoid algebra. This technique reduces all questions about the Ehrhart h-vector of P to the Ehrhart h-vector of a Gorenstein polytope Q with exactly one interior lattice point, provided each lattice point in a multiple cP, c∈N, can be written as the sum of c lattice points in P. (Up to a translation, the polytope Q belongs to the class of reflexive polytopes considered in connection with mirror symmetry.) If P has a regular unimodular triangulation, then it follows readily that the Ehrhart h-vector of P coincides with the combinatorial h-vector of the boundary complex of a simplicial polytope, and the g-theorem applies.     

An Arbitrary Starting Variable Dimension Algorithm for Computing an Integer Point of a Simplex

An arbitrary starting variable dimension algorithm is proposed to compute an integer point of an n-dimensional simplex. It is based on an integer labeling rule and a triangulation of Rⁿ. The algorithm consists of two interchanging phases. The first phase of the algorithm is a variable dimension algorithm, which generates simplices of varying dimensions,and the second phase of the algorithm forms a full-dimensional pivoting procedure, which generates n-dimensional simplices. The algorithm varies from one phase to the other. When the matrix defining the simplex is in the so-called canonical form, starting at an arbitrary integer point, the algorithm within a finite number of iterations either yields an integer point of the simplex or proves that no such point exists.     

一类涉及两个单形的三角不等式及其应用

应用解析方法和几何不等式理论研究了n维欧氏空间En中涉及两个n维单形的几何不等式问题,建立了涉及两个单形的一类三角不等式.作为其应用,获得了涉及两个单形及其内点的几何不等式,特别,获得了n维单形与其垂足单形的体积的一类关系式,改进了关于垂足单形体积的几类几何不等式.     

Lattice triangulations of $\mathbb{E}^3 $ and of the 3-torus

This paper gives answers to a few questions concerning tilings of Euclidean spaces where the tiles are topological simplices with curvilinear edges. We investigate lattice triangulations of Euclidean 3-space in the sense that the vertices form a lattice of rank 3 and such that the triangulation is invariant under all translations of that lattice. This is the dual concept of a primitive lattice tiling where the tiles are not assumed to be Euclidean polyhedra but only topological polyhedra. In 3-space there is a unique standard lattice triangulation by Euclidean tetrahedra (and with straight edges) but there are infinitely many non-standard lattice triangulations where the tetrahedra necessarily have certain curvilinear edges. From the view-point of Discrete Differential Geometry this tells us that there are such triangulations of 3-space which do not carry any flat discrete metric which is equivariant under the lattice. Furthermore, we investigate lattice triangulations of the 3-dimensional torus as quotients by a sublattice. The standard triangulation admits such quotients with any number n ≥ 15 of vertices. The unique one with 15 vertices is neighborly, i.e., any two vertices are joined by an edge. It turns out that for any odd n ≥ 17 there is an n-vertex neighborly triangulation of the 3-torus as a quotient of a certain non-standard lattice triangulation. Combinatorially, one can obtain these neighborly 3-tori as slight modifications of the boundary complexes of the cyclic 4-polytopes. As a kind of combinatorial surgery, this is an interesting construction by itself.     

On the Width of Lattice-Free simplices

We consider lattice-free simplices, simplices with vertices on the lattice Z in R and no other integral points; we show, by elementary methods, that there exist such simplices in dimension d with width (see Definition 2) going to infinity with d.     

Ehrhart Series,Unimodality, and Integrally Closed Reflexive Polytopes

An interesting open problem in Ehrhart theory is to classify those lattice polytopes having a unimodal h*-vector. Although various sufficient conditions have been found, necessary conditions remain a challenge. In this paper, we consider integrally closed reflexive simplices and discuss an operation that preserves reflexivity, integral closure, and unimodality of the h*-vector, providing one explanation for why unimodality occurs in this setting. We also discuss the failure of proving unimodality in this setting using weak Lefschetz elements.     

Finite Gorenstein representation type implies simple singularity

Let R be a commutative noetherian local ring and consider the set of isomorphism classes of indecomposable totally reflexive R-modules. We prove that if this set is finite, then either it has exactly one element, represented by the rank 1 free module, or R is Gorenstein and an isolated singularity (if R is complete, then it is even a simple hypersurface singularity). The crux of our proof is to argue that if the residue field has a totally reflexive cover, then R is Gorenstein or every totally reflexive R-module is free.     

A new class of Kadison-Singer algebras

We show that the projection lattice generated by a maximal nest and a rank one projection in a separable infinite-dimensional Hilbert space is in general reflexive. Moreover we show that the corresponding reflexive algebra has a maximal triangular property, equivalently, it is a Kadison-Singer algebra. Similar results are also obtained for the lattice generated by a finite nest and a projection in a finite factor.     

Notes on the Roots of Ehrhart Polynomials

We determine lattice polytopes of smallest volume with a given number of interior lattice points. We show that the Ehrhart polynomials of those with one interior lattice point have largest roots with norm of order n², where n is the dimension. This improves on the previously best known bound n and complements a recent result of Braun where it is shown that the norm of a root of a Ehrhart polynomial is at most of order n². For the class of 0-symmetric lattice polytopes we present a conjecture on the smallest volume for a given number of interior lattice points and prove the conjecture for crosspolytopes. We further give a characterisation of the roots of Ehrhart polyomials in the three-dimensional case and we classify for n ≤ 4 all lattice polytopes whose roots of their Ehrhart polynomials have all real part -1/2. These polytopes belong to the class of reflexive polytopes.     

Lattice Points Inside Rational Simplices and the Casson Invariant of Brieskorn Spheres

We express the number of lattice points inside certain simplices with vertices in Q³ or Q⁴ in terms of Dedekind–Rademacher sums. This leads to an elementary proof of a formula relating the Euler characteristic of the Seiberg–Witten-Floer homology of a Brieskorn Z-homology sphere to the Casson invariant.     

On some maximal non-selfadjoint operator algebras

We show that the reflexive algebra given by the lattice generated by a maximal nest and a rank one projection is maximal with respect to its diagonal.     

Orthocentric simplices and their centers

A simplex is said to be orthocentric if its altitudes intersect in a common point, called its orthocenter. In this paper it is proved that if any two of the traditional centers of an orthocentric simplex (in any dimension) coincide, then the simplex is regular. Along the way orthocentric simplices in which all facets have the same circumradius are characterized, and the possible barycentric coordinates of the orthocenter are described precisely. In particular these barycentric coordinates are used to parametrize the shapes of orthocentric simplices. The substantial, but widespread, literature on orthocentric simplices is briefly surveyed in order to place the new results in their proper context, and some of the previously known results are given with new proofs from the present perspective.     

Generalized divisors on Gorenstein schemes

We develop a theory of generalized divisors on a Gorenstein scheme whereby any closed subscheme of pure codimension one without embedded points can be regarded as an effective divisor. Most of the usual theory of linear equivalence, associated sheaf, etc., carries over to this more general setting. The definition uses reflexive sheaves, so we first review the theory of reflexive modules. As an application, we give new definitions of liaison and biliaison for subschemes of ⁿ , which simplify the foundations of the theory of liaison. We also compute explicitly the set of generalized divisor classes on some reducible and singular schemes.     

Simplicial Lipschitz optimization without the Lipschitz constant

In this paper we propose a new simplicial partition-based deterministic algorithm for global optimization of Lipschitz-continuous functions without requiring any knowledge of the Lipschitz constant. Our algorithm is motivated by the well-known Direct algorithm which evaluates the objective function on a set of points that tries to cover the most promising subregions of the feasible region. Almost all previous modifications of Direct algorithm use hyper-rectangular partitions. However, other types of partitions may be more suitable for some optimization problems. Simplicial partitions may be preferable when the initial feasible region is either already a simplex or may be covered by one or a manageable number of simplices. Therefore in this paper we propose and investigate simplicial versions of the partition-based algorithm. In the case of simplicial partitions, definition of potentially optimal subregion cannot be the same as in the rectangular version. In this paper we propose and investigate two definitions of potentially optimal simplices: one involves function values at the vertices of the simplex and another uses function value at the centroid of the simplex. We use experimental investigation to compare performance of the algorithms with different definitions of potentially optimal partitions. The experimental investigation shows, that proposed simplicial algorithm gives very competitive results to Direct algorithm using standard test problems and performs particularly well when the search space and the numbers of local and global optimizers may be reduced by taking into account symmetries of the objective function.     

完全分配格代数中秩一子代数的弱稠密性和套代数的一个特征

如果　Ａ是　Ｈｉｌｂｅｒｔ　空间上的完全分配格代数，　　那么Ａ中秩一算子生成的子代数在　Ａ中弱稠密，　当且仅当，Ａ在迹尖算子空间中的一次和二次预零化子的弱闭包是自反的；如果Ａ是套代数，那么ＬａｔＡ是极大套，当且仅当，Ａ的包含Ａ－的每个弱闭子空间是自反的，其中     

The On-Line Heilbronn's Triangle Problem in d Dimensions

In this paper we show a lower bound for the on-line version of Heilbronn's triangle problem in d dimensions. Specifically, we provide an incremental construction for positioning n points in the d-dimensional unit cube, for which every simplex defined by d + 1 of these points has volume Ω(1/n^{(d+1)ln(d-2)-0.265 d+2.269}) (for d ≥ 5).