English
Related papers

Related papers: Tiling Triangles with $2\pi/3$ Angles

200 papers

This paper is concerned with configurations of points in a plane lattice which determine angles that are rational multiples of $\pi$. We shall study how many such angles may appear in a given lattice and in which positions, allowing the…

Number Theory · Mathematics 2024-04-09 Roberto Dvornicich , Francesco Veneziano , Umberto Zannier

The edge-to-edge tilings of the sphere by congruent quadrilaterals of Type $a^2bc$ are classified as $3$ classes: a sequence of two-parameter families of $2$-layer earth map tilings with $2n$ $(n\ge3)$ tiles, a one-parameter family of…

Combinatorics · Mathematics 2022-07-26 Yixi Liao , Pinren Qian , Erxiao Wang , Yingyun Xu

The tiling problem has been a famous problem that has appeared in many Mathematics problems. Many of its solutions are rooted in high-level Mathematics. Thus we hope to tackle this problem using more elementary Mathematics concepts. In this…

History and Overview · Mathematics 2021-08-23 Le Viet Hung , Tan Yiming , Huang Keyi , Jin Qingyang

Given a periodic placement of copies of a tromino (either L or I), we prove co-RE-completeness (and hence undecidability) of deciding whether it can be completed to a plane tiling. By contrast, the problem becomes decidable if the initial…

Let n integer greater or equal to 4 and even and let T_n be the set of ribbon L-shaped n-ominoes. We study tiling problems for regions in a square lattice by T_n. Our main result shows a remarkable rigidity property: a tiling of the first…

Combinatorics · Mathematics 2014-06-04 Viorel Nitica

A triangle with rational sides and rational area is called a rational triangle. In this paper we consider three problems of finding pairs of rational triangles which have a common circumradius as well as either a common perimeter or a…

Number Theory · Mathematics 2021-05-11 Ajai Choudhry

We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to improve the upper bound on the number of Steiner points needed to obtain compatible triangulations of point sets.…

Computational Geometry · Computer Science 2007-05-23 Jeff Danciger , Satyan L. Devadoss , Don Sheehy

We consider tromino tilings of $m\times n$ domino-deficient rectangles, where $3|(mn-2)$ and $m,n\geq0$, and characterize all cases of domino removal that admit such tilings, thereby settling the open problem posed by J. M. Ash and S.…

Discrete Mathematics · Computer Science 2007-08-13 Mridul Aanjaneya

There are fifteen edge-to-edge tilings of the sphere by congruent pentagons with the edge combination $a^3b^2$: five one-parameter families of pentagonal subdivision tilings, and ten flip modifications of three special cases of two…

Metric Geometry · Mathematics 2021-06-29 Erxiao Wang , Min Yan

Nandakumar asked whether there is a tiling of the plane by pairwise non-congruent triangles of equal area and equal perimeter. Here a weaker result is obtained: there is a tiling of the plane by pairwise non-congruent triangles of equal…

Metric Geometry · Mathematics 2016-03-31 Dirk Frettlöh

We show that a square-tiling of a $p\times q$ rectangle, where $p$ and $q$ are relatively prime integers, has at least $\log_2p$ squares. If $q>p$ we construct a square-tiling with less than $q/p+C\log p$ squares of integer size, for some…

Combinatorics · Mathematics 2016-09-06 Richard Kenyon

Let $T$ be a tile in $\mathbb{Z}^n$, meaning a finite subset of $\mathbb{Z}^n$. It may or may not tile $\mathbb{Z}^n$, in the sense of $\mathbb{Z}^n$ having a partition into copies of $T$. However, we prove that $T$ does tile $\mathbb{Z}^d$…

Combinatorics · Mathematics 2016-08-23 Vytautas Gruslys , Imre Leader , Ta Sheng Tan

We develop a multifractal random tilling that fills the square. The multifractal is formed by an arrangement of rectangular blocks of different sizes, areas and number of neighbors. The overall feature of the tilling is an heterogeneous and…

Statistical Mechanics · Physics 2015-06-24 M. G. Pereira , G. Corso , L. S. Lucena , J. E. Freitas

We consider a class of cut-and-project sets $\Lambda = \Lambda_F \times \zahl$ in the plane. Let $L=\Lambda+w\real$, $w\in\real^2$, be a countable union of parallel lines. Then either (1) $L$ is a discrete family of lines, (2) $L$ is a…

Metric Geometry · Mathematics 2015-05-27 Akio Hizume , Yoshikazu Yamagishi

We classify edge-to-edge tilings of the sphere by congruent pentagons with the edge combination $a^4b$ and with any irrational angle in degree: they are three $1$-parameter families of pentagonal subdivisions of the Platonic solids, with…

Combinatorics · Mathematics 2024-12-12 Junjie Shu , Yixi Liao , Erxiao Wang

Let $\mathcal{A}=(A_{1},...,A_{n},...)$ be a finite or infinite sequence of $2\times2$ matrices with entries in an integral domain. We show that, except for a very special case, $\mathcal{A}$ is (simultaneously) triangularizable if and only…

Rings and Algebras · Mathematics 2021-10-19 Carlos A. A. Florentino

Tight triangulations are exotic, but highly regular objects in combinatorial topology. A triangulation is tight if all its piecewise linear embeddings into a Euclidean space are as convex as allowed by the topology of the underlying…

Geometric Topology · Mathematics 2018-10-24 Benjamin A. Burton , Basudeb Datta , Nitin Singh , Jonathan Spreer

Non-periodic tilings with Tile(1, 1) using the substitution method, as presented by Smith et al. in [2] and [3], can be converted into non-periodic tilings with three types of pentagons. When arbitrary replacements are excluded, the…

Metric Geometry · Mathematics 2025-05-16 Teruhisa Sugimoto

We determine asymptotically the two extremal constructions for the tiling problem of the $H$-shaped tree. In particular, the first extremal construction is close to the complement of two cliques, in contrast to previously studied bipartite…

Combinatorics · Mathematics 2025-01-22 Nannan Chen , Xizhi Liu , Lin Sun , Guanghui Wang

In this paper, we study 2-port networks and introduce new concepts of voltage drop and $\Pi$-equivalence. The main result is that each planar network is $\Pi$-equivalent to a network with no more than 5 edges. This implies that if an…

Combinatorics · Mathematics 2022-04-12 Svetlana Shirokovskikh
‹ Prev 1 3 4 5 6 7 10 Next ›