Related papers: Lattice Surfaces and smallest triangles
In this paper we address the problem of finding well approximating lattices for a given finite set $A$ of points in ${\mathbb R}^n$. More precisely, we search for $\v{o},\v{d_1}, \dots,\v{d_n}\in \mathbb{R}^n$ such that $\v{a}-\v{o}$ is…
Motivated by lattice mixture identification and grain boundary detection, we present a framework for lattice pattern representation and comparison, and propose an efficient algorithm for lattice separation. We define new scale and shape…
We consider surface area approximations by Lagrange and Crouzeix--Raviart interpolations on triangulations. For Lagrange interpolation, we give an alternative proof for Young's classical result that claims the areas of inscribed polygonal…
In the first part of this paper we show that a set $E$ has locally finite $s$-perimeter if and only if it can be approximated in an appropriate sense by smooth open sets. In the second part we prove some elementary properties of local and…
A lattice is called well-rounded, if its lattice vectors of minimal length span the ambient space. We show that there are interesting connections between the existence of well-rounded sublattices and coincidence site lattices (CSLs).…
The moduli space of triangles is a two-dimensional space that records triangle shapes in the plane, considered up to similarity. We study the subset corresponding to \textit{lattice triangles}, which are triangles whose vertices have…
We prove an improvement of flatness result for nonlocal minimal surfaces which is independent of the fractional parameter $s$ when $s\rightarrow 1^-$. As a consequence, we obtain that all the nonlocal minimal cones are flat and that all the…
P\'al's isominwidth theorem states that for a fixed minimal width, the regular triangle has minimal area. A spherical version of this theorem was proven by Bezdek and Blekherman, if the minimal width is at most $\tfrac \pi 2$. If the width…
We classify rational triangles which unfold to Veech surfaces when the largest angle is at least $\frac{3\pi}{4}$. When the largest angle is greater than $\frac{2\pi}{3}$, we show that the unfolding is not Veech except possibly if it…
An implementation of BFACF-style algorithms on knotted polygons in the simple cubic, face centered cubic and body centered cubic lattice is used to estimate the statistics and writhe of minimal length knotted polygons in each of the…
An N-tiling of triangle ABC by triangle T is a way of writing ABC as a union of N triangles congruent to T, overlapping only at their boundaries. The triangle T is the "tile". The tile may or may not be similar to ABC. We wish to understand…
The number of complete tilings of m X n floors for tiles of shape 1 X 2, 1 X 3, 1 X 4 and 2 X 3 is computed numerically for floors up to width m=9 and variable floor lengths n. Counts are obtained for two classes, for fixed tile stack…
Our main result essentially reduces the problem of finding an edge-decomposition of a balanced r-partite graph of large minimum degree into r-cliques to the problem of finding a fractional r-clique decomposition or an approximate one.…
A tiling of the unit square is an MTP tiling if the smallest tile can tile all the other tiles. We look at the function $f(n)=\max \sum s_i$, where $s_i$ is the side length of the $i$th tile and the sum is taken over all MTP tilings with…
The Shortest Lattice Vector (SLV) problem is in general hard to solve, except for special cases (such as root lattices and lattices for which an obtuse superbase is known). In this paper, we present a new class of SLV problems that can be…
How complex must two finite 2-complexes be to admit a common, but not finite common, covering? We obtain an almost answer: the minimum possible number of triangles in a pseudo-simplicial triangulation of each complex is 3, 4, or 5.
We present a new algorithm for the design of the connection region between different lattice materials. We solve a Stokes-type topology optimization problem on a narrow morphing region to smoothly connect two different unit cells. The…
For k>6, we determine the minimal area of a compact hyperbolic surface, and an oriented compact hyperbolic surface that can be tiled by embedded regular triangles of angle 2\pi/k. Based on this, all the cases of equality in Laszlo Fejes…
We prove that the least-perimeter partition of the sphere into four regions of equal area is a tetrahedral partition.
Among integral polytopes (vertices with integral coordinates), lattice-free polytopes - intersecting the lattice ONLY at their vertices- are of particular interestin combinatorics and geometry of numbers. A natural question is to measure…