Related papers: Convex fair partitions into an arbitrary number of…

We address the question: Given a positive integer $N$, can any 2D convex polygonal region be partitioned into $N$ convex pieces such that all pieces have the same area and same perimeter? The answer to this question is easily `yes' for…

Motivated by a question of R.\ Nandakumar, we show that the Euclidean plane can be dissected into mutually incongruent convex pentagons of the same area and the same perimeter.

We show that, for any prime power n and any convex body K (i.e., a compact convex set with interior) in Rd, there exists a partition of K into n convex sets with equal volumes and equal surface areas. Similar results regarding…

For convex partitions of a convex body $B$ we prove that we can put a homothetic copy of $B$ into each set of the partition so that the sum of homothety coefficients is $\ge 1$. In the plane the partition may be arbitrary, while in higher…

We prove several results of the following type: any $d$ measures in $\mathbb R^d$ can be partitioned simultaneously into $k$ equal parts by a convex partition (this particular result is proved independently by Pablo Sober\'on). Another…

We briefly introduce several problems: (1) a generalization of the convex fair partition conjecture, (2) on non-trivial invariants among polyhedrons that can be formed from the same set of face polygons, (3) two questions on assembling…

Motivated by a question of R.\ Nandakumar, we show that the Euclidean plane can be dissected into mutually incongruent convex quadrangles of the same area and the same perimeter. As a byproduct we obtain vertex-to-vertex dissections of the…

It is proved that every convex body in the plane has a point such that the union of the body and its image under reflection in the point is convex. If the body is not centrally symmetric, then it has, in fact, three affinely independent…

We show that every convex code realizable by compact sets in the plane admits a realization consisting of polygons, and analogously every open convex code in the plane can be realized by interiors of polygons. We give factorial-type bounds…

We show that, for any prime power p^k and any convex body K (i.e., a compact convex set with interior) in Rd, there exists a partition of K into p^k convex sets with equal volume and equal surface area. We derive this result from a more…

We introduce the problem of partitioning 2D regions (usually convex regions) into mutually congruent pieces ('tiles').

We describe a regular cell complex model for the configuration space F(\R^d,n). Based on this, we use Equivariant Obstruction Theory to prove the prime power case of the conjecture by Nandakumar and Ramana Rao that every polygon can be…

We show that every (possibly unbounded) convex polygon $P$ in $R^2$ with $m$ edges can be represented by inequalities $p_1 \ge 0,...,p_n \ge 0,$ where the $p_i$'s are products of at most $k$ affine functions each vanishing on an edge of $P$…

In this note, we obtain a formula which leads to a practical and efficient method to calculate the number of partitions of n into parts not divisible by m for given natural numbers n and m.

Let $K$ be a planar convex body af area $|K|$, and take $0 \textless{} \alpha \textless{} 1$.An $\alpha$-section of $K$ is a line cutting $K$ into two parts, one of whichhas area $\alpha|K|$. This article presents a systematic study of the…

We explore an instance of the question of partitioning a polygon into pieces, each of which is as ``circular'' as possible, in the sense of having an aspect ratio close to 1. The aspect ratio of a polygon is the ratio of the diameters of…

Let $P$ be a set of $n$ points in general position on the plane. A set of closed convex polygons with vertices in $P$, and with pairwise disjoint interiors is called a convex decomposition of $P$ if their union is the convex hull of $P$,…

We show that if $d\ge 4$ is even, then one can find two essentially different convex bodies such that the volumes of their maximal sections, central sections, and projections coincide for all directions.

Polygons are described as almost-convex if their perimeter differs from the perimeter of their minimum bounding rectangle by twice their `concavity index', $m$. Such polygons are called \emph{$m$-convex} polygons and are characterised by…

A planar set $P$ is said to be cover-decomposable if there is a constant $k=k(P)$ such that every $k$-fold covering of the plane with translates of $P$ can be decomposed into two coverings. It is known that open convex polygons are…