Related papers: Realizability of Polytopes as a Low Rank Matrix Co…
These notes cover a few calculations regarding the sum-rank weight of a matrix in relation to its rank. In particular, a formula and lower bounds are given on the probability that a matrix of rank $t$ consisting of $\ell$ blocks has…
We give an explicit description of the Mirkovic-Vilonen cycles on the affine Grassmannian for arbitrary complex reductive groups. We also give a combinatorial characterization of the MV polytopes. We prove that a polytope is an MV polytope…
A matroid is a machine capturing linearity of mathematical objects and producing combinatorial structures. Matroid structure arises everywhere since linearity is a ubiquitous concept. One natural way to obtain matroids is by considering…
We describe an algorithm to enumerate polytopes. This algorithm is then implemented to give a complete classification of combinatorial spheres of dimension 3 with 9 vertices and decide polytopality of those spheres. In particular, we…
In this work, we introduce and study the forbidden-vertices problem. Given a polytope P and a subset X of its vertices, we study the complexity of linear optimization over the subset of vertices of P that are not contained in X. This…
We associate curves of isotropic, Lagrangian and coisotropic subspaces to higher order, one parameter variational problems. Minimality and conjugacy properties of extremals are described in terms of these curves.
This paper considers the question of how to succinctly approximate a multidimensional convex body by a polytope. Given a convex body $K$ of unit diameter in Euclidean $d$-dimensional space (where $d$ is a constant) and an error parameter…
We investigate necessary conditions for the existence of projections of polytopes that preserve full k-skeleta. More precisely, given the combinatorics of a polytope and the dimension e of the target space, what are obstructions to the…
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 prove that for some potentials (including the Newtonian one, and the potential of Helmholtz vortices in the plane) relative equilibria consisting of two homothetic regular polygons of arbitrary size can only occur if the masses at each…
We study the computational complexity of satisfiability problems for classes of simple finite height (ortho)complemented modular lattices $L$. For single finite $L$, these problems are shown tobe $\mc{NP}$-complete; for $L$ of height at…
We address the collective matrix completion problem of jointly recovering a collection of matrices with shared structure from partial (and potentially noisy) observations. To ensure well--posedness of the problem, we impose a joint low rank…
We give a parametrization for crystal bases of Demazure modules as a set of lattice points in some convex polytope and we also describe explicitly the extremal vectors as solutions of some system of linear equations.
In this note, we find a sharp bound for the minimal number (or in general, indexing set) of subspaces of a fixed (finite) codimension needed to cover any vector space V over any field. If V is a finite set, this is related to the problem of…
The current paper discusses some new results about conformal polynomic surface parameterizations. A new theorem is proved: Given a conformal polynomic surface parameterization of any degree it must be harmonic on each component. As a first…
In this short note, we give a new sufficient condition for a linear map from a product of copies of a field to endomorphisms of a finite dimensional vector space over the same field to be an algebra homomorphism. We expect that this result…
The positive semidefinite (psd) rank of a polytope is the smallest $k$ for which the cone of $k \times k$ real symmetric psd matrices admits an affine slice that projects onto the polytope. In this paper we show that the psd rank of a…
Optimal geometrical arrangements, such as the stacking of atoms, are of relevance in diverse disciplines. A classic problem is the determination of the optimal arrangement of spheres in three dimensions in order to achieve the highest…
Let $\{\mathbb{P}_n\}_{n\ge 0}$ and $\{\mathbb{Q}_n\}_{n\ge 0}$ be two monic polynomial systems in several variables satisfying the linear structure relation $$\mathbb{Q}_n = \mathbb{P}_n + M_n \mathbb{P}_{n-1}, \quad n\ge 1,$$ where $M_n$…
In this article we provide a combinatorial sufficient (and conjecturally, necessary) condition (called $\alpha$-symmetry) for the mating of two postcritically finite polynomials in $\mathcal{S}_1$ to be obstructed. To do this, we study the…