Related papers: On triangulations with fixed areas

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…

We prove that the genus of a finite-dimensional division algebra is finite whenever the center is a finitely generated field of any characteristic. We also discuss potential applications of our method to other problems, including the…

For stacked simplicial complexes, (special subclasses of such are: trees, triangulations of polygons, stacked polytopes), we give an explicit bijection between partitions of facets (for trees: edges), and partitions of vertices into…

We prove some uniqueness results for conics of minimal area that enclose a compact, full-dimensional subset of the elliptic plane. The minimal enclosing conic is unique if its center or axes are prescribed. Moreover, we provide sufficient…

We give a simple proof of T. Stehling's result, that in any normal tiling of the plane with convex polygons with number of sides not less than six, all tiles except the finite number are hexagons.

Let $K$ be a convex pentagon in the plane and let $K_1$ be the pentagon bounded by the diagonals of $K$. It has been conjectured that the maximum of the ratio between the areas of $K_1$ and $K$ is reached when $K$ is an affine regular…

We present a simple proof that finding a rank-$R$ canonical polyadic decomposition of a 3-dimensional tensor over a finite field $\mathbb{F}$ is fixed-parameter tractable with respect to $R$ and $\mathbb{F}$. We also show a nontrivial upper…

We show that the number of partial triangulations of a set of $n$ points on the plane is at least the $(n-2)$-nd Catalan number. This is tight for convex $n$-gons. We also describe all the equality cases.

We show that if a flat group scheme acts properly, with finite stabilizers, on an algebraic space, then a quotient exists as a separated algebraic space. More generally we show any flat groupid for which the family of stabilizers is finite…

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…

This paper investigates the rigidity of bordered polyhedral surfaces. Using the variational principle, we show that bordered polyhedral surfaces are determined by boundary value and discrete curvatures on the interior edges. As a corollary,…

We study oriented connected closed polyhedral surfaces with non-degenerate triangular faces in three-dimensional Euclidean space, calling them polyhedra for short. A polyhedron is called flexible if its spatial shape can be changed…

Every partition of [[omega_1]^{< omega}]^2 into finitely many pieces has a cofinal homogeneous set. Furthermore, it is consistent that every directed partially ordered set satisfies the partition property if and only if it has finite…

Many questions about triangles and quadrilaterals with rational sides, diagonals and areas can be reduced to solving certain Diophantine equations. We look at a number of such questions including the question of approximating arbitrary…

We provide an internal characterization of those finite algebras (i.e., algebraic structures) $\mathbf A$ such that the number of homomorphisms from any finite algebra $\mathbf X$ to $\mathbf A$ is bounded from above by a polynomial in the…

We connect k-triangulations of a convex n-gon to the theory of Schubert polynomials. We use this connection to prove that the simplicial complex with k-triangulations as facets is a vertex-decomposable triangulated sphere, and we give a new…

Paul Erd\H{o}s and R. Daniel Mauldin asked a series of questions on certain types of polygons of area $1$, the vertices of which can be found in every planar set of infinite Lebesgue measure. We address two of these questions, one on cyclic…

Counting Euclidean triangulations with vertices in a finite set $\C$ of the convex hull $\conv(\C)$ of $\C$ is difficult in general, both algorithmically and theoretically. The aim of this paper is to describe nearly convex polygons, a…

We present a polynomial partitioning theorem for finite sets of points in the real locus of an irreducible complex algebraic variety of codimension at most two. This result generalizes the polynomial partitioning theorem on the Euclidean…

We consider the combinatorial question of how many convex polygons can be made by using the edges taken from a fixed triangulation of n vertices. For general triangulations, there can be exponentially many: we show a construction that has…