Related papers: On equidissection of balanced polygons
Two planar sets are circularly separable if there exists a circle enclosing one of the sets and whose open interior disk does not intersect the other set. This paper studies two problems related to circular separability. A linear-time…
The pentagram map has been studied in a series of papers by Schwartz and others. Schwartz showed that an axis-aligned polygon collapses to a point under a predictable number of iterations of the pentagram map. Glick gave a different proof…
Quasitoric manifolds, introduced by M. Davis and T. Januskiewicz in 1991, are topological generalizations of smooth complex projective spaces. In 1992, Banchoff and K\"uhnel constructed a 10-vertex equilibrium triangulations of $\CP^2$. We…
Two kinds of approximation algorithms exist for the k-BALANCED PARTITIONING problem: those that are fast but compute unsatisfying approximation ratios, and those that guarantee high quality ratios but are slow. In this paper we prove that…
We prove a sharp upper bound on the number of boundary lattice points of a rational polygon in terms of its denominator and the number of interior lattice points, generalizing Scott's inequality. We then give sharp lower and upper bounds on…
We classify perimeter dominant triangles whose side lengths are in $\sqrt3\mathbb N$ and whose area is in $\frac{\sqrt3}4\mathbb N$. There is one exceptional example, which is equilateral, and three infinite families determined by certain…
Toeplitz conjectured that any simple planar loop inscribes a square. Here we prove variants of Toeplitz' square peg problem. We prove Hadwiger's 1971 conjecture that any simple loop in $3$-space inscribes a parallelogram. We show that any…
In a recent paper, Cristofaro-Gardiner--Li--Stanley [CGLS15] constructed examples of irrational triangles whose Ehrhart functions (i.e. lattice-point count) are polynomials when restricted to positive integer dilation factors. This is very…
In 1984, Erd\H{o}s conjectured that the number of pentagons in any triangle-free graph on $n$ vertices is at most $(n/5)^5$, which is sharp by the balanced blow-up of a pentagon. This was proved by Grzesik, and independently by Hatami,…
The linearizability of differential equations was first considered by Lie for scalar second order semi-linear ordinary differential equations. Since then there has been considerable work done on the algebraic classification of linearizable…
We prove that the number of cyclically symmetric, self-complementary plane partitions contained in a cube of side $2n$ equals the square of the number of totally symmetric, self-complementary plane partitions contained in the same cube,…
An $N$-dimensional parallelepiped will be called a bar if and only if there are no more than $k$ different numbers among the lengths of its sides (the definition of bar depends on $k$). We prove that a parallelepiped can be dissected into…
We recall the Alon-Tarsi conjecture on the number of even latin squares. We introduce a map which switches the parity of a latin square under certain requirements. An example is included.
One of the most fundamental open problems in Incidence Geometry, posed by Tits in the 1960s, asks for the existence of so-called "locally finite generalized polygons" | that is, generalized polygons with "mixed parameters" (one being finite…
In this paper, we study the geometry of trisections on certain rational elliptic surfaces. We utilize Mumford representations of semi-reduced divisors in order to construct trisections and related plane curves with interesting properties…
We say that a polygon inscribed in the circle is asymmetric if it contains no two antipodal points being the endpoints of a diameter. Given $n$ diameters of a circle and a positive integer $k<n$, this paper addresses the problem of…
A balanced partition is a clustering of a graph into a given number of equal-sized parts. For instance, the Bisection problem asks to remove at most k edges in order to partition the vertices into two equal-sized parts. We prove that…
We establish a new notion of tropical convexity for signed tropical numbers. We provide several equivalent descriptions involving balance relations and intersections of open halfspaces as well as the image of a union of polytopes over…
An orthogonality space is a set equipped with a symmetric, irreflexive relation called orthogonality. Every orthogonality space has an associated complete ortholattice, called the logic of the orthogonality space. To every poset, we…
Given $n$ pairwise openly disjoint triangles in 3-space, their vertical depth relation may contain cycles. We show that, for any $\varepsilon>0$, the triangles can be cut into $O(n^{3/2+\varepsilon})$ connected semi-algebraic pieces, whose…