Related papers: Signed Simplicial Decomposition and Overlay of n-D…
We describe a recursive algorithm that decomposes an algebraic set into locally closed equidimensional sets, i.e. sets which each have irreducible components of the same dimension. At the core of this algorithm, we combine ideas from the…
A sum-of-squares is a polynomial that can be expressed as a sum of squares of other polynomials. Determining if a sum-of-squares decomposition exists for a given polynomial is equivalent to a linear matrix inequality feasibility problem.…
A popular method in combinatorial optimization is to express polytopes P, which may potentially have exponentially many facets, as solutions of linear programs that use few extra variables to reduce the number of constraints down to a…
We focus on two central themes in this dissertation. The first one is on decomposing polytopes and polynomials in ways that allow us to perform nonlinear optimization. We start off by explaining important results on decomposing a polytope…
Approximating convex bodies succinctly by convex polytopes is a fundamental problem in discrete geometry. A convex body $K$ of diameter $\mathrm{diam}(K)$ is given in Euclidean $d$-dimensional space, where $d$ is a constant. Given an error…
In this paper we introduce the notion of a $d$-dimensional cycle which is a homological generalization of the idea of a graph cycle to higher dimensions. We examine both the combinatorial and homological properties of this structure and use…
There are many different algebraic, geometric and combinatorial objects that one can attach to a complex polynomial with distinct roots. In this article we introduce a new object that encodes many of the existing objects that have…
In the field of mathematics, a purely combinatorial equivalent to a simplicial complex, or more generally, a down-set, is an abstract structure known as a family of sets. This family is closed under the operation of taking subsets, meaning…
Recently $C^m$-conforming finite elements on simplexes in arbitrary dimension are constructed by Hu, Lin and Wu. The key in the construction is a non-overlapping decomposition of the simplicial lattice in which each component will be used…
A polytopal digraph $G(P)$ is an orientation of the skeleton of a convex polytope $P$. The possible non-degenerate pivot operations of the simplex method in solving a linear program over $P$ can be represented as a special polytopal digraph…
By a numerical continuation method called a diagonal homotopy we can compute the intersection of two positive dimensional solution sets of polynomial systems. This paper proposes to use this diagonal homotopy as the key step in a procedure…
Decomposition of shapes into (approximate) convex parts is essential for applications such as part-based shape representation, shape matching, and collision detection. In this paper, we propose a novel convex decomposition using a…
A simplicial complex is a set equipped with a down-closed family of distinguished finite subsets. This structure, usually viewed as codifying a triangulated space, is used here directly, to describe "spaces" whose geometric realisation can…
A cubical polytope is a polytope with all its facets being combinatorially equivalent to cubes. The paper is concerned with the linkedness of the graphs of cubical polytopes. A graph with at least $2k$ vertices is $k$-linked if, for every…
The matching complex of a simple graph $G$ is a simplicial complex consisting of the matchings on $G$. Jeli\'c Milutinovi\'c et al. studied the matching complexes of the polygonal line tilings, and they gave a lower bound for the…
We present a simple sublinear time algorithm for testing the following geometric property. Let $P_1, ..., P_n$ be $n$ convex sets in $\mathbb{R}^d$ ($n \gg d$), such as polytopes, balls, etc. We assume that the complexity of each set…
Given an $n$-gon, the poset of all collections of pairwise non-crossing diagonals is isomorphic to the face poset of some convex polytope called \textit{associahedron}. We replace in this setting the $n$-gon (viewed as a disc with $n$…
The polymake software system deals with convex polytopes and related objects from geometric combinatorics. This note reports on a new implementation of a subclass for lattice polytopes. The features displayed are enabled by recent changes…
Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral…
Simplicial complexes are higher-order combinatorial structures which have been used to represent real-world complex systems. In this paper, we concentrate on the local patterns in simplicial complexes called simplets, a generalization of…