Related papers: Affine isoperimetric inequalities for piecewise li…
A polytope in a finite-dimensional normed space is subequilateral if the length in the norm of each of its edges equals its diameter. Subequilateral polytopes occur in the study of two unrelated subjects: surface energy minimizing cones and…
This article describes the geometry of isomorphisms between complements of geometrically irreducible closed curves in the affine plane $\mathbb{A}^2$, over an arbitrary field, which do not extend to an automorphism of $\mathbb{A}^2$. We…
One can embed arbitrarily many disjoint, non-parallel, non-boundary parallel, incompressible surfaces in any three manifold with at least one boundary component of genus two or greater [4]. This paper proves the contrasting, but not…
A triangulation of a surface is \emph{irreducible} if there is no edge whose contraction produces another triangulation of the surface. We prove that every irreducible triangulation of a surface with Euler genus $g\geq1$ has at most $13g-4$…
We consider embeddings of planar graphs in $R^2$ where vertices map to points and edges map to polylines. We refer to such an embedding as a polyline drawing, and ask how few bends are required to form such a drawing for an arbitrary planar…
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$…
The isoperimetric problem asks for the maximum area of a region of given perimeter. It is natural to consider other measurements of a region, such as the diameter and width, and ask for the extreme value of one when another is fixed. The…
New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…
We prove the existence of a one parameter family of minimal embedded hypersurfaces in $R^{n+1}$, for $n \geq 3$, which generalize the well known 2 dimensional "Riemann minimal surfaces". The hypersurfaces we obtain are complete, embedded,…
It is well known that isoperimetric regions in a smooth compact $(n+1)$-manifold are smooth, up to a closed set of codimension at most $6$. In this note, we first construct an $8$-dimensional compact smooth manifold whose unique…
We prove an upper bound of the form $2^{O(d^2 \mathrm{polylog}\,d)}$ on the number of affine (resp. linear) equivalence classes of, by increasing order of generality, 2-level d-polytopes, d-cones and d-configurations. This in particular…
Let $(M^n,g)$ be simply connected, complete, with non-positive sectional curvatures, and $\Sigma$ a 2-dimensional closed integral current (or flat chain mod 2) with compact support in $M$. Let $S$ be an area minimising integral 3-current…
We prove that the boundary of the trapped region in an asymptotically Euclidean Riemannian manifold of dimension at least 3 is a stable smooth minimal hypersurface except for a singular set of codimension at least 8.
How much cutting is needed to simplify the topology of a surface? We provide bounds for several instances of this question, for the minimum length of topologically non-trivial closed curves, pants decompositions, and cut graphs with a given…
A triangulation of a punctured or pinched surface is irreducible if no edge can be shrunk without producing multiple edges or changing the topological type of the surface. The finiteness of the set of (non-isomorphic) irreducible…
We provide sharp bounds for the isoperimetric constants of infinite plane graphs (tessellations) with bounded vertex and face degrees. For example, if $G$ is a plane graph satisfying the inequalities $p_1 \leq \mbox{deg}\ v \leq p_2$ for $v…
We show that arithmetic subgroups of semisimple groups of relative Q-type A_n, B_n, C_n, D_n, E_6, or E_7 have an exponential lower bound to their isoperimetric inequality in the dimension that is 1 less than the real rank of the semisimple…
We analyze the computational complexity of several new variants of edge-matching puzzles. First we analyze inequality (instead of equality) constraints between adjacent tiles, proving the problem NP-complete for strict inequalities but…
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…
Locally isoperimetric $N$-partitions are partitions of the space $\mathbb R^d$ into $N$ regions with prescribed, finite or infinite measure, which have minimal perimeter (which is the $(d-1)$-dimensional measure of the interfaces between…