Combinatorial properties of double square tiles
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3968590 (Why is no real title available?)
- scientific article; zbMATH DE number 687006 (Why is no real title available?)
- scientific article; zbMATH DE number 1024080 (Why is no real title available?)
- A linear time and space algorithm for detecting path intersection in \(\mathbb Z^d\)
- A parallelogram tile fills the plane by translation in at most two distinct ways
- Arbitrary versus periodic storage schemes and tessellations of the plane using one type of polyomino
- Developments in Language Theory
- Equations on palindromes and circular words
- On the tiling by translation problem
- On translating one polyomino to tile the plane
- PROPERTIES OF THE CONTOUR PATH OF DISCRETE SETS
- Research Problems in Discrete Geometry
- Salient and Reentrant Points of Discrete Sets
- Two infinite families of polyominoes that tile the plane by translation in two distinct ways
Cited in
(7)- Proving a conjecture on prime double square tiles
- On the decomposability of homogeneous binary planar configurations with respect to a given exact polyomino
- Efficient operations on discrete paths
- Characterizing tileorders
- A generalization of the Fibonacci word fractal and the Fibonacci snowflake
- Christoffel and Fibonacci tiles
- Two infinite families of polyominoes that tile the plane by translation in two distinct ways
This page was built for publication: Combinatorial properties of double square tiles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q391406)