English
Related papers

Related papers: Slicing and dicing polytopes

200 papers

We study approximations of polytopes in the standard model for computing polytopes using Minkowski sums and (convex hulls of) unions. Specifically, we study the ability to approximate a target polytope by polytopes of a given depth. Our…

Metric Geometry · Mathematics 2025-07-11 Egor Bakaev , Florestan Brunck , Amir Yehudayoff

We study multivariate trigonometric polynomials, satisfying a set of constraints close to the known Strung-Fix conditions. Based on the polyphase representation of these polynomials relative to a general dilation matrix, we develop a simple…

Functional Analysis · Mathematics 2009-07-27 Nira Dyn , Maria Skopina

A split of a polytope $P$ is a (regular) subdivision with exactly two maximal cells. It turns out that each weight function on the vertices of $P$ admits a unique decomposition as a linear combination of weight functions corresponding to…

Combinatorics · Mathematics 2008-07-02 Sven Herrmann , Michael Joswig

Using discrete Morse theory, we give an algorithm that prunes the excess of information in the Taylor resolution and constructs a new cellular free resolution for an arbitrary monomial ideal. The pruned resolution is not simplicial in…

Commutative Algebra · Mathematics 2019-10-01 Josep Àlvarez Montaner , Oscar Fernández-Ramos , Philippe Gimenez

We present an algorithm which produces a decomposition of a regular cellular complex with a discrete Morse function analogous to the Morse-Smale decomposition of a smooth manifold with respect to a smooth Morse function. The advantage of…

Algebraic Topology · Mathematics 2008-12-09 Gregor Jerse , Neza Mramor Kosta

We show that lattice polytopes cut out by root systems of classical type are normal and Koszul, generalizing a well-known result of Bruns, Gubeladze, and Trung in type A. We prove similar results for Cayley sums of collections of polytopes…

Combinatorics · Mathematics 2008-12-07 Sam Payne

Forman introduced discrete Morse theory as a tool for studying CW complexes by essentially collapsing them onto smaller, simpler-to-understand complexes of critical cells in [Fo]. Chari reformulated discrete Morse theory for regular cell…

Combinatorics · Mathematics 2018-08-24 Patricia Hersh

We establish a new notion of tropical convexity for signed tropical numbers. We provide several equivalent descriptions involving balance relations and intersections of open halfspaces as well as the image of a union of polytopes over…

Optimization and Control · Mathematics 2019-10-03 Georg Loho , László A. Végh

Minkowski sums are of theoretical interest and have applications in fields related to industrial backgrounds. In this paper we focus on the specific case of summing polytopes as we want to solve the tolerance analysis problem described in…

Computational Geometry · Computer Science 2015-06-17 Vincent Delos , Denis Teissandier

This paper is a continuation of our previous work in which we defined the notion of a polytope complex and its $K$-theory. In this paper we produce formulas for the delooping of a simplicial polytope complex and the cofiber of a morphism of…

Algebraic Topology · Mathematics 2011-02-22 Inna Zakharevich

The purpose of this work is to develop a version of Forman's discrete Morse theory for simplicial complexes, based on internal strong collapses. Classical discrete Morse theory can be viewed as a generalization of Whitehead's collapses,…

Algebraic Topology · Mathematics 2025-06-24 Ximena L. Fernández

We develop a version of discrete Morse theory for finite regular CW complexes equipped with an auxiliary stratification. The key construction is the halo of a cell, which contains all those faces in the boundary that enter closed…

Algebraic Topology · Mathematics 2026-01-27 Vidit Nanda , Francesca Tombari

Signed Minkowski decomposition is an expression of a polytope as a Minkowski sum and difference of smaller polytopes. Signed Minkowski decompositions of a polytope can be interpreted as factorizations of a max-plus (tropical) function. We…

Combinatorics · Mathematics 2025-06-27 Soujun Kitagawa

In this note we prove convexity, in the sense of Colding-Naber, of the regular set of solutions to some complex Monge-Ampere equations with conical singularities along simple normal crossing divisors. In particular, any two points in the…

Differential Geometry · Mathematics 2014-07-07 Ved V. Datar

A triangulation of a polytope into simplices is refined recursively. In every refinement round, some simplices which have been marked by an external algorithm are bisected and some others around also must be bisected to retain regularity of…

Numerical Analysis · Mathematics 2023-05-09 Lukas Gehring

We investigate the structure of the Minkowski sum of standard simplices in ${\reals}^r$. In particular, we investigate the one-dimensional structure, the vertices, their degrees and the edges in the Minkowski sum polytope.

Combinatorics · Mathematics 2007-05-23 Geir Agnarsson , Walter Morris

We introduce a generalization of tropical polyhedra able to express both strict and non-strict inequalities. Such inequalities are handled by means of a semiring of germs (encoding infinitesimal perturbations). We develop a tropical…

Combinatorics · Mathematics 2015-01-05 Xavier Allamigeon , Uli Fahrenberg , Stéphane Gaubert , Ricardo D. Katz , Axel Legay

The main purpose of this paper is to prove some density results of polynomials in Fock spaces of slice regular functions. The spaces can be of two different kinds since they are equipped with different inner products and contain different…

Complex Variables · Mathematics 2018-12-10 Kamal Diki , Sorin G. Gal , Irene Sabadini

There are many connections between the invariants of the different powers of an ideal. We investigate how to construct minimal resolutions for all powers at once using methods from algebraic and polyhedral topology with a focus on ideals…

Commutative Algebra · Mathematics 2013-11-19 Alexander Engstrom , Patrik Noren

We derive tight expressions for the maximum number of $k$-faces, $0\le{}k\le{}d-1$, of the Minkowski sum, $P_1+...+P_r$, of $r$ convex $d$-polytopes $P_1,...,P_r$ in $\mathbb{R}^d$, where $d\ge{}2$ and $r<d$, as a (recursively defined)…

Computational Geometry · Computer Science 2015-03-03 Menelaos I. Karavelas , Eleni Tzanaki
‹ Prev 1 2 3 10 Next ›