Related papers: Algebraic polytopes in Normaliz
This article introduces the theory of Veronese polytopes, a broad generalisation of cyclic polytopes. These arise as convex hulls of points on curves with one or more connected components, obtained as the image of the rational normal curve…
Several constructive homological methods based on noncommutative Gr\"obner bases are known to compute free resolutions of associative algebras. In particular, these methods relate the Koszul property for an associative algebra to the…
We consider the complex cut polytope: the convex hull of Hermitian rank 1 matrices $xx^{\mathrm{H}}$, where the elements of $x \in \mathbb{C}^n$ are $m$th unit roots. These polytopes have applications in ${\text{MAX-3-CUT}}$, digital…
We investigate arithmetic, geometric and combinatorial properties of symmetric edge polytopes. We give a complete combinatorial description of their facets. By combining Gr\"obner basis techniques, half-open decompositions and methods for…
Patchworking theorems serve as a basic element of the correspondence between tropical and algebraic curves, which is a core of the tropical enumerative geometry. We present a new version of a patchworking theorem which relates plane…
In this paper we explain the parallelism in the classification of three different kinds of mathematical objects: (i) Classical r-matrices. (ii) Generalized cohomology theories that have Chern classes for complex vector bundles. (iii)…
In this Master of Science Thesis I introduce geometric algebra both from the traditional geometric setting of vector spaces, and also from a more combinatorial view which simplifies common relations and operations. This view enables us to…
Given a polynomial system f, a fundamental question is to determine if f has real roots. Many algorithms involving the use of infinitesimal deformations have been proposed to answer this question. In this article, we transform an approach…
The triangulations of a regular convex polygon are enumerated according to the number of diagonals parallel to a fixed edge. The enumeration uses the Shapiro convolution identity, as well as an interpretation of this identity in terms of…
We describe a new software package for computing multiplier ideals in certain cases, including monomial ideals, monomial curves, generic determinantal ideals, and hyperplane arrangements. In these cases we take advantage of combinatorial…
We describe an algorithm for computing the convex hull of a finite collection of points in the affine building of SL_d(K), for K a field with discrete valuation. These convex hulls describe the relations among a finite collection of…
A new algorithm for computing a point on a polynomial or rational curve in B\'{e}zier form is proposed. The method has a geometric interpretation and uses only convex combinations of control points. The new algorithm's computational…
Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…
A method for converting the geometrical problem of rectangle packing to an algebraic problem of solving a system of polynomial equations is described.
We show that one can enumerate the vertices of the convex hull of integer points in polytopes whose constraint matrices have bounded and nonzero subdeterminants, in time polynomial in the dimension and encoding size of the polytope. This…
The purpose of this note is to give an exposition of some interesting combinatorics and convex geometry concepts that appear in algebraic geometry in relation to counting the number of solutions of a system of polynomial equations in…
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…
We establish some geometric constraints on compact Coxeter polytopes in hyperbolic spaces and show that these constraints can be a very useful tool for the classification problem of reflective anisotropic Lorentzian lattices and cocompact…
Frequent itemsets form a polytope and can be found and analyzed with Linear Programming.
We compare two known methods of extending a complex, unital, commutative normed algebra so as to include solutions to sets of monic polynomials over the original algebra. (One of these is a generalisation of a construction from the thesis…