English
Related papers

Related papers: A square from similar rectangles

200 papers

Rectangulations are decompositions of a square into finitely many axis-aligned rectangles. We describe realizations of $(n-1)$-dimensional polytopes associated with two combinatorial families of rectangulations composed of $n$ rectangles.…

Combinatorics · Mathematics 2025-06-30 Jean Cardinal , Vincent Pilaud

In this paper, we continue the study of almost squares and extend the result of the author's fourth paper of the series to almost squares with closer factors.

Number Theory · Mathematics 2015-01-05 Tsz Ho Chan

Dissections of polytopes are a well-studied subject by geometers as well as recreational mathematicians. A recent application in coding theory arises from the problem of parameterizing binary vectors of constant Hamming weight which has…

Information Theory · Computer Science 2015-06-15 Antonio Campello , Vinay A. Vaishampayan

Separation is a classical problem in mathematics and computer science. It asks whether, given two sets belonging to some class, it is possible to separate them by another set of a smaller class. We present and discuss the separation problem…

Formal Languages and Automata Theory · Computer Science 2013-03-12 Lorijn van Rooijen , Marc Zeitoun

Segregation is a popular phenomenon. It has considerable effects on material performance. To the author's knowledge, there is still no automated objective quantitative indicator for segregation. In order to full fill this task, segregation…

Computer Vision and Pattern Recognition · Computer Science 2015-11-30 Ting Peng , Aiping Qu , Xiaoling Wang

In this paper, we deal with a simple geometric problem: Is it possible to partition a rectangle into $k$ non-congruent rectangles of equal area? This problem is motivated by the so-called `Mondrian art problem' that asks a similar question…

Combinatorics · Mathematics 2020-07-21 C. Dalfó , M. A. Fiol , N. López , A. Martínez-Pérez

We provide a remarkably simple algorithm to compute all (at most four) common tangents of two disjoint simple polygons. Given each polygon as a read-only array of its corners in cyclic order, the algorithm runs in linear time and constant…

Computational Geometry · Computer Science 2018-12-11 Mikkel Abrahamsen , Bartosz Walczak

The square of a connected graph $G$ is obtained from $G$ by adding an edge between every pair of vertices at distance $2$. In this paper we give some upper or lower bounds for the spectral radius of the square of connected graphs, trees and…

Combinatorics · Mathematics 2014-04-30 Yi-Zheng Fan , Long Wang

The squircle is an intermediate shape between the square and the circle. In this paper, we examine and discuss equations for different types of squircles. We then build upon these 2D shapes to come-up with various 3D surfaces based on…

Graphics · Computer Science 2023-02-21 Chamberlain Fong

A projective rectangle is like a projective plane that has different lengths in two directions. We develop the basic theory of projective rectangles including incidence properties, projective subplanes, configuration counts, a partial…

Combinatorics · Mathematics 2024-07-17 Rigoberto Florez , Thomas Zaslavsky

An example of reversible (or hinge inside-out transformable) figures is the Dudeney's Haberdasher's puzzle in which an equilateral triangle is dissected into four pieces, then hinged like a chain, and then is transformed into a square by…

Computational Geometry · Computer Science 2016-07-05 Jin Akiyama , Stefan Langerman , Kiyoko Matsunaga

A mathematical donut is a rectangle of integral side length with a smaller rectangle (called the hole of the donut), also of integral side length, strictly inside it and with sides of the rectangles parallel to each other, where the area of…

Number Theory · Mathematics 2024-06-04 Kevin Murawski , Neil R. Nicholson , Kathleen Walsh

In this article, the notion of a mathematical model in science is attempted to be enlightened from several points of view. In particular, it is shown that mathematical models are introduced differently and used differently in different…

History and Overview · Mathematics 2022-05-25 Inge S. Helland

This paper discusses the permutations that are generated by rotating $k \times k$ blocks of squares in a union of overlapping $k \times (k+1)$ rectangles. It is found that the single-rotation parity constraints effectively determine the…

Combinatorics · Mathematics 2014-04-24 Ravi Montenegro , David A. Huckaby , Elaine White Harmon

In 1907, Henry Ernest Dudeney posed a puzzle: ``cut any equilateral triangle \dots\ into as few pieces as possible that will fit together and form a perfect square'' (without overlap, via translation and rotation). Four weeks later, Dudeney…

Computational Geometry · Computer Science 2025-08-04 Erik D. Demaine , Tonan Kamata , Ryuhei Uehara

Let P be a point inside a convex quadrilateral ABCD. The lines from P to the vertices of the quadrilateral divide the quadrilateral into four triangles. If we locate a triangle center in each of these triangles, the four triangle centers…

General Mathematics · Mathematics 2022-09-14 Stanley Rabinowitz , Ercole Suppa

We prove a formula which compares intersection numbers of conormal varieties of two projective varieties and their dual varieties. When one of them is linear, we can recover the usual Plucker formula for the degree of the dual variety. The…

Algebraic Geometry · Mathematics 2007-05-23 Naichung Conan Leung

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.

General Mathematics · Mathematics 2014-03-17 P. L. Robinson

We study when an arrangement of axis-aligned rectangles can be transformed into an arrangement of axis-aligned squares in $\mathbb{R}^2$ while preserving its structure. We found a counterexample to the conjecture of J. Klawitter, M.…

Computational Geometry · Computer Science 2016-11-24 Matěj Konečný , Stanislav Kučera , Michal Opler , Jakub Sosnovec , Štěpán Šimsa , Martin Töpfer

We show that we can obtain a reducible spherical curve from any non-trivial spherical curve by four or less inverse-half-twisted splices, i.e., the reductivity, which represents how reduced a spherical curve is, is four or less. We also…

Geometric Topology · Mathematics 2014-01-17 Ayaka Shimizu