Related papers: Algebraic polytopes in Normaliz
Motivated by the analysis of the performance of the simplex method we study the behavior of families of pivot rules of linear programs. We introduce normalized-weight pivot rules which are fundamental for the following reasons: First, they…
In this work, we introduce a semi-algebraic model for automatic parallelization of perfectly nested polynomial loops, which generalizes the classical polyhedral model. This model supports the basic tasks for automatic loop parallelization,…
Polypolyhedra are edge-transitive compounds of polyhedra. In this paper we use group theory to determine the number of distinct polypolyhedra whose symmetry group is any given finite irreducible Coxeter group. We apply this result in order…
We generalize Ehrhart's idea of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n+1 rational vertices, we use its description as the intersection of n+1 halfspaces,…
We determine the extreme points and facets of the convex hull of all dual degree partitions of simple graphs on $n$ vertices.
We present the $\textit{NumericalImplicitization}$ package for $\textit{Macaulay2}$, which allows for user-friendly computation of the invariants of the image of a polynomial map, such as dimension, degree, and Hilbert function values. This…
For two families of random polytopes we compute explicitly the expected sums of the conic intrinsic volumes and the Grassmann angles at all faces of any given dimension of the polytope under consideration. As special cases, we compute the…
We construct a convergent family of outer approximations for the problem of optimizing polynomial functions over convex bodies subject to polynomial constraints. This is achieved by generalizing the polarization hierarchy, which has…
Enumerative algebraic geometry deals with problems of counting geometric objects defined algebraically, An important class of enumerative problems is that of counting curves: given a class of curves in some projective variety defined by…
Using some new logarithmic formal calculus, we construct a well known vertex algebra, obtaining the Jacobi identity directly, in an essentially self-contained treatment.
In this paper I present a kind of proof for classical Euclidean geometric problems which relies on both synthetic and analytic geometry. Using the elementary tools of polynomial algebra and multivariate calculus we manage to reduce the…
It is well known that finite-dimensional polyhedral convex sets can be generated by finitely many points and finitely many directions. Representation formulas in this spirit are obtained for convex polyhedra and generalized convex polyhedra…
We represent vector bundles over a regular algebraic curve as pairs of lattices over the maximal orders of its function field and we give polynomial time algorithms for several tasks: computing determinants of vector bundles, kernels and…
Bounding hull, such as convex hull, concave hull, alpha shapes etc. has vast applications in different areas especially in computational geometry. Alpha shape and concave hull are generalizations of convex hull. Unlike the convex hull, they…
The paper establishes a formula for enumeration of curves of arbitrary genus in toric surfaces. It turns out that such curves can be counted by means of certain lattice paths in the Newton polygon. The formula was announced earlier in…
We give a short introduction to generalized vertex algebras, using the notion of polylocal fields. We construct a generalized vertex algebra associated to a vector space h with a symmetric bilinear form. It contains as subalgebras all…
We discuss the noncommutative generalizations of polynomial algebras which after appropriate completions can be used as coordinate algebras in various noncommutative settings, (noncommutative differential geometry, noncommutative algebraic…
Hilbert space frames generalize orthonormal bases to allow redundancy in representations of vectors while keeping good reconstruction properties. A frame comes with an associated frame operator encoding essential properties of the frame. We…
We introduce a class of iterated integrals, defined through a set of linearly independent integration kernels on elliptic curves. As a direct generalisation of multiple polylogarithms, we construct our set of integration kernels ensuring…
Describing the geometry of the dual amplituhedron without reference to a particular triangulation is an open problem. In this note we introduce a new way of determining the volume of the tree-level NMHV dual amplituhedron. We show that…