English
Related papers

Related papers: The $d$-Majorization Polytope

200 papers

In this paper we define and investigate a class of polytopes which we call "vertex generated" consisting of polytopes which are the average of their $0$ and $n$ dimensional faces. We show many results regarding this class, among them: that…

Metric Geometry · Mathematics 2024-07-31 Shiri Artstein-Avidan , Tomer Falah , Boaz A. Slomka

Let $f_i(P)$ denote the number of $i$-dimensional faces of a convex polytope $P$. Furthermore, let $S(n,d)$ and $C(n,d)$ denote, respectively, the stacked and the cyclic $d$-dimensional polytopes on $n$ vertices. Our main result is that for…

Combinatorics · Mathematics 2007-05-23 Anders Björner

A realisation of a metric $d$ on a finite set $X$ is a weighted graph $(G,w)$ whose vertex set contains $X$ such that the shortest-path distance between elements of $X$ considered as vertices in $G$ is equal to $d$. Such a realisation…

Combinatorics · Mathematics 2015-02-10 Sven Herrmann , Jack Koolen , Alice Lesser , Vincent Moulton , Taoyang Wu

We completely solve the problem of enumerating combinatorially inequivalent $d$-dimensional polytopes with $d+3$ vertices. A first solution of this problem, by Lloyd, was published in 1970. But the obtained counting formula was not correct,…

Combinatorics · Mathematics 2007-05-23 Eric Fusy

We investigate the asymptotic behavior of a family of multiple orthogonal polynomials that is naturally linked with the normal matrix model with a monomial potential of arbitrary degree $d+1$. The polynomials that we investigate are…

Classical Analysis and ODEs · Mathematics 2015-06-18 Arno B. J. Kuijlaars , Abey López-García

In this series of papers we study subspaces of de Branges spaces of entire functions which are generated by majorization on subsets $D$ of the closed upper half-plane. The present, first, part is addressed to the question which subspaces of…

Complex Variables · Mathematics 2010-05-18 Anton Baranov , Harald Woracek

An integral polytope is a polytope whose vertices have integer coordinates. A unimodular triangulation of an integral polytope in $\mathbb{R}^d$ is a triangulation in which all simplices are integral with volume $1/d!$. A classic result of…

Combinatorics · Mathematics 2021-12-10 Gaku Liu

This work presents the tessellations and polytopes from the perspective of both n-dimensional geometry and abstract symmetry groups. It starts with a brief introduction to the terminology and a short motivation. In the first part, it…

Group Theory · Mathematics 2023-01-06 Plamen Dimitrov

Dominating set problems are among the most important class of combinatorial problems in graph optimization, from a theoretical as well as from a practical point of view. In this paper, we address the recently introduced (minimum) weighted…

Optimization and Control · Mathematics 2019-10-09 Eduardo Álvarez-Miranda , Markus Sinnl

We prove a general multi-dimensional central limit theorem for the expected number of vertices of a given degree in the family of planar maps whose vertex degrees are restricted to an arbitrary (finite or infinite) set of positive integers…

Combinatorics · Mathematics 2020-01-22 Gwendal Collet , Michael Drmota , Lukas Daniel Klausner

We use the formalism of Generalised Geometry to characterise in general the supersymmetric backgrounds in type II supergravity that have a null Killing vector. We then specify this analysis to configurations that preserve the same…

High Energy Physics - Theory · Physics 2015-07-06 Stefano Giusto , Luca Martucci , Michela Petrini , Rodolfo Russo

In this note we generalize the definition of partial permutations of Ivanov and Kerov and we build a universal algebra which projects onto the m-centraliser algebra defined by Creedon. We use it to present a new proof for the polynomiality…

Combinatorics · Mathematics 2023-10-12 Omar Tout

For a positive integer $d$, a non-negative integer $n$ and a non-negative integer $h\leq n$, we study the number $C_{n}^{(d)}$ of principal ideals; and the number $C_{n,h}^{(d)}$ of principal ideals generated by an element of rank $h$, in…

Combinatorics · Mathematics 2019-12-23 Chwas Ahmed , Paul Martin , Volodymyr Mazorchuk

The aim of this paper is twofold. The first part is concerned with the associated and the so-called co-polynomials, i.e. new sequences obtained when finite perturbations of the recurrence coefficients are considered. In the second part we…

Classical Analysis and ODEs · Mathematics 2021-01-05 Abdessadek Saib

In this paper, we investigate two properties concerning the unimodality of the $\delta$-vectors of lattice polytopes, which are log-concavity and alternatingly increasingness. For lattice polytopes $\mathcal{P}$ of dimension $d$, we prove…

Combinatorics · Mathematics 2015-04-17 Akihiro Higashitani

In the Minimum $d$-Dimensional Arrangement Problem (d-dimAP) we are given a graph with edge weights, and the goal is to find a 1-1 map of the vertices into $\mathbb{Z}^d$ (for some fixed dimension $d\geq 1$) minimizing the total weighted…

Data Structures and Algorithms · Computer Science 2013-07-26 Anupam Gupta , Anastasios Sidiropoulos

We consider, for complete bipartite graphs, the convex hulls of characteristic vectors of all matchings, extended by a binary entry indicating whether the matching contains two specific edges. These polytopes are associated to the quadratic…

Discrete Mathematics · Computer Science 2019-04-09 Matthias Walter

The present work is the first member of a pair of papers concerning decreasingly-minimal (dec-min) elements of a set of integral vectors, where a vector is dec-min if its largest component is as small as possible, within this, the next…

Combinatorics · Mathematics 2021-07-19 András Frank , Kazuo Murota

The homotopy type of the complement manifold of a complexified toric arrangement has been investigated by d'Antonio and Delucchi in a paper that shows the minimality of such topological space. In this work we associate to a given toric…

Combinatorics · Mathematics 2024-10-30 Elia Saini

The goal of this paper is to establish certain inequalities between the numbers of convex polytopes in the d-dimensional space "containing" and "avoiding" zero provided that their vertex sets are subsets of a given finite set of points in…

Combinatorics · Mathematics 2013-12-24 Alexander Kelmans , Anatoliy Rubinov