相关论文: Adjacency method for extreme Delaunay polytopes

A perfect prismatoid is a convex polytope $P$ such that for every its facet $F$ the set $vert(P) \setminus vert(F)$ belongs to a supporting hyperplane $\alpha \parallel F$. We prove that every perfect prismatoid is affinely equivalent to…

With a view to establishing measure theoretic approximation properties of Delone sets, we study a setup which arises naturally in the problem of averaging almost periodic functions along exponential sequences. In this setting, we establish…

Classical Delaunay surfaces are highly symmetric constant mean curvature (CMC) submanifolds of space forms. We prove the existence of Delaunay-type hypersurfaces in a large class of compact manifolds, using the geometry of cohomogeneity one…

The hamiltonian circuit polytope is the convex hull of feasible solutions for the circuit constraint, which provides a succinct formulation of the traveling salesman and other sequencing problems. We study the polytope by establishing its…

A polynomial homotopy is a family of polynomial systems in one parameter, which defines solution paths starting from known solutions and ending at solutions of a system that has to be solved. We consider paths leading to isolated singular…

For a given lattice, we establish an equivalence involving a closed zone of the corresponding Voronoi polytope, a lamina hyperplane of the corresponding Delaunay partition and a quadratic form of rank 1 being an extreme ray of the…

The hypermetric cone $\HYP_{n+1}$ is the parameter space of basic Delaunay polytopes in n-dimensional lattice. The cone $\HYP_{n+1}$ is polyhedral; one way of seeing this is that modulo image by the covariance map $\HYP_{n+1}$ is a finite…

We consider the convergence rate of the alternating projection method for the nontransversal intersection of a semialgebraic set and a linear subspace. For such an intersection, the convergence rate is known as sublinear in the worst case.…

This article is concerned with the problem of approximating a not necessarily bounded spectrahedral shadow, a certain convex set, by polyhedra. By identifying the set with its homogenization the problem is reduced to the approximation of a…

This paper proposes a new general technique for maximal subgraph enumeration which we call proximity search, whose aim is to design efficient enumeration algorithms for problems that could not be solved by existing frameworks. To support…

We give a necessary and sufficient condition for extremality of a supermodular function based on its min-representation by means of (vertices of) the corresponding core polytope. The condition leads to solving a certain simple linear…

This paper introduces an algebraic combinatorial approach to simplicial cone decompositions, a key step in solving inhomogeneous linear Diophantine systems and counting lattice points in polytopes. We use constant term manipulation on the…

We compute the set of all extreme rays of the 6-party subadditivity cone that are compatible with strong subadditivity. In total, we identify 208 new (genuine 6-party) orbits, 52 of which violate at least one known holographic entropy…

Given two disjoint convex polyhedra, we look for a best approximation pair relative to them, i.e., a pair of points, one in each polyhedron, attaining the minimum distance between the sets. Cheney and Goldstein showed that alternating…

The intersection of an affine subspace with the cone of positive semidefinite matrices is called a spectrahedron. An orthogonal projection thereof is called a spectrahedral shadow or projected spectrahedron. Spectrahedra and their…

We use discrete holomorphic polynomials to prove that, given a refining sequence of critical maps of a Riemann surface, any holomorphic function can be approximated by a converging sequence of discrete holomorphic functions.

We give an inductive procedure for finding the extremal rays of the equivariant Littlewood-Richardson cone, which is closely related to the solution space to S. Friedland's majorized Hermitian eigenvalue problem. In so doing, we solve the…

We give a deterministic nearly-linear time algorithm for approximating any point inside a convex polytope with a sparse convex combination of the polytope's vertices. Our result provides a constructive proof for the Approximate…

An equidistant polytope is a special equidistant set in the space $\mathbb{R}^n$ all of whose boundary points have equal distances from two finite systems of points. Since one of the finite systems of the given points is required to be in…

We study distributed protocols for finding all pairs of similar vectors in a large dataset. Our results pertain to a variety of discrete metrics, and we give concrete instantiations for Hamming distance. In particular, we give improved…