Related papers: On the Face Map of the Admissible Set With Iwahori…

We give a new description of the set $Adm(\mu)$ of admissible alcoves as an intersection of certain "obtuse cones" of alcoves, and we show this description may be given by imposing conditions vertexwise. We use this to prove the vertexwise…

In [Baumeister, H., Nill, Paffenholz, On permutation polytopes, Adv. Math. 222 (2009), 431-452 / arXiv:0709.1615] we conjectured a characterization of subgroups H of a permutation group G so that, on the level of permutation polytopes, P(H)…

Let $D$ be a space of $2\times n$ matrices. Then the face of the cone of all completely positive maps from $M_2$ into $M_n$ given by $D$ is an exposed face of the bigger cone of all decomposable positive linear maps if and only if the set…

The aim of the paper is to calculate face numbers of simple generalized permutohedra, and study their f-, h- and gamma-vectors. These polytopes include permutohedra, associahedra, graph-associahedra, simple graphic zonotopes, nestohedra,…

We study the map associating the cohomology class of an admissible normal function on the product of punctured disks, and give some sufficient conditions for the surjectivity of the map. We also construct some examples such that the map is…

We prove G\"ortz's combinatorial conjecture \cite{Go01} on dual shellability of admissible sets in Iwahori-Weyl groups, proving that the augmented admissible set $\widehat{\mathrm{Adm}}(\mu)$ is dual shellable for any dominant coweight…

According to Euler's relation any polytope P has as many faces of even dimension as it has faces of odd dimension. As a generalization of this fact one can compare the number of faces whose dimension is congruent to i modulo m with the…

The secondary polytope of a point configuration A is a polytope whose face poset is isomorphic to the poset of all regular subdivisions of A. While the vertices of the secondary polytope - corresponding to the triangulations of A - are very…

In many cases the convexity of the image of a linear map with range is $R^n$ is automatic because of the facial structure of the domain of the map. We develop a four step procedure for proving this kind of ``automatic convexity''. To make…

We study the Iwasawa-type decomposition of an open subset of SL(n,C) as SU(p,q)AN. We show that the dressing action of SU(p,q) is globally defined on the space of admissible elements in AN. We also show that the space of admissible elements…

We study the topology of small covers from their fundamental groups. We find a way to obtain explicit presentations of the fundamental group of a small cover. Then we use these presentations to study the relations between the fundamental…

A level graph is the data of a pair $(G,\pi)$ consisting of a finite graph $G$ and an ordered partition $\pi$ on the set of vertices of $G$. To each level graph on $n$ vertices we associate a polytope in $\mathbb R^n$ called its residue…

The paper is motivated by the study of graded representations of Takiff algebras, cominuscule parabolics, and their generalizations. We study certain special subsets of the set of weights (and of their convex hull) of the generalized Verma…

Using face algebras (i.e. algebras of L-operators of IRF models), we construct modular tensor categories with positive definite inner product, whose fusion rules and S-matrices are the same as (or slightly different from) those obtained by…

While faces of a polytope form a well structured lattice, in which faces of each possible dimension are present, this is not true for general compact convex sets. We address the question of what dimensional patterns are possible for the…

This paper concerns random bipartite planar maps which are defined by assigning weights to their faces. The paper presents a threefold contribution to the theory. Firstly, we prove the existence of the local limit for all choices of weights…

A cosmological polytope is a lattice polytope introduced by Arkani-Hamed, Benincasa, and Postnikov in their study of the wavefunction of the universe in a class of cosmological models. More concretely, they construct a cosmological polytope…

We consider the problem of constructing an abstract $(n+1)$-polytope $Q$ with $k$ facets isomorphic to a given $n$-polytope $P$, where $k \geq 3$. In particular, we consider the case where we want $Q$ to be $(n-2,n)$-flat, meaning that…

Scale variation is one of the most challenging problems in face detection. Modern face detectors employ feature pyramids to deal with scale variation. However, it might break the feature consistency across different scales of faces. In this…

The lifted multicut problem is a combinatorial optimization problem whose feasible solutions relate one-to-one to the decompositions of a graph $G = (V, E)$. Given an augmentation $\widehat{G} = (V, E \cup F)$ of $G$ and given costs $c \in…