Related papers: Combining realization space models of polytopes
This paper investigates the extension complexity of polytopes by exploiting the correspondence between non-negative factorizations of slack matrices and randomized communication protocols. We introduce a geometric characterization of…
In this tutorial, we provide an overview of many of the established combinatorial and algebraic tools of Schubert calculus, the modern area of enumerative geometry that encapsulates a wide variety of topics involving intersections of linear…
In this paper a Lotka Volterra type system is considered. For such a system, biHamiltonian formulation, symplectic realizations and symmetries are presented.
Matroid varieties are the closures in the Grassmannian of sets of points defined by specifying which Pl\"ucker coordinates vanish and which don't --- the set of nonvanishing Pl\"ucker coordinates forms a well-studied object called a…
We study the problem of how to obtain an integer realization of a 3d polytope when an integer realization of its dual polytope is given. We focus on grid embeddings with small coordinates and develop novel techniques based on Colin de…
The 1-product of matrices $S_1 \in \mathbb{R}^{m_1 \times n_1}$ and $S_2 \in \mathbb{R}^{m_2 \times n_2}$ is the matrix in $\mathbb{R}^{(m_1+m_2) \times (n_1n_2)}$ whose columns are the concatenation of each column of $S_1$ with each column…
We develop a new method for analyzing moduli problems related to the stack of pure coherent sheaves on a polarized family of projective schemes. It is an infinite-dimensional analogue of geometric invariant theory. We apply this to two…
Given an algebraic structure on the homology of a chain complex, we define its realization space as a Kan complex whose vertices are the structures up to homotopy realizing this structure at the homology level. Our algebraic structures are…
In this paper we characterize the slack matrices of cones and polytopes among all nonnegative matrices. This leads to an algorithm for deciding whether a given matrix is a slack matrix. The underlying decision problem is equivalent to the…
Rectangulations are decompositions of a square into finitely many axis-aligned rectangles. We describe realizations of $(n-1)$-dimensional polytopes associated with two combinatorial families of rectangulations composed of $n$ rectangles.…
This thesis explores two specific topics of discrete geometry, the multitriangulations and the polytopal realizations of products, whose connection is the problem of finding polytopal realizations of a given combinatorial structure. A…
We describe the symplectic structure and Hamiltonian dynamics for a class of Grassmannian manifolds. Using the two dimensional sphere ($S^2$) and disc ($D^2$) as illustrative cases, we write their path integral representations using…
We investigate various types of symmetries and their mutual relationships in Hamiltonian systems defined on manifolds with different geometric structures: symplectic, cosymplectic, contact and cocontact. In each case we pay special…
We study smoothness of realization spaces of matroids for small rank and ground set. For $\mathbb{C}$-realizable matroids, when the rank is $3$, we prove that the realization spaces are all smooth when the ground set has $11$ or fewer…
We present the exact realization of the extended Snyder model. Using similarity transformations, we construct realizations of the original Snyder and the extended Snyder models. Finally, we present the exact new realization of the…
We study rank-three matroids, known as point-line configurations, and their associated matroid varieties, defined as the Zariski closures of their realization spaces. Our focus is on determining finite generating sets of defining equations…
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…
A venerable problem in combinatorics and geometry asks whether a given incidence relation may be realized by a configuration of points and lines. The classic version of this would ask for algebraic lines over some field or possibly real…
Questions that seek to determine whether a hyperplane arrangement property, be it geometric, arithmetic or topological, is of a combinatorial nature (that is determined by the intersection lattice) are abundant in the literature. To tackle…
This article gives necessary and sufficient conditions for a relation to be the containment relation between the facets and vertices of a polytope. Also given here, are a set of matrices parameterizing the linear moduli space and another…