Related papers: On Dividing a Rectangle
The theorem on squaring a rectangle from a tiling of a quadrilateral (Schramm and Cannon-Floyd-Parry) gives a combinatorial version of the Riemann mapping theorem. We elucidate by example (the dumbbell) some of the limitations of…
Graph partitioning, or the dividing of a graph into two or more parts based on certain conditions, arises naturally throughout discrete mathematics, and problems of this kind have been studied extensively. In the 1990s, Ando conjectured…
Place the vertices of a rectangle at $\{(0, \pm 1/2), (a, \pm 1/2)\}$, where $a$ is rational. We show that if $v_3(a) = 0$, then any point $(x,y)$ that is rational distance from all four vertices of the rectangle has either $v_3(x) < 0$ or…
We prove an integral formula for continuous paths of rectangles inscribed in a piecewise smooth loop. We then use this integral formula to show that (with a very mild genericity hypothesis) the number of rectangle coincidences, informally…
This paper investigates defining equations for secant varieties of the variety of reducible polynomials, which geometrically encode the notions of strength and slice rank of homogeneous polynomials. We present three main results. First, we…
A degree-regular triangulation is one in which each vertex has identical degree. Our main result is that any such triangulation of a (possibly non-compact) surface $S$ is geometric, that is, it is combinatorially equivalent to a geodesic…
The problem that we consider is the following: given an $n \times n$ array $A$ of positive numbers, find a tiling using at most $p$ rectangles (which means that each array element must be covered by some rectangle and no two rectangles must…
We consider the covering of a ball in certain normed spaces by its congruent subsets and show that if the finite number of sets is not greater than the dimensionality of the space, then the centre of the ball either belongs to the interior…
We study the structure of the set of all possible affine hyperplane sections of a convex polytope. We present two different cell decompositions of this set, induced by hyperplane arrangements. Using our decomposition, we bound the number of…
We study a new variant of colored orthogonal range searching problem: given a query rectangle $Q$ all colors $c$, such that at least a fraction $\tau$ of all points in $Q$ are of color $c$, must be reported. We describe several data…
We consider a problem in computational origami. Given a piece of paper as a convex polygon $P$ and a point $f$ located within, fold every point on a boundary of $P$ to $f$ and compute a region that is safe from folding, i.e., the region…
We study the relationship between the areas of the consecutive quadrilaterals cut from a convex quadrilateral in the plane by means of a finite or infinite number of straight lines intersecting two of its opposite sides. Moreover, we obtain…
The separation of two sets (or more specific of two cones) plays an important role in different fields of mathematics such as variational analysis, convex analysis, convex geometry, optimization. In the paper, we derive some new results for…
Planar bipartite graphs can be represented as touching graphs of horizontal and vertical segments in $\mathbb{R}^2$. We study a generalization in space: touching graphs of axis-aligned rectangles in $\mathbb{R}^3$, and prove that planar…
Let $K$ and $L$ be two convex bodies in ${\mathbb R^4}$, such that their projections onto all $3$-dimensional subspaces are directly congruent. We prove that if the set of diameters of the bodies satisfy an additional condition and some…
Given any positive integer n, we prove the existence of infinitely many right triangles with area n and side lengths in certain number fields. This generalizes the famous congruent number problem. The proof allows the explicit construction…
This paper is a brief account of the Steklov eigenvalue problem on a 2-dimensional rectangular domain, and then on a 3-dimensional rectangular box. It is divided into four sections. Section 1 relies heavily on real analytic methods to show…
This habilitation thesis summarizes the research that I have carried out from 2005 to 2019. It is organized in four chapters. The first three deal with random planar maps. Chapter 1 is about their metric properties: from a general…
We analyze the problem of quadrangulating a $n$-sided patch, each side at its boundary subdivided into a given number of edges, using a single irregular vertex (or none, when $n = 4$) that breaks the otherwise fully regular lattice. We…
We prove a splitting theorem for a smooth noncompact manifold with (possibly noncompact) boundary. We show that if a noncompact manifold of dimension $n\geq 2$ has $\lambda_1(-\alpha\Delta+\operatorname{Ric})\geq 0$ for some…