English
Related papers

Related papers: Tiling a rectangle with the fewest squares

200 papers

Guarding a polygon with few guards is an old and well-studied problem in computational geometry. Here we consider the following variant: We assume that the polygon is orthogonal and thin in some sense, and we consider a point $p$ to guard a…

Computational Geometry · Computer Science 2016-04-26 Therese Biedl , Saeed Mehrabi

The number $Z(n):=\lfloor n/2\rfloor\lfloor (n-1)/2\rfloor$ is the smallest number of crossings in a simple planar drawing of $K_{2,n}$ in which both vertices on the 2-side have the same clockwise rotation. For two vertices $u,v$ on the…

Combinatorics · Mathematics 2021-08-24 R. Bruce Richter , André C. Silva , Orlando Lee

The computational complexity of tiling finite simply connected regions with a fixed set of tiles is studied in this paper. We show that the problem of tiling simply connected regions with a fixed set of $23$ Wang tiles is NP-complete. As a…

Combinatorics · Mathematics 2024-09-19 Chao Yang , Zhujun Zhang

Given a finite collection of two-dimensional tile types, the field of study concerned with covering the plane with tiles of these types exclusively has a long history, having enjoyed great prominence in the last six to seven decades. Much…

Statistical Mechanics · Physics 2024-12-24 Eduardo J. Aguilar , Valmir C. Barbosa , Raul Donangelo , Sergio R. Souza

$\SLR$ geometry is one of the eight 3-dimensional Thurston geometries, it can be derived from the 3-dimensional Lie group of all $2\times 2$ real matrices with determinant one. Our aim is to describe and visualize the {\it regular infinite…

Metric Geometry · Mathematics 2016-08-14 Jenő Szirmai

It is well-known that the question of whether a given finite region can be tiled with a given set of tiles is NP-complete. We show that the same is true for the right tromino and square tetromino on the square lattice, or for the right…

Combinatorics · Mathematics 2007-05-23 Cristopher Moore , John Michael Robson

We solve and generalize an open problem posted by James Propp (Problem 16 in New Perspectives in Geometric Combinatorics, Cambridge University Press, 1999) on the number of tilings of quasi-hexagonal regions on the square lattice with every…

Combinatorics · Mathematics 2013-09-24 Tri Lai

Non-periodic tilings of $\mathbb{Z}_N$ are a difficult to obtain key to a wide range of complex mathematical issues. In a musician's eyes, they are called rhythmic Vuza canons. After a short summary of the main properties of rhythmic tiling…

Combinatorics · Mathematics 2015-08-18 Helianthe Caure

We use the theory of $\textbf{U}_q$-tilting modules to construct cellular bases for centralizer algebras. Our methods are quite general and work for any quantum group $\textbf{U}_q$ attached to a Cartan matrix and include the non-semisimple…

Quantum Algebra · Mathematics 2017-10-03 Henning Haahr Andersen , Catharina Stroppel , Daniel Tubbenhauer

The present article studies combinatorial tilings of Euclidean or spherical spaces by polytopes, serving two main purposes: first, to survey some of the main developments in combinatorial space tiling; and second, to highlight some new and…

Metric Geometry · Mathematics 2010-05-24 Egon Schulte

Square-tiled surfaces are a class of translation surfaces that are of particular interest in geometry and dynamics because, as covers of the square torus, they share some of its simplicity and structure. In this paper, we study counting…

Geometric Topology · Mathematics 2019-05-03 Sunrose T. Shrestha , Jane Wang

Let $p$ be a prime number, it is shown that tiling and spectral sets coincide in $\mathbb Z_{p^2}\times\mathbb Z_{p^2}$ by considering equivalently symplectic spectral pairs. The main approach is still to analyze the zero set of the Fourier…

Classical Analysis and ODEs · Mathematics 2026-03-24 Weiqi Zhou

In 1946 Fine and Niven posed problem E724, asking to demonstrate that every hypercube can be tiled by any number of hypercubic tiles larger than some value. This requires only basic number theory, but the problem of finding the smallest…

Combinatorics · Mathematics 2019-10-15 Benjamin Prather

Square-triangle-rhombus ($\mathcal{STR}$) tilings are encountered in various self-organized multi-component systems. They exhibit a rich structural diversity, encompassing both periodic tilings and long-range ordered quasicrystals,…

Materials Science · Physics 2024-10-16 Marianne Imperor-Clerc , Pavel Kalugin , Sebastian Schenk , Wolf Widdra , Stefan Förster

A combinatorial tiling of the sphere is naturally given by an embedded graph. We study the case that each tile has exactly five edges, with the ultimate goal of classifying combinatorial tilings of the sphere by geometrically congruent…

Combinatorics · Mathematics 2014-05-13 Min Yan

Tilings of a surface of negative Euler characteristic by n-gons with n\ge 7 is a finite problem. We develop the algorithm for finding all the tilings for fixed number of tiles and present the calculation for tilings of surfaces of small…

Combinatorics · Mathematics 2026-04-29 Chunlin Li , Erxiao Wang , Wu Jie , Min Yan

Let $p>1$ be a large prime number, let $q=O(\log\log p)$ and let $1\leq a<q$ be a pair of relatively prime integers. It is proved that there is a prime primitive root $u\ll (\log p)(\log \log p)^5$ such that $u\equiv a\bmod q$ in the prime…

General Mathematics · Mathematics 2025-09-25 N. A. Carella

Let $\Q=[0,1)^d$ denote the unit cube in $d$-dimensional Euclidean space \Rd and let \T be a discrete subset of \Rd. We show that the exponentials $e_t(x):=exp(i2\pi tx)$, $t\in\T$ form an othonormal basis for $L^2(\Q)$ if and only if the…

Classical Analysis and ODEs · Mathematics 2014-11-18 Alex Iosevich , Steen Pedersen

Let $B_p$ be the Latin square given by the addition table for the integers modulo an odd prime $p$. Here we consider the properties of Latin trades in $B_p$ which preserve orthogonality with one of the $p-1$ MOLS given by the finite field…

Combinatorics · Mathematics 2016-07-19 Nicholas J. Cavenagh , Diane M. Donovan , Fatih Demirkale

For prime powers q, let s(q) denote the probability that a randomly-chosen principally-polarized abelian surface over the finite field F_q is not simple. We show that there are positive constants B and C such that for all q, B (log…

Number Theory · Mathematics 2020-02-27 Jeff Achter , Everett W. Howe