Related papers: On contractible edges in convex decompositions

In this note we consider the question how the set of inversions of a permutation $\pi \in S_n$ can be partitioned into two subset, such that those are itself inversion sets of permutations. This is archived by exploiting a connection to a…

Hadwiger's covering conjecture is that every $n$-dimensional convex body can be covered by at most $2^n$ of its smaller positive homothetic copies, with $2^n$ copies required only for affine images of $n$-cube. Convex hull of a ball and an…

The Edelman-Jamison problem is to characterize those abstract convex geometries that are representable by a set of points in the plane. We show that some natural modification of the Edelman-Jamison problem is equivalent to the well known…

We prove that various spaces of constrained positive scalar curvature metrics on compact 3-manifolds with boundary, when not empty, are contractible. The constraints we mostly focus on are given in terms of local conditions on the mean…

We classify here combinatorially rigid simple polytopes with three facets more than their dimension.

We consider the problem of decomposing some $t$-uniform hypergraph $G$ into copies of another, say $H$, with nonnegative rational weights. For fixed $H$ on $k$ vertices, we show that this is always possible for all $G$ having sufficiently…

Motivated by questions from Ehrhart theory, we present new results on discrete equidecomposability. Two rational polygons $P$ and $Q$ are said to be discretely equidecomposable if there exists a piecewise affine-unimodular bijection…

We prove that for any convex polygon $S$ with at least four sides, or a concave one with no parallel sides, and any $m>0$, there is an $m$-fold covering of the plane with homothetic copies of $S$ that cannot be decomposed into two…

Let $\mathcal{D}$ be a set of $n$ pairwise disjoint unit disks in the plane. We describe how to build a data structure for $\mathcal{D}$ so that for any point set $P$ containing exactly one point from each disk, we can quickly find the…

We study the set of the representable numbers in base $q=pe^{i\frac{2\pi}{n}}$ with $\rho>1$ and $n\in \mathbb N$ and with digits in a arbitrary finite real alphabet $A$. We give a geometrical description of the convex hull of the…

Given a real algebraic curve in the projective 3-space, its hyperbolicity locus is the set of lines with respect to which the curve is hyperbolic. We give an example of a smooth irreducible curve whose hyperbolicity locus is disconnected…

Given a set of $n$ labeled points in general position in the plane, we remove all of its points one by one. At each step, one point from the convex hull of the remaining set is erased. In how many ways can the process be carried out? The…

While there is extensive literature on approximation of convex bodies by inscribed or circumscribed polytopes, much less is known in the case of generally positioned polytopes. Here we give upper and lower bounds for approximation of convex…

We provide a general contractibility criterion for subsets of Riemannian metrics on the disc. For instance, this result applies to the space of metrics that have positive Gauss curvature and make the boundary circle convex (or geodesic).…

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 prove that for every centrally symmetric convex polygon Q, there exists a constant alpha such that any alpha*k-fold covering of the plane by translates of Q can be decomposed into k coverings. This improves on a quadratic upper bound…

Given a convex n-gon P in the Euclidean plane, it is well known that the simplicial complex \theta(P) with vertex set given by diagonals in P and facets given by triangulations of P is the boundary complex of a polytope of dimension n-3. We…

A branched affine structure on a compact topological surface with marked points is a complex affine structure outside the marked points. We give a proof of an unpublished foundational theorem of Veech, stating that any branched affine…

Recutting is an operation on planar polygons defined by cutting a polygon along a diagonal to remove a triangle, and then reattaching the triangle along the same diagonal but with opposite orientation. Recuttings along different diagonals…

One of the most important problems in Geometric Tomography is to establish properties of a given convex body if we know some properties over its sections or its projections. There are many interesting and deep results that provide…