The d-Majorization Polytope

نویسندگان

چکیده

We investigate geometric and topological properties of $d$-majorization -- a generalization classical majorization to positive weight vectors $d \in \mathbb{R}^n$. In particular, we derive new, simplified characterization which allows us work out halfspace description the corresponding polytopes. That is, write set all are $d$-majorized by some given vector $y \mathbb{R}^n$ as an intersection finitely many half spaces, i.e. solutions inequality type $Mx\leq b$. Here $b$ depends on $y$ while $M$ can be chosen independently $y$. This lets prove continuity polytope (jointly with respect $d$ $y$) and, furthermore, fully characterize its extreme points. Interestingly, for $y\geq 0$ one these points classically majorizes every other element polytope. Moreover, show that induced preorder structure $\mathbb{R}^n$ admits minimal maximal elements. While former always unique latter if only they correspond entry $d$-vector.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Vertices of the d-Dimensional Birkhoff Polytope

Let us denote by Ωn the Birkhoff polytope of n× n doubly stochastic matrices. As the Birkhoff–von Neumann theorem famously states, the vertex set of Ωn coincides with the set of all n× n permutation matrices. Here we consider a higherdimensional analog of this basic fact. Let Ω n be the polytope which consists of all tristochastic arrays of order n. These are n×n×n arrays with nonnegative entri...

متن کامل

The Number of k -Faces of a Simple d -Polytope

Consider the question: Given integers k < d < n, does there exist a simple d-polytope with n faces of dimension k? We show that there exist numbers G(d; k) and N (d; k) such that for n > N (d; k) the answer is yes if and only if G(d; k) divides n. Furthermore, a formula for G(d; k) is given, showing that e.g. G(d; k) = 1 if k d+1 2 or if both d and k are even, and also in some other cases (mean...

متن کامل

Signed Simplicial Decomposition and Overlay of n-D Polytope Complexes

Polytope complexes are the generalisation of polygon meshes in geoinformation systems (GIS) to arbitrary dimension, and a natural concept for accessing spatio-temporal information. Complexes of each dimension have a straightforward dimension-independent database representation called Relational Complex. Accordingly, complex overlay is the corresponding generalisation of map overlay in GIS to ar...

متن کامل

Robust D stabilization of a polytope of matrices

The problem of stabilization of a polytope of matrices in a subregion DR of the com plex plane is revisited A new su cient condition of robust DR stabilization is given It implies the solution of an LMI involving matrix variables constrained by a nonlinear algebraic relation Some LMI relaxations are rst proposed Then it is shown that a cone complementarity formulation of this condition allows t...

متن کامل

Linear Preservers of Majorization

For vectors $X, Yin mathbb{R}^{n}$, we say $X$ is left matrix majorized by $Y$ and write $X prec_{ell} Y$ if for some row stochastic matrix $R, ~X=RY.$ Also, we write $Xsim_{ell}Y,$ when $Xprec_{ell}Yprec_{ell}X.$ A linear operator $Tcolon mathbb{R}^{p}to mathbb{R}^{n}$ is said to be a linear preserver of a given relation $prec$ if $Xprec Y$ on $mathbb{R}^{p}$ implies that $TXprec TY$ on $mathb...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2022

ISSN: ['1873-1856', '0024-3795']

DOI: https://doi.org/10.1016/j.laa.2022.05.005