Related papers: Covering of a rectangle by squares

We show that it is possible to decide whether a given planar diagram correctly depicts the spatial figure consisting of a planar quadrangle together with its shadow in another plane.

The main goal of this paper is to address the following problem: given a positive integer $n$, find the largest value $S(n)$ such that a square of edge length $S(n)$ in the Euclidean plane can be covered by $n$ unit squares. We investigate…

In 2003 it was proved that the open quadrant $\{x>0,y>0\}$ of ${\mathbb R}^2$ is a polynomial image of ${\mathbb R}^2$. This result was the origin of an ulterior more systematic study of polynomial images of Euclidean spaces. In this…

We prove that, given any covering of any separable infinite-dimensional uniformly rotund and uniformly smooth Banach space $X$ by closed balls each of positive radius, some point exists in $X$ which belongs to infinitely many balls.

By rectangle packing we mean putting a set of rectangles into an enclosing rectangle, without any overlapping. We begin with perfect rectangle packing problems, then prove two continuity properties for parallel rectangle packing problems,…

We show that the cylinder Z^{2n}(1):= B^2(1)\times \mathbb{R}^{2(n-1)} embeds symplectically into B^4(R) \times \mathbb{R}^{2(n-2)} if R \geq \sqrt{3}.

Consider an arrangement of $k$ lines intersecting the unit square. There is some minimum scaling factor so that any placement of a rectangle with aspect ratio $1 \times p$ with $p\geq 1$ must non-transversely intersect some portion of the…

We show that if $\alpha$ is a positive $(2,2)$-form then so is $\alpha^2$. We also prove that this is no longer true for forms of higher degree.

This article proves a Pythagoras-type formula for the sides and diagonals of a polygon inscribed in a semicircle having one of the sides of the polygon as diameter.

A rectangular layout is a partition of a rectangle into a finite set of interior-disjoint rectangles. Rectangular layouts appear in various applications: as rectangular cartograms in cartography, as floorplans in building architecture and…

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,…

In this paper, we prove that $\mathbb{P}^2$ blown up at seven general points admits a conic bundle structure over $\mathbb{P}^1$ and it can be embedded as $(2,2)$ divisor in $\mathbb{P}^{1}\times\mathbb{P}^{2}$. Conversely, any smooth…

We study the covering path problem on a grid of R^{2}. We generalize earlier results on a rectangular grid and prove that the covering path cost can be bounded by the area and perimeter of the grid. We provide (2+\epsilon) and…

We provide a counterexample to some statements dealing with a sufficient property for the square of a matrix to be a $P_0^+$ -matrix.

In this paper, the following two theorems are proved: $(1)$ every spherical convex body $W$ of constant width $\Delta (W) \geq \frac{\pi}{2}$ may be covered by a disk of radius $\Delta(W) + \arcsin \left( \frac{2\sqrt{3}}{3} \cdot \cos…

Given an elliptic quartic of type $Y^2=f(X)$ representing an elliptic curve of positive rank over $\Q$, we investigate the question of when the $Y$-coordinate can be represented by a quadratic form of type $ap^2+bq^2$. In particular, we…

In this paper we study the lattice point covering property of some regular polygons in dimension 2.

Let $P$ and $Q$ be simple polygons with $n$ vertices each. We wish to compute triangulations of $P$ and $Q$ that are combinatorially equivalent, if they exist. We consider two versions of the problem: if a triangulation of $P$ is given, we…

We give an explicit formula for a 2-fold branched covering from $\mathbb{CP}^2$ to $S^4$, and relate it to other maps between quotients of $S^2\times{S^2}$.

This paper attacks the following problem. We are given a large number $N$ of rectangles in the plane, each with horizontal and vertical sides, and also a number $r<N$. The given list of $N$ rectangles may contain duplicates. The problem is…