Related papers: PALP: A Package for Analyzing Lattice Polytopes wi…
In our paper, we consider the following general problems: check feasibility, count the number of feasible solutions, find an optimal solution, and count the number of optimal solutions in $P \cap Z^n$, assuming that $P$ is a polyhedron,…
In this paper we propose a method that uses Lagrange multipliers and numerical algebraic geometry to find all critical points, and therefore globally solve, polynomial optimization problems. We design a polyhedral homotopy algorithm that…
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 many authors, including $\mathrm{B\acute{a}r\acute{a}ny}$, Lagarias, Pach,…
We demonstrate the use of a new algorithm called the Flat Histogram sampling algorithm for the simulation of lattice polymer systems. Thermodynamics properties, such as average energy or entropy and other physical quantities such as…
We present a novel relaxation framework for general mixed-integer nonlinear programming (MINLP) grounded in computational geometry. Our approach constructs polyhedral relaxations by convexifying finite sets of strategically chosen points,…
We propose to take a look at a new approach to the study of integral polyhedra. The main idea is to give an integral representation, or matrix model representation, for the key combinatorial characteristics of integral polytopes. Based on…
The goal of this paper is to design a simplex algorithm for linear programs on lattice polytopes that traces `short' simplex paths from any given vertex to an optimal one. We consider a lattice polytope $P$ contained in $[0,k]^n$ and…
Numerical algebraic geometry provides a number of efficient tools for approximating the solutions of polynomial systems. One such tool is the parameter homotopy, which can be an extremely efficient method to solve numerous polynomial…
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…
Two lattice points are visible to one another if there exist no other lattice points on the line segment connecting them. In this paper we study convex lattice polygons that contain a lattice point such that all other lattice points in the…
Let $\cp:=(P_1,...,P_s)$ be a given family of $n$-variate polynomials with integer coefficients and suppose that the degrees and logarithmic heights of these polynomials are bounded by $d$ and $h$, respectively. Suppose furthermore that for…
Characteristic imsets are 0/1-vectors representing directed acyclic graphs whose edges represent direct cause-effect relations between jointly distributed random variables. A characteristic imset (CIM) polytope is the convex hull of a…
Counting integer points in large convex bodies with smooth boundaries containing isolated flat points is oftentimes an intermediate case between balls (or convex bodies with smooth boundaries having everywhere positive curvature) and cubes…
A method for the analytical evaluation of layer potentials arising in the collocation boundary element method for the Laplace and Helmholtz equation is developed for piecewise flat boundary elements with polynomial shape functions. The…
Numerical data structures for positive dimensional solution sets of polynomial systems are sets of generic points cut out by random planes of complimentary dimension. We may represent the linear spaces defined by those planes either by…
We introduce reflexive polytopes of index l as a natural generalisation of the notion of a reflexive polytope of index 1. These l-reflexive polytopes also appear as dual pairs. In dimension two we show that they arise from reflexive…
This study presents a novel algorithm for identifying the set of extreme points that constitute the exact convex hull of a point set in high-dimensional Euclidean space. The proposed method iteratively solves a sequence of dynamically…
The local search framework for obtaining PTASs for NP-hard geometric optimization problems was introduced, independently, by Chan and Har-Peled (2009) and Mustafa and Ray (2010). In this paper, we generalize the framework by extending its…
Convexity, though extremely important in mathematical programming, has not drawn enough attention in the field of dynamic programming. This paper gives conditions for verifying convexity of the cost-to-go functions, and introduces an…
We construct locally defined symplectic torus actions on ribbon graph complexes. Symplectic reduction techniques allow for a recursive formula for the symplectic volumes of these spaces. Taking the Laplace transform results in the…