Related papers: On convexification of polygons by pops

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…

We consider orthogonal polynomials on the surface of a double cone or a hyperboloid of revolution, either finite or infinite in axis direction, and on the solid domain bounded by such a surface and, when the surface is finite, by…

The article deals with operations defined on convex polyhedra or polyhedral convex functions. Given two convex polyhedra, operations like Minkowski sum, intersection and closed convex hull of the union are considered. Basic operations for…

Let a $R$-body be a closed set, complement of union of open balls of radius $R$ in the Euclidean space. Properties generalizing similar ones for convex sets are proved for the family of $R$-bodies; properties for the family of sets…

Given a planar straight-line graph $G=(V,E)$ in $\mathbb{R}^2$, a \emph{circumscribing polygon} of $G$ is a simple polygon $P$ whose vertex set is $V$, and every edge in $E$ is either an edge or an internal diagonal of $P$. A circumscribing…

We classify the simple linear compactifications of SO(2r+1), namely those compactifications with a unique closed orbit which are obtained by taking the closure of the SO(2r+1)xSO(2r+1)-orbit of the identity in a projective space P(End(V)),…

Let $P$ be a bounded polyhedron defined as the intersection of the non-negative orthant ${\Bbb R}^n_+$ and an affine subspace of codimension $m$ in ${\Bbb R}^n$. We show that a simple and computationally efficient formula approximates the…

We consider the problem of packing congruent circles with the maximum radius in a unit square as a mathematical optimization problem. Due to the presence of non-overlapping constraints, this problem is a notoriously difficult nonconvex…

Let $P$ be a closed convex cone in $\mathbb{R}^{n}$. Assume that $P$ is spanning i.e. $P-P=\mathbb{R}^{n}$ and pointed i.e. $P \cap -P=\{0\}$. Let $\alpha:=\{\alpha_{x}:x \in P\}$ be a $\sigma$-weakly continuous family of unital normal…

We construct a direct natural bijection between descending plane partitions without any special part and permutations. The directness is in the sense that the bijection avoids any reference to nonintersecting lattice paths. The advantage of…

Well-known operations defined on a non-degenerate inner product vector space are extended to the case of a degenerate inner product. The main obstructions to the extension of these operations to the degenerate case are (1) the index…

By finding orthogonal representation for a family of simple connected called $\delta$-graphs it is possible to show that $\delta$-graphs satisfy delta conjecture. An extension of the argument to graphs of the form…

Orbits of coadjoint representations of classical compact Lie groups have a lot of applications. They appear in representation theory, geometrical quantization, theory of magnetism, quantum optics etc. As geometric objects the orbits were…

A polyhedron is a graph $G$ which is simple, planar and 3-connected. In this note, we classify the family of strongly involutive self-dual polyhedra. The latter is done by using a well-known result due to Tutte characterizing 3-connected…

We consider two families of polynomials $\mathbb{P}=\polP$ and $\mathbb{Q}=\polQ$\footnote{Here and below we consider only monic polynomials.} orthogonal on the real line with respect to probability measures $\mu$ and $\nu$ respectively.…

A tanglegram consists of two rooted binary trees and a perfect matching between their leaves, and a planar tanglegram is one that admits a layout with no crossings. We show that the problem of generating planar tanglegrams uniformly at…

We are studying here a family of probability density functions indexed by a real parameter, and constructed from homographic relations between associated Stieltjes transforms. From the analysis of orthogonal polynomials we deduce a family…

We introduce the notion of a polyptych lattice, which encodes a collection of lattices related by piecewise linear bijections. We initiate a study of the new theory of convex geometry and polytopes associated to polyptych lattices. In…

Let O be a cyclic topological operad with multiplication. In the framework of the cosimplicial machinery by McClure and Smith, we prove that the totalization of the cosimplicial space associated to O has an action of an operad equivalent to…

This paper studies the configuration spaces of linkages whose underlying graph is a single cycle. Assume that the edge lengths are such that there are no configurations in which all the edges lie along a line. The main results are that,…