Related papers: Minimal tilings of a unit square
We study three covering problems in the plane. Our original motivation for these problems come from trajectory analysis. The first is to decide whether a given set of line segments can be covered by up to four unit-sized, axis-parallel…
The conformal structure on minimal surfaces plays a key role in studying the properties of minimal surfaces. Here we extend the results of uniformization of surfaces with boundary to get the (weak) uniformization results for triple junction…
For $n,\,d\ge1$ let $p(n,2d)$ denote the smallest number $p$ such that every sum of squares of forms of degree $d$ in $\mathbb{R}[x_1,\dots,x_n]$ is a sum of $p$ squares. We establish lower bounds for these numbers that are considerably…
A subset $\mathcal{A}\subseteq\mathbb{Z}$ is called $s$-almost square universal if every sufficiently large positive integer can be written as a sum of at most $s$ squares of integers from $\mathcal{A}$. In this article, we study the…
We associate strand diagrams to tilings of surfaces with marked points, generalising Scott's method for triangulations of polygons. We thus obtain a map from tilings of surfaces to permutations of the marked points on boundary components,…
We prove that almost every triangle can be dissected only into $n^2$ triangles which have to be equal one another. Moreover, such a dissection is unique for every $n$. It turns out that to solve this "simple" problem it is convenient to use…
Consider a random permutation of $kn$ objects that permutes $n$ disjoint blocks of size $k$ and then permutes elements within each block. Normalizing its cycle lengths by $kn$ gives a random partition of unity, and we derive the limit law…
We prove that the number of tile types required to build squares of size n x n, in Winfree's abstract Tile Assembly Model, when restricted to using only non-cooperative tile bindings, is at least 2n-1, which is also the best known upper…
In this paper, we study the structure of the set of tilings produced by any given tile-set. For better understanding this structure, we address the set of finite patterns that each tiling contains. This set of patterns can be analyzed in…
In this article, we study short intervals that contain another type of "almost square", an integer $n$ which can be factored in two different ways $n = a_1 b_1 = a_2 b_2$ with $a_1, a_2, b_1, b_2$ close to $\sqrt{n}$.
We prove that singular minimal surfaces with constant Gauss curvature are planes, spheres and cylindrical surfaces. We also classify all singular minimal surfaces with a constant principal curvature and singular minimal surfaces with…
Methodology is provided towards the solution of the minimum enclosing ball problem. This problem concerns the determination of the unique spherical surface of smallest radius enclosing a given bounded set in the d-dimensional Euclidean…
A study of 7-fold tilings that use a set of three proto-rhombs in a substitution scheme to tile a large area. A set is discovered that is thought to be the most minimal or smallest one. The scheme uses 11 proto-rhombs to tile the next…
Magic squares are well-known arrangements of integers with common row, column, and diagonal sums. Various other magic shapes have been proposed, but triangles have been somewhat overlooked. We introduce certain triangular arrangements of…
We study a divisor computing the minimal log discrepancy on a smooth surface. Such a divisor is obtained by a weighted blow-up. There exists an example of a pair such that any divisor computing the minimal log discrepancy computes no log…
We wish to tile a rectangle or a torus with only vertical and horizontal bars of a given length, such that the number of bars in every column and row equals given numbers. We present results for particular instances and for a more general…
We consider so-called squaring the square-puzzles where a given square (or rectangle) should be dissected into smaller squares. For a specific instance of such problems we demonstrate that a mathematically rigorous solution can be quite…
Any finite configuration of curves with minimal intersections on a surface is a configuration of shortest geodesics for some Riemannian metric on the surface. The metric can be chosen to make the lengths of these geodesics equal to the…
We give a complete solution to the extremal topological combinatorial problem of finding the minimum number of tiles needed to construct a polyomino with $h$ holes. We denote this number by $g(h)$ and say that a polyomino is crystallized if…
Generalising the two-dimensional case, we provide estimates for the mean-values of the lengths of the edges of an integral box with given volume and minimal surface.