相关论文: Hinged Kite Mirror Dissection

The famous pancake theorem states that for every finite set $X$ in the plane, there exist two orthogonal lines that divide $X$ into four equal parts. We propose an algorithm whose running time is linear in the number of points in $X$ and…

This is a study of the construction of particular regular sub-n-gons T in regular n-gons P using a special system of chords of P. In particular, some of these sub-n-gons have areas which are integer divisors of the area of the given n-gon…

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…

We prove that almost every triangle can be dissected only into $n^2$ triangles which have to be equal one another. Moreover, such a dissection is unique for every $n$. It turns out that to solve this "simple" problem it is convenient to use…

The mirror curves enable us to study B-model topological strings on non-compact toric Calabi--Yau threefolds. One of the method to obtain the mirror curves is to calculate the partition function of the topological string with single brane.…

Let $\Pi$ be a convex decomposition of a set $P$ of $n\geq 3$ points in general position in the plane. If $\Pi$ consists of more than one polygon, then either $\Pi$ contains a deletable edge or $\Pi$ contains a contractible edge.

In this work, we will explore some polygons that individually are capable of filling the plane in an aperiodic way. These polygons were recently discovered by some researchers and constitute a great discovery for Mathematics. We will…

In this paper, we deal with a simple geometric problem: Is it possible to partition a rectangle into $k$ non-congruent rectangles of equal area? This problem is motivated by the so-called `Mondrian art problem' that asks a similar question…

We study the problem of partitioning a polygon into the minimum number of subpolygons using cuts in predetermined directions such that each resulting subpolygon satisfies a given width constraint. A polygon satisfies the unit-width…

Let a polygon be composed of equal rectangles. We find all quadratic irrationals r for which the polygon can be tiled by similar rectangles with given side ratio r.

In this paper, we introduce a natural geometric extension of the partition function. More precisely, we investigate the problem of counting partitions of a rectangle into rectangular blocks with integer sides. Here, two partitions of a…

We explore optimal circular nonconvex partitions of regular k-gons. The circularity of a polygon is measured by its aspect ratio: the ratio of the radii of the smallest circumscribing circle to the largest inscribed disk. An optimal…

Break a stick at random at $n-1$ points to obtain $n$ pieces. We give an explicit formula for the probability that every choice of $k$ segments from this broken stick can form a $k$-gon, generalizing similar work. The method we use can be…

We study the dissection of a square into congruent convex polygons. Yuan \emph{et al.} [Dissecting the square into five congruent parts, Discrete Math. \textbf{339} (2016) 288-298] asked whether, if the number of tiles is a prime number…

We present two universal hinge patterns that enable a strip of material to fold into any connected surface made up of unit squares on the 3D cube grid--for example, the surface of any polycube. The folding is efficient: for target surfaces…

Summary. A modified version of the two-slit experiment is proposed in which the moveable detector/counter used to obtain the fringe distribution by counting single photons at different positions on the screen plane is replaced with a mirror…

We propose a discrete approach to solve problems on forming polygons from broken sticks, which is akin to counting polygons with sides of integer length subject to certain Diophantine inequalities. Namely, we use MacMahon's Partition…

In this paper we deal with edge-to-edge, irreducible decompositions of a centrally symmetric convex $(2k)$-gon into centrally symmetric convex pieces. We prove an upper bound on the number of these decompositions for any value of $k$, and…

We construct partitions of rectangles into smaller rectangles from an input consisting of a planar dual graph of the layout together with restrictions on the orientations of edges and junctions of the layout. Such an orientation-constrained…

Conjecturally, a knot is slice if and only if its positive Whitehead double is slice. We consider an analogue of this conjecture for slice disks in the four-ball: two slice disks of a knot are smoothly isotopic if and only if their positive…