相关论文: Diameter, decomposability, and Minkowski sums of p…

Given a polyhedral surface, assume that it is prohibited to change the shape and size of any face but it is permissible to change the dihedral angles between the faces. A polyhedral surface is said to be flexible if it is possible to change…

A popular method in combinatorial optimization is to express polytopes P, which may potentially have exponentially many facets, as solutions of linear programs that use few extra variables to reduce the number of constraints down to a…

In this paper, we investigate the relationships between the volumes of four convex bodies: the cut polytope, metric polytope, rooted metric polytope, and elliptope, defined on graphs with $n$ vertices. The cut polytope is contained in each…

A quantitative version of Minkowski sum, extending the definition of $\theta$-convolution of convex bodies, is studied to obtain extensions of the Brunn-Minkowski and Zhang inequalities, as well as, other interesting properties on Convex…

In a graph, a matching cut is an edge cut that is a matching. Matching Cut is the problem of deciding whether or not a given graph has a matching cut, which is known to be NP-complete even when restricted to bipartite graphs. It has been…

Polytope numbers for a polytope are a sequence of nonnegative integers that are defined by the facial information of a polytope. Every polygon is triangulable and a higher dimensional analogue of this fact states that every polytope is…

Let K be a knot in a closed orientable irreducible 3-manifold M and let P be a Heegaard splitting of the knot complement of genus at least two. Suppose Q is a bridge surface for K. Then either \begin{itemize} \item $d(P)\leq 2-\chi(Q-K)$,…

We give a sharp lower bound to the largest possible Euclidean norm of signed sums of $n$ vectors in the plane. This is achieved by connecting the signed vector sum problem to the isoperimetric problem for the circumradius of polygons. In…

We show that the rate of convergence on the approximation of volumes of a convex symmetric polytope P in R^n by its dual L_{p$-centroid bodies is independent of the geometry of P. In particular we show that if P has volume 1,…

We prove sharp inequalities for the average number of affine diameters through the points of a convex body $K$ in ${\mathbb R}^n$. These inequalities hold if $K$ is either a polytope or of dimension two. An example shows that the proof…

We investigate the set a) of positive, trace preserving maps acting on density matrices of size N, and a sequence of its nested subsets: the sets of maps which are b) decomposable, c) completely positive, d) extended by identity impose…

The dual Minkowski problem for even data asks what are the necessary and sufficient conditions on an even prescribed measure on the unit sphere for it to be the $q$-th dual curvature measure of an origin-symmetric convex body in…

We prove a conjecture of Goncharov, which says that any multiple polylogarithm can be expressed via polylogarithms of depth at most half of the weight. We give an explicit formula for this presentation, involving a summation over trees that…

We generalized the construction of deformations of affine toric varieties of K. Altmann and our previous construction of deformations of weak Fano toric varieties to the case of arbitrary toric varieties by introducing the notion of…

A standard fact about two incompressible surfaces in an irreducible 3-manifold is that one can move one of them by isotopy so that their intersection becomes $\pi_1$-injective. By extending it on the maps of some 3-dimensional…

Let $\Gamma$ be a $Q$-polynomial distance-regular graph of diameter $d\geq 3$. Fix a vertex $\gamma$ of $\Gamma$ and consider the subgraph induced on the union of the last two subconstituents of $\Gamma$ with respect to $\gamma$. We prove…

We study the regularity of the distance function to the boundary of a domain in $\mathbb{R}^n$, with respect to the Minkowski functional of a convex polytope. We obtain the regularity of the distance function in certain cases. We also…

Let $2\le k\le d-1$ and let $P$ and $Q$ be two convex polytopes in ${\mathbb E^d}$. Assume that their projections, $P|H$, $Q|H$, onto every $k$-dimensional subspace $H$, are congruent. In this paper we show that $P$ and $Q$ or $P$ and $-Q$…

The classical Brunn-Minkowski theory studies the geometry of convex bodies in Euclidean space by use of the Minkowski sum. It originated from H. Brunn's thesis in 1887 and H. Minkowski's paper in 1903. Because there is no universally…

A weighted game or a threshold function in general admits different weighted representations even if the sum of non-negative weights is fixed to one. Here we study bounds for the diameter of the corresponding weight polytope. It turns out…