Related papers: Squaring rectangles for dumbbells
These notes on Riemannian geometry use the bases bundle and frame bundle, as in Geometry of Manifolds, to express the geometric structures. It has more problems and omits the background material. It starts with the definition of Riemannian…
We introduce {\em quadri-tilings} and show that they are in bijection with dimer models on a {\em family} of graphs $\{R^*\}$ arising from rhombus tilings. Using two height functions, we interpret a sub-family of all quadri-tilings, called…
We consider the following geometric optimization problem: Given $ n $ axis-aligned rectangles in the plane, the goal is to find a set of horizontal segments of minimum total length such that each rectangle is stabbed. A segment stabs a…
Rectangulations are partitions of a square into axis-aligned rectangles. A number of results provide bijections between combinatorial equivalence classes of rectangulations and families of pattern-avoiding permutations. Other results deal…
We prove quartic convergence of cubic spline interpolation for curves into Riemannian manifolds as the grid size of the interpolation grid tends to zero. In contrast to cubic spline interpolation in Euclidean space, where this result is…
We prove a formula involving the scalar curvature of a Riemannian manifold endowed with a distribution in terms of an adapted orthonormal frame for its tangent bundle. Using the formula, we then investigate the effect of collapsing the…
Recently, mirror symmetry is derived as T-duality applied to gauge systems that flow to non-linear sigma models. We present some of its applications to study quantum geometry involving D-branes. In particular, we show that one can employ…
We develop a recursive formula for counting the number of rectangulations of a square, i.e the number of combinatorially distinct tilings of a square by rectangles. Our formula specializes to give a formula counting generic rectangulations,…
While it is a classical result dating back to Dehn (1903) that squares composing a perfect rectangle must have rational side lengths, the arithmetic complexity of these tilings, specifically the growth of the denominators of these rational…
We study constructing an algebraic curve from a Riemann surface given via a translation surface, which is a collection of finitely many polygons in the plane with sides identified by translation. We use the theory of discrete Riemann…
Every simple quadrangulation of the sphere is generated by a graph called a pseudo-double wheel with two local expansions (Brinkmann et al. "Generation of simple quadrangulations of the sphere." Discrete Math., Vol. 305, No. 1-3, pp. 33-54,…
We describe a simple algorithm that computes the recently discovered brane tilings for a given generic toric singular Calabi-Yau threefold. This therefore gives AdS/CFT dual quiver gauge theories for D3-branes probing the given non-compact…
We show that a square-tiling of a $p\times q$ rectangle, where $p$ and $q$ are relatively prime integers, has at least $\log_2p$ squares. If $q>p$ we construct a square-tiling with less than $q/p+C\log p$ squares of integer size, for some…
In this paper we give results about projective embeddings of Riemann surfaces, smooth or nodal, which we apply to the inverse Dirichlet-to-Neumann problem and to the inversion of a Riemann-Klein theorem. To produce useful embeddings, we…
Any three-dimensional Riemannian metric can be locally obtained by deforming a constant curvature metric along one direction. The general interest of this result, both in geometry and physics, and related open problems are stressed.
We describe a polynomial time algorithm that takes as input a polygon with axis-parallel sides but irrational vertex coordinates, and outputs a set of as few rectangles as possible into which it can be dissected by axis-parallel cuts and…
We consider tilings of quadriculated regions by dominoes and of triangulated regions by lozenges. We present an overview of results concerning tileability, enumeration and the structure of the space of tilings.
It is investigated how two (standard or generalized) $\lambda-$symmetries of a given second-order ordinary differential equation can be used to solve the equation by quadratures. The method is based on the construction of two commuting…
Conway and Lagarias showed that certain roughly triangular regions in the hexagonal grid cannot be tiled by shapes Thurston later dubbed tribones. Here we study a two-parameter family of roughly hexagonal regions in the hexagonal grid and…
In this paper, we prove that if a finite number of rectangles, every of which has at least one integer side, perfectly tile a big rectangle then there exists a strategy which reduces the number of these tiles (rectangles) without violating…