Related papers: Grid dissections of tangential quadrilaterals

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 two polygons of equal area can be partitioned into congruent sets of polygonal pieces, and in many cases one can connect the pieces by flexible hinges while still allowing the connected set to form both polygons. However it is open…

A procedure that generates parallelograms from any quadrilateral is presented. If the original quadrilateral is itself a parallelogram, then the procedure gives squares. Hence, when applied two times, this procedure generates squares from…

For $n>3$, every $n\times n$ partial Cayley matrix with at most $n-1$ holes can be reconstructed by quadrangle criterion. Moreover, the holes can be filled in given order. Without additional assumptions, this is the best possible result.…

In the present popular-science paper, we find out which rectangles can be dissected into squares. The proof is based on a physical interpretation in terms of electrical networks. Only a secondary school background is assumed in the paper.

The Brattelli diagram associated with a given bicolored Dynkin-Coxeter graph of type $A_n$ determines planar fractal sets obtained by infinite dissections of a given triangle. All triangles appearing in the dissection process have angles…

In this paper, we show that an equilateral triangle cannot be dissected into finitely many smaller equilateral triangles, no two of which share two vertices. We do this without the use of Electrical Networks.

We give a computer-based proof of the following fact: If a square is divided into seven or nine convex polygons, congruent among themselves, then the tiles are rectangles.

In this paper, we study partitions of positive integers with restrictions involving squares. We mainly establish the following two results (which were conjectured by Sun in 2013): (i) Each positive integer $n$ can be written as $n=x+y+z$…

In this paper, we construct infinitely many quadruples of real quadratic fields whose class numbers are all divisible by $3$. To the best of our knowledge, this is the first result towards the divisibility of the class numbers of certain…

All previously published work on isomorphic grid embeddings into n-cubes has been restricted to binary n-cubes. This paper describes a straightforward method for embedding a A x B grid isomorphically into a k-ary n-cube with k>2.

It is unknown at present whether a magic square of squared integers exists. Such an object is defined to be a 3 by 3 grid of 9 distinct integer squares, such that the entries of each row, column, and two main diagonals sum to the same…

Square-tiled surfaces can be classified by their number of squares and their cylinder diagrams (also called realizable separatrix diagrams). For the case of $n$ squares and two cone points with angle $4 \pi$ each, we set up and parametrize…

In this work we study inside-out dissections of polygons and polyhedra. We first show that an arbitrary polygon can be inside-out dissected with $2n+1$ pieces, thereby improving the best previous upper bound of $4(n-2)$ pieces.…

An $N$-dimensional parallelepiped will be called a bar if and only if there are no more than $k$ different numbers among the lengths of its sides (the definition of bar depends on $k$). We prove that a parallelepiped can be dissected into…

We prove upper and lower bounds on the size of the largest square grid graph that is a subgraph, minor, or shallow minor of a graph in the form of a larger square grid from which a specified number of vertices have been deleted. Our bounds…

For two positive integers $r$ and $s$ with $r\geq 2s-2$, if $G$ is a graph of order $3r+4s$ such that $d(x)+d(y)\geq 4r+4s$ for every $xy\not\in E(G)$, then $G$ independently contains $r$ triangles and $s$ quadrilaterals, which partially…

In this paper we determine sufficient conditions for a quaternion algebra to split over a quadratic field. In the last section of the paper, we find a class of division symbol algebras of degree $n$ (where $n$ is a positive integer, $n\geq…

In this paper, we construct certain infinite families of imaginary quadratic fields whose class number is divisible by a given positive integer.

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…