Related papers: Lefschetz Fixed Point Theorem and Lattice Points i…
We use linear programming bounds to analyze point sets in the torus with respect to their optimality for problems in discrepancy theory and quasi-Monte Carlo methods. These concepts will be unified by introducing tensor product energies. We…
Extending work of Bielawski-Dancer and Konno, we develop a theory of toric hyperkahler varieties, which involves toric geometry, matroid theory and convex polyhedra. The framework is a detailed study of semi-projective toric varieties,…
The main results of this paper interpret mixed volumes of lattice polytopes as mixed multiplicities of ideals and mixed multiplicities of ideals as Samuel's multiplicities. In particular, we can give a purely algebraic proof of Bernstein's…
The Toda lattice hierarchy with self-consistent sources and their Lax representation are derived. We construct a forward Darboux transformation (FDT) with arbitrary functions of time and a generalized forward Darboux transformation (GFDT)…
For a d-dimensional convex lattice polytope P, a formula for the boundary volume is derived in terms of the number of boundary lattice points on the first $\floor{d/2}$ dilations of P. As an application we give a necessary and sufficient…
We consider quasifuchsian manifolds with "particles", i.e., cone singularities of fixed angle less than $\pi$ going from one connected component of the boundary at infinity to the other. Each connected component of the boundary at infinity…
This dissertation investigates the geometric combinatorics of convex polytopes and connections to the behavior of the simplex method for linear programming. We focus our attention on transportation polytopes, which are sets of all tables of…
The infinitesimal counterpart of a Lie groupoid is its Lie algebroid. As a vector bundle, it is given by the source vertical tangent bundle restricted to the identity bisection. Its sections can be identified with the invariant vector…
We prove a fixed point theorem for a family of Banach spaces, notably L^1 and its non-commutative analogues. Several applications are given, e.g. the optimal solution to the "derivation problem" studied since the 1960s.
A recent result characterizes the fully order reversing operators acting on the class of lower semicontinuous proper convex functions in a real Banach space as certain linear deformations of the Legendre-Fenchel transform. Motivated by the…
In this paper we motivate some new directions of research regarding the lattice width of convex bodies. We show that convex bodies of sufficiently large width contain a unimodular copy of a standard simplex. This implies that every lattice…
For a positive integer $d$, the $d$-dimensional Chebyshev-Frolov lattice is the $\mathbb{Z}$-lattice in $\mathbb{R}^d$ generated by the Vandermonde matrix associated to the roots of the $d$-dimensional Chebyshev polynomial. It is important…
We study numerically the vortex-lattice formation in a rapidly rotating uniform quasi-two-dimensional Bose-Einstein condensate (BEC) in a box trap. We consider two types of boxes: square and circle. In a square-shaped 2D box trap, when the…
The simplest way to generate a lattice of convex sets is to consider an initial set of points and draw segments, triangles, and any convex hull from it, then intersect them to obtain new points, and so forth. The result is an infinite…
We present a fixed point theorem for a class of (potentially) non-monotonic functions over specially structured complete lattices. The theorem has as a special case the Knaster-Tarski fixed point theorem when restricted to the case of…
In 1980, V.I. Arnold studied the classification problem for convex lattice polygons of given area. Since then this problem and its analogues have been studied by B'ar'any, Pach, Vershik, Liu, Zong and others. Upper bounds for the numbers of…
We solve several open problems concerning integer points of polytopes arising in symplectic and algebraic geometry. In this direction we give the first proof of a broad case of Ewald's Conjecture (1988) concerning symmetric integral points…
Pick's theorem is used to prove that if $P$ is a lattice polygon (that is, the convex hull of a finite set of lattice points in the plane), then every lattice point in the $h$-fold sumset $hP$ is the sum of $h$ lattice points in $P$.
By a result of Klyachko the Euler characteristic of moduli spaces of stable bundles of rank two on the projective plane is determined. Using similar methods we extend this result to bundles of rank three. The fixed point components…
This article describes a method to compute successive convex approximations of the convex hull of a set of points in R^n that are the solutions to a system of polynomial equations over the reals. The method relies on sums of squares of…