Related papers: Polyhedral Geometry in OSCAR
Computing mixed volume of convex polytopes is an important problem in computational algebraic geometry. This paper establishes sufficient conditions under which the mixed volume of several convex polytopes exactly equals the normalized…
The real number system is geometrically extended to include three new anticommuting square roots of plus one, each such root representing the direction of a unit vector along the orthonormal coordinate axes of Euclidean 3-space. The…
We present a geometric algorithm to compute the geometric kernel of a generic polyhedron. The geometric kernel (or simply kernel) is definedas the set of points from which the whole polyhedron is visible. Whilst the computation of the…
The arithmetic of elliptic curves, namely polynomial addition and scalar multiplication, can be described in terms of global sections of line bundles on $E\times E$ and $E$, respectively, with respect to a given projective embedding of $E$…
This paper focuses on polynomial dynamical systems over finite fields. These systems appear in a variety of contexts, in computer science, engineering, and computational biology, for instance as models of intracellular biochemical networks.…
Convex polyhedra are the basis for several abstractions used in static analysis and computer-aided verification of complex and sometimes mission critical systems. For such applications, the identification of an appropriate…
We present an improved algorithm for {\em quasi-properly} learning convex polyhedra in the realizable PAC setting from data with a margin. Our learning algorithm constructs a consistent polyhedron as an intersection of about $t \log t$…
Finding a common factor of two multivariate polynomials with approximate coefficients is a problem in symbolic-numeric computing. Taking a tropical view on this problem leads to efficient preprocessing techniques, applying polyhedral…
Polyadic systems and their representations are reviewed and a classification of general polyadic systems is presented. A new multiplace generalization of associativity preserving homomorphisms, a 'heteromorphism' which connects polyadic…
Quantum advantage in computation refers to the existence of computational tasks that can be performed efficiently on a quantum computer but cannot be efficiently simulated on any classical computer. Identifying the precise boundary of…
This is the first paper in a series of eight where in the first three we develop a systematic approach to the geometric algebras of multivectors and extensors, followed by five papers where those algebraic concepts are used in a novel…
We propose to take a look at a new approach to the study of integral polyhedra. The main idea is to give an integral representation, or matrix model representation, for the key combinatorial characteristics of integral polytopes. Based on…
We introduce polyhedra circuits. Each polyhedra circuit characterizes a geometric region in $\mathbb{R}^d$. They can be applied to represent a rich class of geometric objects, which include all polyhedra and the union of a finite number of…
We revisit a classical theme of (general or translation invariant) valuations on convex polyhedra. Our setting generalizes the classical one, in a ``dual'' direction to previously considered generalizations: while previous research was…
In this paper, a class of $\log$-polyharmonic mappings $\mathcal{L}_p\mathcal{H}$ together with its subclass $\mathcal{L}_p\mathcal{H}(G)$ in the unit disk $\mathbb{D}=\{z: |z|<1\}$ is introduced, and several geometrical properties such as…
Polyhedral geometry can be used to quantitatively assess the dependence of rankings on personal preference, and provides a tool for both students and universities to assess US News and World Report rankings.
Poincar\'e's Polyhedron Theorem is a widely known valuable tool in constructing manifolds endowed with a prescribed geometric structure. It is one of the few criteria providing discreteness of groups of isometries. This work contains a…
Gale transform is a simple but powerful tool in convex geometry. In particular, the use of Gale transform is the main argument in the classification of polytopes with few vertices. Many books and documents cover the definition of Gale…
An orbit polytope is the convex hull of an orbit under a finite group $G \leq \operatorname{GL}(d,\mathbb{R})$. We develop a general theory of possible affine symmetry groups of orbit polytopes. For every group, we define an open and dense…
This article is concerned with the approximation of unbounded convex sets by polyhedra. While there is an abundance of literature investigating this task for compact sets, results on the unbounded case are scarce. We first point out the…