Related papers: Combining realization space models of polytopes
The Grassmannian, which is the manifold of all $k$-dimensional subspaces in the Euclidean space $\mathbb{R}^n$, was decomposed through three equivalent methods connecting combinatorial geometries, Schubert cells and convex polyhedra by…
A shape of a combinatorial polytope is a convex embedding into Euclidean space. We provide necessary and sufficient conditions for a piecewise linear map between two shapes of the same polytope to be a compression (respectively a weak…
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…
We begin with a brief overview of lattice calculations using chiral effective field theory and some recent applications. We then describe several methods for computing scattering on the lattice. After that we focus on the main goal,…
We study and simulate N=2 supersymmetric Wess-Zumino models in one and two dimensions. For any choice of the lattice derivative, the theories can be made manifestly supersymmetric by adding appropriate improvement terms corresponding to…
A polymer folding model on the square lattice is constructed with attractive contact interactions of strength 1/c^2, 0<c<1. The corresponding model on a dynamical random lattice, with freely fluctuating co-ordination number at each vertex,…
A Newton-Okounkov polytope of a complete flag variety can be turned into a convex geometric model for Schubert calculus. Namely, we can represent Schubert cycles by linear combinations of faces of the polytope so that the intersection…
Enumeration of all combinatorial types of point configurations and polytopes is a fundamental problem in combinatorial geometry. Although many studies have been done, most of them are for 2-dimensional and non-degenerate cases. Finschi and…
The extension complexity of a polytope measures its amenability to succinct representations via lifts. There are several versions of extension complexity, including linear, real semidefinite, and complex semidefinite. We focus on the last…
Exact analytic solutions of the Skyrme model defined on a spherically symmetric $R^{(1,1)} \times S^2$ geometry, chosen to mimic finite volume effects, are presented. The static and spherically symmetric configurations have non-trivial…
The real Grassmannian is both a projective variety (via Pl\"ucker coordinates) and an affine variety (via orthogonal projections). We connect these two representations, and we develop the commutative algebra of the latter variety. We…
The classification of isoparametric hypersurfaces in spheres with four or six different principal curvatures is still not complete. In this paper we develop a structural approach that may be helpful for a classification. Instead of working…
Inspired by recent advances in observational astrophysics and continued explorations in the field of analog gravity, we discuss the prospect of simulating models of cosmology within the context of synthetic mechanical lattice experiments.…
We prove that if a simplicial complex is shellable, then the intersection lattice for the corresponding diagonal arrangement is homotopy equivalent to a wedge of spheres. Furthermore, we describe precisely the spheres in the wedge, based on…
In tolerancing analysis, geometrical or contact specifications can be represented by polytopes. Due to the degrees of invariance of surfaces and that of freedom of joints, these operand polytopes are originally unbounded in most of the…
In order to make graphical Gaussian models a viable modelling tool when the number of variables outgrows the number of observations, model classes which place equality restrictions on concentrations or partial correlations have previously…
Constructive methods for matrices of multihomogeneous (or multigraded) resultants for unmixed systems have been studied by Weyman, Zelevinsky, Sturmfels, Dickenstein and Emiris. We generalize these constructions to mixed systems, whose…
We study tropical commuting matrices from two viewpoints: linear algebra and algebraic geometry. In classical linear algebra, there exist various criteria to test whether two square matrices commute. We ask for similar criteria in the realm…
A transportation polytope consists of all multidimensional arrays or tables of non-negative real numbers that satisfy certain sum conditions on subsets of the entries. They arise naturally in optimization and statistics, and also have…
We study a hermitian $(n+1)$-matrix model with plaquette interaction, $\sum_{i=1}^n MA_iMA_i$. By means of a conformal transformation we rewrite the model as an $O(n)$ model on a random lattice with a non polynomial potential. This allows…