Related papers: The alternating sign matrix polytope
Birkhoff's theorem tells that any doubly stochastic matrix can be decomposed as a weighted sum of permutation matrices. A similar theorem reveals that any unitary matrix can be decomposed as a weighted sum of complex permutation matrices.…
We propose and discuss how basic notions (quadratic modules, positive elements, semialgebraic sets, Archimedean orderings) and results (Positivstellensaetze) from real algebraic geometry can be generalized to noncommutative $*$-algebras. A…
The total matching polytope generalizes the stable set polytope and the matching polytope. In this paper, we first propose new facet-defining inequalities for the total matching polytope. We then give an exponential-sized, non-redundant…
The geometry of the Birkhoff polytope, i.e., the compact convex set of all $n \times n$ doubly stochastic matrices, has been an active subject of research. While its faces, edges and facets as well as its volume have been intensely studied,…
We establish a characterization of almost $P$-matrices via a sign non-reversal property. In this we are inspired by the analogous results for $N$-matrices. Next, the interval hull of two $m \times n$ matrices $A=(a_{ij})$ and $B =…
A cosmological polytope is a lattice polytope introduced by Arkani-Hamed, Benincasa, and Postnikov in their study of the wavefunction of the universe in a class of cosmological models. More concretely, they construct a cosmological polytope…
We prove that the principal pivot transform (also known as the partial inverse, sweep operator, or exchange operator in various contexts) maps matrices with positive imaginary part to matrices with positive imaginary part. We show that the…
We observe that the characteristic polynomial of a linearly perturbed semidefinite matrix can be used to give the convergence rate of alternating projections for the positive semidefinite cone and a line. As a consequence, we show that such…
A multidimensional nonnegative matrix is called polystochastic if the sum of its entries at each line is equal to $1$. The set of all polystochastic matrices of order $n$ and dimension $d$ is a convex polytope $\Omega_n^d$. In the present…
In image analysis, many tasks require representing two-dimensional (2D) shape, often specified by a set of 2D points, for comparison purposes. The challenge of the representation is that it must not only capture the characteristics of the…
We consider "odd symplectic Lie algebras" defined in terms of maximal rank skew-symmetric forms. We provide FFLV polytopes for these algebras and prove their standard properties. In particular, we obtain a new graded character formula and…
It is shown how the Beneath-and-Beyond algorithm can be used to yield another proof of the equivalence of V- and H-representations of convex polytopes. In this sense this paper serves as the sketch of an introduction to polytope theory with…
Each group G of nxn permutation matrices has a corresponding permutation polytope, P(G):=conv(G) in R^{nxn}. We relate the structure of P(G) to the transitivity of G. In particular, we show that if G has t nontrivial orbits, then…
A Gelfand-Cetlin polytope is a convex polytope obtained as an image of certain completely integrable system on a partial flag variety. In this paper, we give an equivalent description of the face structure of a GC-polytope in terms of so…
We give a topological characterisation of alternating knot exteriors based on the presence of special spanning surfaces. This shows that alternating is a topological property of the knot exterior and not just a property of diagrams,…
Ordinary polytopes are known as a non-simplicial generalization of the cyclic polytopes. The face vectors of ordinary polytopes are shown to be log-concave.
We give a combinatorial interpretation of the determinant of a matrix as a generating function over Brauer diagrams in two different but related ways. The sign of a permutation associated to its number of inversions in the Leibniz formula…
The classical permutohedron Perm is the convex hull of the points (w(1),...,w(n)) in R^n where w ranges over all permutations in the symmetric group. This polytope has many beautiful properties -- for example it provides a way to visualize…
In this article, we give a sufficient and necessary condition for determining whether a matchgate signature retains its property under a certain variable permutation, which can be checked in polynomial time. We also define the concept of…
We prove a conjecture made by the first author: given an n-body central configuration X_0 in the euclidean space R^{2p}, let Im F be the set of ordered real p-tuples {\nu_1,\nu_2,...,\nu_p} such that {\pm i\nu_1,\pm i\nu_2,...,\pm i\nu_p}…