相关论文: Hinged Kite Mirror Dissection

An Orthogonally resolvable Matching Design OMD$(n, k)$ is a partition of the edges the complete graph $K_n$ into matchings of size $k$, called blocks, such that the blocks can be resolved in two different ways. Such a design can be…

Intuitively speaking, a bipartite graph is mirror if it can be drawn in the Cartesian plane in such a way that, the vertices of one stable are points in x=0, the vertices of the other stable set are points in x=1, the edges are straight…

This paper deals with the history of the following problem: "Can an arbitrary rectangle be dissected into 3 non-rectangular congruent regions?" We present a new elementary proof that the answer is indeed no.

We provide a polynomial time cutting plane algorithm based on split cuts to solve integer programs in the plane. We also prove that the split closure of a polyhedron in the plane has polynomial size.

We introduce a computational origami problem which we call the segment folding problem: given a set of $n$ line-segments in the plane the aim is to make creases along all segments in the minimum number of folding steps. Note that a folding…

In this note a bijection is constructed between the set of partitions of n simultaneously s-regular and t-distinct, and those simultaneously t-regular and s-distinct. Some implications of the map are discussed. As a generalized version of…

Recently Gay and Kirby described a new decomposition of smooth closed $4$-manifolds called a trisection. This paper generalises Heegaard splittings of $3$-manifolds and trisections of $4$-manifolds to all dimensions, using triangulations as…

In this paper we consider the Hamilton cycle problem in the rectangular meshes with at most two faulty nodes.We prove that this problem is solvable in polynomial time with a corresponding algorithm. We provided an entirely new approach to…

In this work, we reconsider the study of 2D materials involving double lattice structures associated with periodic polygons. In tessellated periodic representation, it appears two periodic polygons of $k$ sides of unequal side lengths at…

In this paper we enumerate the centrally symmetric lozenge tilings of a hexagon with a fern removed from its center. The proof is based on a variant of Kuo's graphical condensation method. An unexpected connection with the total number of…

A long-standing conjecture of Kelly states that every regular tournament on n vertices can be decomposed into (n-1)/2 edge-disjoint Hamilton cycles. We prove this conjecture for large n. In fact, we prove a far more general result, based on…

While rectangular and box-shaped objects dominate the classic discourse of theoretic investigations, a fascinating frontier lies in packing more complex shapes. Given recent insights that convex polygons do not allow for constant…

Given $n$ line segments in the plane, do they form the edge set of a \emph{weakly simple polygon}; that is, can the segment endpoints be perturbed by at most $\varepsilon$, for any $\varepsilon>0$, to obtain a simple polygon? While the…

Mutually repelling particles form spontaneously ordered clusters when forced into confinement. The clusters may adopt similar spatial arrangements even if the underlying particle interactions are contrastingly different. Here we demonstrate…

In mirror symmetry, after the work by J. Walcher, the number of holomorphic disks with boundary on the real quintic lagrangian in a general quintic threefold is related to the periods of the mirror quintic family with boundary on two…

Segregation is a popular phenomenon. It has considerable effects on material performance. To the author's knowledge, there is still no automated objective quantitative indicator for segregation. In order to full fill this task, segregation…

We investigate the existence of closed polylines (also known as closed polygonal chains or self-crossing polygons) that intersect each of their edges the same number of times. The most general question in this corner of combinatorial…

We study N = 4 quiver theories on the three-sphere. We compute partition functions using the localisation method by Kapustin et al. solving exactly the matrix integrals at finite N, as functions of mass and Fayet-Iliopoulos parameters. We…

An orthant polyhedron is a polyhedron with $m$ hyperfaces, that could be realized as a section of the $m$-dimensional non-negative orthant. We classify all 2-dimensional orthant polyhedra and provide some partial results towards the…

We study the problem of finding maximum-area rectangles contained in a polygon in the plane. There has been a fair amount of work for this problem when the rectangles have to be axis-aligned or when the polygon is convex. We consider this…