Related papers: On equivalent representations and properties of fa…

General computational methods based on descriptor state-space realizations are proposed to compute coprime factorizations of rational matrices with minimum degree denominators. The new methods rely on recursive pole dislocation techniques,…

Polyhedral convex set optimization problems are the simplest optimization problems with set-valued objective function. Their role in set optimization is comparable to the role of linear programs in scalar optimization. Vector linear…

The region of entropic vectors is a convex cone that has been shown to be at the core of many fundamental limits for problems in multiterminal data compression, network coding, and multimedia transmission. This cone has been shown to be…

In this paper, we present a new method for computing the f-vector of a marked order polytope. Namely, given an arbitrary (polyhedral) subdivision of an arbitrary convex polytope, we construct a cochain complex (over the two-element field…

We consider minimization of functions that are compositions of convex or prox-regular functions (possibly extended-valued) with smooth vector functions. A wide variety of important optimization problems fall into this framework. We describe…

We provide a solution method for the polyhedral convex set optimization problem, that is, the problem to minimize a set-valued mapping with polyhedral convex graph with respect to a set ordering relation which is generated by a polyhedral…

The partition of a problem into smaller sub-problems satisfying certain properties is often a key ingredient in the design of divide-and-conquer algorithms. For questions related to location, the partition problem can be modeled, in…

This is the first in a series of papers devoted to an analogue of the metaplectic representation, namely, the minimal unitary representation of an indefinite orthogonal group; this representation corresponds to the minimal nilpotent…

Associated with isoparametric foliations of unit spheres, there are two classes of minimal surfaces $-$ minimal isoparametric hypersurfaces and focal submanifolds. By virtue of their rich structures, we find new series of minimizing cones.…

We prove that each lower-dimensional face of a quasi-arithmetic Coxeter polytope, which happens to be itself a Coxeter polytope, is also quasi-arithmetic. We also provide a sufficient condition for a codimension $1$ face to be actually…

Let $K$ be a field, $V$ a finite dimensional $K$-vector space and $E$ the exterior algebra of $V$. We analyze iterated mapping cone over $E$. If $I$ is a monomial ideal of $E$ with linear quotients, we show that the mapping cone…

We study a nonlinear decomposition of a positive definite matrix into two components: the inverse of another positive definite matrix and a symmetric matrix constrained to lie in a prescribed linear subspace. Equivalently, the inverse…

We study relations between the eigenvectors of rational matrix functions on the Riemann sphere. Our main result is that for a subclass of functions that are products of two elementary blocks it is possible to represent these relations in a…

We introduce a generalization of representations of quivers that contains also representations of posets, vectorspace problems and other matrix problems. Many examples, some of which are given in the paper, show that the language of marked…

We consider quiver representations respecting a quiver automorphism and show that the dimension vectors of the indecomposables are precisely the positive roots of an associated symmetrisable Kac-Moody Lie algebra. Moreover, every such Lie…

A coordinate cone in R^n is an intersection of some coordinate hyperplanes and open coordinate half-spaces. A semi-monotone set is a defnable in an o-minimal structure over the reals, open bounded subset of R^n such that its intersection…

Any solid object can be decomposed into a collection of convex polytopes (in short, convexes). When a small number of convexes are used, such a decomposition can be thought of as a piece-wise approximation of the geometry. This…

We initiate the study of matrix convexity for operator spaces. We define the notion of compact rectangular matrix convex set, and prove the natural analogs of the Krein-Milman and the bipolar theorems in this context. We deduce a canonical…

We give a complete classification of the ideals of the core of the C*-algebras associated with self-similar maps under a certain condition. Any ideal is completely determined by the intersection with the coefficient algebra C(K) of the…

We give an optimal-size representation for the elements of the trace zero subgroup of the Picard group of an elliptic or hyperelliptic curve of any genus, with respect to a field extension of any prime degree. The representation is via the…