English
Related papers

Related papers: Problems on Minkowski sums of convex lattice polyt…

200 papers

We generalize an inequality for convex lattice polygons -- aka toric surfaces -- to general rational surfaces.

Algebraic Geometry · Mathematics 2013-06-17 Christian Haase , Josef Schicho

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…

Combinatorics · Mathematics 2026-04-13 Luis Crespo , Álvaro Pelayo , Francisco Santos

We describe our package PALP of C programs for calculations with lattice polytopes and applications to toric geometry, which is freely available on the internet. It contains routines for vertex and facet enumeration, computation of…

Numerical Analysis · Mathematics 2025-10-20 Maximilian Kreuzer , Harald Skarke

We define Q-normal lattice polytopes. Natural examples of such polytopes are Cayley sums of strictly combinatorially equivalent lattice polytopes, which correspond to particularly nice toric fibrations, namely toric projective bundles. In a…

Algebraic Geometry · Mathematics 2009-04-01 Alicia Dickenstein , Sandra Di Rocco , Ragni Piene

Generalizing results by Valette, Zamfirescu and Laczkovich, we will prove that a convex body $K$ is a polytope if there are sufficiently many tilings which contain a tile similar to $K$. Furthermore, we give an example that this can not be…

Metric Geometry · Mathematics 2011-05-17 Karim Adiprasito

Pudl\'ak [Pud17] lists several major conjectures from the field of proof complexity and asks for oracles that separate corresponding relativized conjectures. Among these conjectures are: - $\mathsf{DisjNP}$: The class of all disjoint…

Computational Complexity · Computer Science 2020-01-10 Titus Dose

Let $2\le k\le d-1$ and let $P$ and $Q$ be two convex polytopes in ${\mathbb E^d}$. Assume that their projections, $P|H$, $Q|H$, onto every $k$-dimensional subspace $H$, are congruent. In this paper we show that $P$ and $Q$ or $P$ and $-Q$…

Metric Geometry · Mathematics 2017-09-22 Sergii Myroshnychenko , Dmitry Ryabogin

We show that there exist convex $n$-gons $P$ and $Q$ such that the largest convex polygon in the Minkowski sum $P+Q$ has size $\Theta(n\log n)$. This matches an upper bound of Tiwary.

Combinatorics · Mathematics 2021-06-03 Mateusz Skomra , Stéphan Thomassé

The goal of this paper is to establish certain inequalities between the numbers of convex polytopes in the d-dimensional space "containing" and "avoiding" zero provided that their vertex sets are subsets of a given finite set of points in…

Combinatorics · Mathematics 2013-12-24 Alexander Kelmans , Anatoliy Rubinov

We consider the convex hull $P_{\varphi}(G)$ of all satisfying assignments of a given MSO formula $\varphi$ on a given graph $G$. We show that there exists an extended formulation of the polytope $P_{\varphi}(G)$ that can be described by…

Data Structures and Algorithms · Computer Science 2023-06-22 Petr Kolman , Martin Koutecký , Hans Raj Tiwary

We express the matroid polytope $P_M$ of a matroid $M$ as a signed Minkowski sum of simplices, and obtain a formula for the volume of $P_M$. This gives a combinatorial expression for the degree of an arbitrary torus orbit closure in the…

Combinatorics · Mathematics 2013-01-17 Federico Ardila , Carolina Benedetti , Jeffrey Doker

Let $(X,\omega_0):=(\mathbb{C}/\Lambda,0)$ denote the elliptic curve associated to the lattice $\Lambda$, $X_2:=\{\omega_0,\cdots, \omega_3\}$ its set of half-periods and $\wp:X \to \mathbb{P}^1$ the usual Weierstrass $\wp$ function, with a…

Algebraic Geometry · Mathematics 2025-01-29 Armando Treibich

We study convexity of image of a general multidimensional quadratic map. We split the full image into two parts by an appropriate hyperplane such that one part is compact, and formulate a sufficient condition for convexity of the compact…

Optimization and Control · Mathematics 2018-03-23 Anatoly Dymarsky

A central question in optimization is to maximize (or minimize) a linear function over a given polytope P. To solve such a problem in practice one needs a concise description of the polytope P. In this paper we are interested in…

Optimization and Control · Mathematics 2015-12-31 Hamza Fawzi , James Saunderson , Pablo A. Parrilo

We show the well-posedness of the Poisson and Stokes problems in weighted spaces over nonconvex, Lipschitz polytopes. For a particular range of $p$, we consider those weights in the Muckenhoupt class $A_p$ that have no singularities in a…

Analysis of PDEs · Mathematics 2017-11-27 Enrique Otarola , Abner J. Salgado

For any lattice polytope $P$, we consider an associated polynomial $\bar{\delta}_{P}(t)$ and describe its decomposition into a sum of two polynomials satisfying certain symmetry conditions. As a consequence, we improve upon known…

Combinatorics · Mathematics 2009-09-24 Alan Stapledon

Given CW complexes X and Y, let map(X,Y) denote the space of continuous functions from X to Y with the compact open topology. The space map(X,Y) need not have the homotopy type of a CW complex. Here the results of an extensive investigation…

Algebraic Topology · Mathematics 2007-08-22 Jaka Smrekar

Any homogeneous polynomial $P(x, y, z)$ of degree $d$, being restricted to a unit sphere $S^2$, admits essentially a unique representation of the form $\lambda_0 + \sum_{k = 1}^d \lambda_k [\prod_{j = 1}^k L_{kj}]$, where $L_{kj}$'s are…

Complex Variables · Mathematics 2007-05-23 Gabriel Katz

Let $X_1,\ldots, X_{d+2}$ be random points in $\mathbb R^d$. The classical Sylvester problem asks to determine the probability that the convex hull of these points, denoted by $P:= [X_1,\ldots, X_{d+2}]$, is a simplex. In the present paper,…

Probability · Mathematics 2026-02-03 Zakhar Kabluchko , Hugo Panzo

We review several (and provide new) results on the theory of moments, sums of squares and basic semi-algebraic sets when convexity is present. In particular, we show that under convexity, the hierarchy of semidefinite relaxations for…

Optimization and Control · Mathematics 2008-12-04 Jean B. Lasserre