相关论文: Diameter, decomposability, and Minkowski sums of p…
A lattice (d, k)-polytope is the convex hull of a set of points in dimension d whose coordinates are integers between 0 and k. Let {\delta}(d, k) be the largest diameter over all lattice (d, k)-polytopes. We develop a computational…
The free sum is a basic geometric operation among convex polytopes. This note focuses on the relationship between the normalized volume of the free sum and that of the summands. In particular, we show that the normalized volume of the free…
Polymer quantum mechanics has been studied as a simplified picture that reflects some of the key properties of Loop Quantum Gravity; however, while the fate of relativistic symmetries in Loop Quantum Gravity is still not established, it is…
In this paper, we deal with the successive inner and outer radii with respect to Orlicz Minkowski sum. The upper and lower bounds for the radii of the Orlicz Minkowski sum of two convex bodies are established.
In this paper we extend recent results of Fiorini et al. on the extension complexity of the cut polytope and related polyhedra. We first describe a lifting argument to show exponential extension complexity for a number of NP-complete…
We give a deterministic method of quasi-polynomial complexity to approximate the volume of the intersection of the unit hypercube with two specific sets. The method can actually be applied (without losing the quasi-polynomial complexity) to…
Each group G of nxn permutation matrices has a corresponding permutation polytope, P(G):=conv(G) in R^{nxn}. We relate the structure of P(G) to the transitivity of G. In particular, we show that if G has t nontrivial orbits, then…
Ellipsoids are a common representation for reachability analysis, because they can be transformed efficiently under affine maps, and allow conservative approximation of Minkowski sums, which let one incorporate uncertainty and linearization…
Our main result is that every n-dimensional polytope can be described by at most (2n-1) polynomial inequalities and, moreover, these polynomials can explicitly be constructed. For an n-dimensional pointed polyhedral cone we prove the bound…
Given any two convex polyhedra P and Q, we prove as one of our main results that the surface of P can be reshaped to a homothet of Q by a finite sequence of "tailoring" steps. Each tailoring excises a digon surrounding a single vertex and…
Monsky's celebrated equidissection theorem follows from his more general proof of the existence of a polynomial relation $f$ among the areas of the triangles in a dissection of the unit square. More recently, the authors studied a different…
Minkowski's second theorem can be stated as an inequality for $n$-dimensional flat Finsler tori relating the volume and the minimal product of the lengths of closed geodesics which form a homology basis. In this paper we show how this…
For $p\in (-\infty,0)\cup(0,1)$ and a convex body $K\subset\mathbb{R}^n$ with the origin in its interior, we construct the family of $p$-affine dual curvature measures $\mathcal{I}_p(K,\cdot)$ with respect to $K$. The affine-invariant…
We consider a countably generated and uniformly closed algebra of bounded functions. We assume that there is a lower semicontinuous, with respect to the supremum norm, quadratic form and that normal contractions operate in a certain sense.…
We investigate decompositions of a graph into a small number of low diameter subgraphs. Let P(n,\epsilon,d) be the smallest k such that every graph G=(V,E) on n vertices has an edge partition E=E_0 \cup E_1 \cup ... \cup E_k such that |E_0|…
This note is a comment to the paper by D.R.Heath-Brown and B.Z.Moroz (Math Proc. Camb. Phil. Soc. 125 (1999)). That paper concerns with the projective surface $S$ in $\mathbb{P}^{3}$ defined by the equation $x_{1}x_{2}x_{3}=x_{4}^{3}$. It…
\emph{Minkowski rings} are certain rings of simple functions on the Euclidean space $W = {\mathbb{R}}^d$ with multiplicative structure derived from Minkowski addition of convex polytopes. When the ring is (finitely) generated by a set…
It is an open question whether the linear extension complexity of the Cartesian product of two polytopes P, Q is the sum of the extension complexities of P and Q. We give an affirmative answer to this question for the case that one of the…
This paper is devoted to the existence of anisotropic Minkowski content and anisotropic outer Minkowski content. Our result is that the Minkowski content of the topological boundary of a given set of finite perimeter $E$ coincides with the…
The aim of this paper is the determination of the largest $n$-dimensional polytope with $n+3$ vertices of unit diameter. This is a special case of a more general problem proposed by Graham.