Related papers: Algebraic polytopes in Normaliz
We introduce a novel intrinsic volume concept in tropical geometry. This is achieved by developing the foundations of a tropical analog of lattice point counting in polytopes. We exhibit the basic properties and compare it to existing…
A well known result by Lagarias and Ziegler states that there are finitely many equivalence classes of d-dimensional lattice polytopes having volume at most K, for fixed constants d and K. We describe an algorithm for the complete…
The aim of this paper is to study alcoved polytopes, which are polytopes arising from affine Coxeter arrangements. This class of convex polytopes includes many classical polytopes, for example, the hypersimplices. We compare two…
Triangular decomposition is one of the standard ways to represent the radical of a polynomial ideal. A general algorithm for computing such a decomposition was proposed by A. Szanto. In this paper, we give the first complete bounds for the…
This is a survey of known algorithms in algebraic topology with a focus on finite simplicial complexes and, in particular, simplicial manifolds. Wherever possible an elementary approach is chosen. This way the text may also serve as a…
Various notions of joint majorization are examined in continuous matrix algebras. The relative strengths of these notions are established via proofs and examples. In addition, the closed convex hulls of joint unitary orbits are completely…
Let $G$ be a finite graph allowing loops, having no multiple edge and no isolated vertex. We associate $G$ with the edge polytope ${\cal P}_G$ and the toric ideal $I_G$. By classifying graphs whose edge polytope is simple, it is proved that…
This paper surveys and illustrates geometric methods for constructing normal bases allowing efficient finite field arithmetic. These bases are constructed using the additive group, the multiplicative group and the Lucas torus. We describe…
This article concerns the computational problem of counting the lattice points inside convex polytopes, when each point must be counted with a weight associated to it. We describe an efficient algorithm for computing the highest degree…
Bisztriczky defines a multiplex as a generalization of a simplex, and an ordinary polytope as a generalization of a cyclic polytope. This paper presents results concerning the combinatorics of multiplexes and ordinary polytopes. The flag…
In 2012 Gubeladze (Adv.\ Math.\ 2012) introduced the notion of k-convex-normal polytopes to show that integral polytopes all of whose edges are longer than 4d(d+1) have the integer decomposition property. In the first part of this paper we…
We construct compact polyhedra with triangular faces whose links are generalized 3-gons. They are interesting compact spaces covered by Euclidean buildings of type $A_2$. Those spaces give us two-dimensional subshifts, which can be used to…
We present an explicit closed-form formula for the vertices of the classical cut polytope $\operatorname{CUT}(n)$, defined as the convex hull of cut vectors of the complete graph $K_n$. Our derivation proceeds via a related polytope,…
A standard assumption in the study of logarithmic structures is "fineness", but this assumption is not preserved by intersections, fiber products, and more general limits. We explain how a coherent logarithmic scheme $X$ has a natural…
We prove that the cohomology algebra of elliptic arrangements depends only on the poset of layers. In the particular case of braid elliptic arrangements, we study the cohomology as representation and we compute some Hodge numbers. Finally,…
The survey is devoted to algebraic structures related to integrable ODEs and evolution PDEs. A description of Lax representations is given in terms of vector space decomposition of loop algebras into a direct sum of Taylor series and a…
The geometry of the dual amplituhedron is generally described in reference to a particular triangulation. A given triangulation manifests only certain aspects of the underlying space while obscuring others, therefore understanding this…
Marginal polytopes are important geometric objects that arise in statistics as the polytopes underlying hierarchical log-linear models. These polytopes can be used to answer geometric questions about these models, such as determining the…
The construction of superintegrable systems based on Lie algebras and their universal enveloping algebras has been widely studied over the past decades. However, most constructions rely on explicit differential operator realisations and…
Cycle polytopes of matroids have been introduced in combinatorial optimization as a generalization of important classes of polyhedral objects like cut polytopes and Eulerian subgraph polytopes associated to graphs. Here we start an…