English
Related papers

Related papers: Smallest Squared Squares

200 papers

We consider a special type of self-similar sets, called fractal squares, and give a brief review on recent results and unsolved issues with an emphasis on their topological properties.

General Topology · Mathematics 2025-10-07 Jun Luo , Hui Rao

A homothetic packing of squares is any set of various-size squares with the same orientation where no two squares have overlapping interiors. If all $n$ squares have the same size then we can have up to roughly $4n$ contacts by arranging…

Combinatorics · Mathematics 2023-10-26 Sean Dewar

We study several variations of line segment covering problem with axis-parallel unit squares in $I\!\!R^2$. A set $S$ of $n$ line segments is given. The objective is to find the minimum number of axis-parallel unit squares which cover at…

Computational Geometry · Computer Science 2016-09-28 Ankush Acharyya , Subhas C. Nandy , Supantha Pandit , Sasanka Roy

Given a closed polygon P having n edges, embedded in R^d, we give upper and lower bounds for the minimal number of triangles t needed to form a triangulated PL surface in R^d having P as its geometric boundary. The most interesting case is…

Geometric Topology · Mathematics 2007-05-23 Joel Hass , Jeffrey C. Lagarias

In this paper, we prove that for any $k\ge 3$, there exist infinitely many minimal asymmetric $k$-uniform hypergraphs. This is in a striking contrast to $k=2$, where it has been proved recently that there are exactly $18$ minimal asymmetric…

Combinatorics · Mathematics 2023-09-20 Yiting Jiang , Jaroslav Nesetril

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…

Computational Geometry · Computer Science 2022-01-05 Bradley McCoy , Eli Quist , Anna Schenfisch

A quasigeodesic is a curve on the surface of a convex polyhedron that has $\le \pi$ surface to each side at every point. In contrast, a geodesic has exactly $\pi$ to each side and so can never pass through a vertex, whereas quasigeodesics…

We show that the shortest closed geodesic on a 2-sphere with non-negative curvature has length bounded above by three times the diameter. We prove a new isoperimetric inequality for 2-spheres with pinched curvature; this allows us to…

Differential Geometry · Mathematics 2021-09-08 Ian Adelstein , Franco Vargas Pallete

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

Two latin squares are orthogonal if, when they are superimposed, every ordered pair of symbols appears exactly once. This definition extends naturally to `incomplete' latin squares each having a hole on the same rows, columns, and symbols.…

Combinatorics · Mathematics 2014-10-27 Peter J. Dukes , Christopher M. van Bommel

Two boxes in $\mathbb{R}^d$ are comparable if one of them is a subset of a translation of the other one. The comparable box dimension of a graph $G$ is the minimum integer $d$ such that $G$ can be represented as a touching graph of…

Discrete Mathematics · Computer Science 2022-03-16 Zdenek Dvorák , Daniel Goncalves , Abhiruk Lahiri , Jane Tan , Torsten Ueckerdt

We show that there are short intervals $[x,x+y]$ containing $\gg y^{1/10}$ numbers expressible as the sum of two squares, which is many more than the average when $y=o( (\log{x})^{5/9})$. We obtain similar results for sums of two squares in…

Number Theory · Mathematics 2019-10-30 James Maynard

We prove some uniqueness results for conics of minimal area that enclose a compact, full-dimensional subset of the elliptic plane. The minimal enclosing conic is unique if its center or axes are prescribed. Moreover, we provide sufficient…

Metric Geometry · Mathematics 2010-08-26 Matthias J. Weber , Hans-Peter Schröcker

Given a point set $S=\{s_1,\ldots , s_n\}$ in the unit square $U=[0,1]^2$, an anchored square packing is a set of $n$ interior-disjoint empty squares in $U$ such that $s_i$ is a corner of the $i$th square. The reach $R(S)$ of $S$ is the set…

Computational Geometry · Computer Science 2018-06-26 Hugo A. Akitaya , Matthew D. Jones , David Stalfa , Csaba D. Tóth

In this paper, we prove some results of restricted sums of four squares using arithmetic of quaternions in the ring of Lipschitz integers. For example, we show that every nonnegative integer $n$ can be written as $x^{2}+y^{2}+z^{2}+t^{2}$…

Number Theory · Mathematics 2021-05-31 Guang-Liang Zhou , Yue-Feng She

We show, in this first part, that the maximal number of singular points of a normal quartic surface $X \subset \mathbb{P}^3_K$ defined over an algebraically closed field $K$ of characteristic $2$ is at most $16$. We produce examples with…

Algebraic Geometry · Mathematics 2022-01-24 Fabrizio Catanese

Suppose that $I$ is a unit square. Let $T$ (resp. $\Delta$) be an isosceles right triangle (resp. an equilateral triangle). We prove that any collection of triangles homothetic to $T$ (resp. $\Delta$), whose total area does not exceed…

Combinatorics · Mathematics 2026-05-26 Chen-Yang Su

Two finite words $u,v$ are 2-binomially equivalent if, for all words $x$ of length at most 2, the number of occurrences of $x$ as a (scattered) subword of $u$ is equal to the number of occurrences of $x$ in $v$. This notion is a refinement…

Formal Languages and Automata Theory · Computer Science 2013-10-18 M. Rao , M. Rigo , P. Salimov

In this paper, we derive a formula to express the maximum number of non-intersecting diagonals of arbitrary length that can be drawn in n x n square arrays, where n is a multiple of l+1.

Combinatorics · Mathematics 2021-02-02 Marbarisha M. Kharkongor , Joseph Varghese Kureethara

In this paper we prove a new asymptotic lower bound for the minimal number of simplices in simplicial dissections of $n$-dimensional cubes. In particular we show that the number of simplices in dissections of $n$-cubes without additional…

Metric Geometry · Mathematics 2012-12-27 Alexey Glazyrin