Related papers: Polyhedral Geometry in OSCAR
We follow a stream of the history of positive matrices and positive functionals, as applied to algebraic sums of squares decompositions, with emphasis on the interaction between classical moment problems, function theory of one or several…
Skeletal polyhedra and polygonal complexes in ordinary Euclidean 3-space are finite or infinite 3-periodic structures with interesting geometric, combinatorial, and algebraic properties. They can be viewed as finite or infinite 3-periodic…
This paper focuses on vertices of the master corner polyhedra $P(G,g_0),$ the core of the group-theoretical approach to integer linear programming. We introduce two combinatorial operations that transform each vertex of $P(G,g_0)$ to…
We introduce Graphical Algebraic Geometry (GAG), a family of diagrammatic languages extending the Graphical Linear Algebra programme. We construct several languages within this family and prove that they are universal and complete for the…
It is demonstrated how the software system polymake can be used for computations in toric geometry. More precisely, counter-examples to conjectures related to A-determinants and defect polytopes are constructed.
The higher-rank numerical range is a convex compact set generalizing the classical numerical range of a square complex matrix, first appearing in the study of quantum error correction. We will discuss some of the real algebraic and convex…
The boundary of the convex hull of a compact algebraic curve in real 3-space defines a real algebraic surface. For general curves, that boundary surface is reducible, consisting of tritangent planes and a scroll of stationary bisecants. We…
Lattice polytope representation of natural numbers is introduced based on the fundamental theorem of arithmetic. The combinatorial and geometric properties of the polytopes are studied using Polymake and Qhull software. The volume of the…
We develop a computational framework that leverages the features of sophisticated software tools and numerics to tackle some of the pressing issues in the realm of earth sciences. The algorithms to handle the physics of multiphase flow,…
We investigate algebras with one operation. We study when these algebras form a monoidal category and analyze Koszulness and cyclicity of the corresponding operads. We also introduce a new kind of symmetry for operads, the dihedrality,…
Toric geometry provides a bridge between the theory of polytopes and algebraic geometry: one can associate to each lattice polytope a polarized toric variety. In this thesis we explore this correspondence to classify smooth lattice…
Envelopes of parameterized families of plane curves is an important topic, both for the mathematics involved and for its applications. Nowadays, it is generally studied in a technology-rich environment, and automated methods are developed…
We introduce the notion of a polyptych lattice, which encodes a collection of lattices related by piecewise linear bijections. We initiate a study of the new theory of convex geometry and polytopes associated to polyptych lattices. In…
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…
The concept of number and its generalization has played a central role in the development of mathematics over many centuries and many civilizations. Noteworthy milestones in this long and arduous process were the developments of the real…
The cutting-plane approach to integer programming was initiated more that 40 years ago: Gomory introduced the corner polyhedron as a relaxation of a mixed integer set in tableau form and Balas introduced intersection cuts for the corner…
We explore the geometry behind the modular bootstrap and its image in the space of Taylor coefficients of the torus partition function. In the first part, we identify the geometry as an intersection of planes with the convex hull of moment…
In this article, we develop new methods for counting integral orbits having bounded invariants that lie inside the cusps of fundamental domains for coregular representations. We illustrate these methods for a representation of cardinal…
A kind of combinatorial map, called arrow presentation, is proposed to encode the data of the oriented closed polyhedral complexes $\Sigma$ on which the Hopf algebraic Kitaev model lives. We develop a theory of arrow presentations which…
In this paper we analyze O'Hara's partition bijection. We present three type of results. First, we show that O'Hara's bijection can be viewed geometrically as a certain scissor congruence type result. Second, we obtain a number of new…