Search arXivSearch

arXiv · 1911.01061

The $d$-Majorization Polytope

Abstract

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

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Frederik vom Ende, Gunther Dirr. 2022-05-06. The $d$-Majorization Polytope. https://doi.org/10.1016/j.laa.2022.05.005

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO