Tilings of (2 2 n)-board with coloured cubes and bricks
From MaRDI portal
(Redirected from Publication:5015349)
Tilings of \((2 \times 2 \times n)\)-board with coloured cubes and bricks
Tilings of \((2 \times 2 \times n)\)-board with coloured cubes and bricks
Combinatorial identities, bijective combinatorics (05A19) Combinatorial aspects of tessellation and tiling problems (05B45) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Tilings in (n) dimensions (aspects of discrete geometry) (52C22) Combinatorics (educational aspects) (97K20)
Abstract: Several articles deal with tilings with squares and dominoes on 2-dimensional boards, but only a few on boards in 3-dimensional space. We examine a tiling problem with colored cubes and bricks of -board in three dimensions. After a short introduction and the definition of breakability we show a way to get the number of the tilings of an -long board considering the -long board. It describes recursively the number of possible breakable and unbreakable tilings. Finally, we give some identities for the recursions using breakability. The method of determining the recursions in space can be useful in mathematical education as well.
Recommendations
Cites work
- scientific article; zbMATH DE number 6713350 (Why is no real title available?)
- scientific article; zbMATH DE number 1975686 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- Power sums in hyperbolic Pascal triangles
- The Fibonacci Numbers: Exposed More Discretely
- Tiling a (2 n)-board with squares and dominoes
- Tiling approach to obtain identities for generalized Fibonacci and Lucas numbers
- Tiling proofs of recent sum identities involving Pell numbers
- Tilings of hyperbolic (2 n)-board with colored squares and dominoes
Cited in
(6)- On corners of objects built from parallelepiped bricks
- scientific article; zbMATH DE number 6713350 (Why is no real title available?)
- Tilings by 1 1 and 2 2
- Tilings of hyperbolic (2 n)-board with colored squares and dominoes
- On a proof of the Thābit ibn Qurra's generalization of the Pythagorean theorem
- Tiling a pyramidal polycube with dominoes
This page was built for publication: Tilings of \((2 \times 2 \times n)\)-board with coloured cubes and bricks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5015349)