Related papers: The $d$-Majorization Polytope

This paper aims to generalize and unify classical criteria for comparisons of balanced lattice designs, including fractional factorial designs, supersaturated designs and uniform designs. We present a general majorization framework for…

These lecture notes treat some current aspects of two closely interrelated topics from the theory of convex polytopes: the shapes of f-vectors, and extremal constructions. The first lecture treats 3-dimensional polytopes; it includes a…

The aim of this paper is to prove isoperimetric inequalities for simplices and polytopes with $d+2$ vertices in Euclidean, spherical and hyperbolic $d$-space. In particular, we find the minimal volume $d$-dimensional hyperbolic simplices…

This paper introduces a geometric representation of hypergraphs by representing hyperedges as simplices. Building on this framework, we employ homotopy groups to analyze the topological structure of hypergraphs embedded in high-dimensional…

We study the combinatorial complexity of D-dimensional polyhedra defined as the intersection of n halfspaces, with the property that the highest dimension of any bounded face is much smaller than D. We show that, if d is the maximum…

We use the minorization-maximization principle (Lange, Hunter and Yang 2000) to establish the monotonicity of a multiplicative algorithm for computing Bayesian D-optimal designs. This proves a conjecture of Dette, Pepelyshev and Zhigljavsky…

In this master thesis we recall already established definitions and basic properties of classical Morrey spaces in an attempt to expand known facts to their weighted counterparts. To do so, we will recall properties of Muckenhoupt weights,…

A new and extensive formalism is developed for monads and galaxies in non-standard enlargements. It is shown that monads and galaxies can be manipulated using order-preserving and order-reversing set-to-set maps, and that set properties…

We use the stabilization functors to study the combinatorial aspects of the $F$-polynomial of a representation of any finite-dimensional basic algebra. We characterize the vertices of their Newton polytopes. We give an explicit formula for…

Given a finite sequence of vectors $\mathcal F_0$ in $\C^d$ we characterize in a complete and explicit way the optimal completions of $\mathcal F_0$ obtained by adding a finite sequence of vectors with prescribed norms, where optimality is…

Consider a complete intersection I of type (d_1,..., d_r) in a polynomial ring over a field of characteristic 0. We study the graded system of ideals {gin(I^n)}_n obtained by taking the reverse lexicographic generic initial ideals of the…

We provide fundamental results on positive solutions to parametrized systems of generalized polynomial $\textit{inequalities}$ (with real exponents and positive parameters), including generalized polynomial $\textit{equations}$. In doing…

Let $A = \begin{bmatrix} E & F \\ F^T & G \end{bmatrix}$ be a $2n \times 2n$ real positive definite matrix, where $E, F,$ and $G$ are $n \times n$ blocks. It is shown that $\ d(E \oplus G) \prec^w d(A)$. Here $d(A)$ denotes the $n$-vector…

Two constructive proofs on d-majorization and thermo-majorization are provided. In the first part, we present a diagrammatic proof of the equivalence between d-majorization and the existence of a proper stochastic matrix. We explicitly…

This dissertation investigates the geometric combinatorics of convex polytopes and connections to the behavior of the simplex method for linear programming. We focus our attention on transportation polytopes, which are sets of all tables of…

These lectures on the combinatorics and geometry of 0/1-polytopes are meant as an \emph{introduction} and \emph{invitation}. Rather than heading for an extensive survey on 0/1-polytopes I present some interesting aspects of these objects;…

How can we understand the origins of highly symmetrical objects? One way is to characterize them as the solutions of natural optimization problems from discrete geometry or physics. In this paper, we explore how to prove that exceptional…

The isotropy constant of any $d$-dimensional polytope with $n$ vertices is bounded by $C \sqrt{n/d}$ where $C>0$ is a numerical constant.

Given a (finite) simplicial complex, we define its $i$-th Laplacian polytope as the convex hull of the columns of its $i$-th Laplacian matrix. This extends Laplacian simplices of finite simple graphs, as introduced by Braun and Meyer. After…

Let $d, n \in \mathbb{Z}^+$ such that $1\leq d \leq n$. A $d$-code $\mathcal{C} \subset \mathbb{F}_q^{n \times n}$ is a subset of order $n$ square matrices with the property that for all pairs of distinct elements in $\mathcal{C}$, the rank…