Counting Tilings by Taking Walks in a Graph

DOI10.1007/978-3-030-37853-0_5zbMATH Open1448.52016OpenAlexW3016350979MaRDI QIDQ5118416FDOQ5118416

Steven Osborne, Jason Ekstrand, Steve Butler

Publication date: 8 September 2020

Published in: Foundations for Undergraduate Research in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-37853-0_5

Recommendations

• Counting tilings by taking walks
• Counting Lattice Walks in the Plane
• Walks on tilings of polygons
• Tilings in graphons
• scientific article; zbMATH DE number 1439433
• scientific article; zbMATH DE number 5139439
• Counting fixed-height tatami tilings
• Tilings in vertex ordered graphs
• Counting lattice walks by winding angle
• The number of walks in a graph

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)

Cites Work

• Title not available (Why is that?)
• Alternating-sign matrices and domino tilings. I
• The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
• Title not available (Why is that?)
• Alternating-sign matrices and domino tilings. II
• Title not available (Why is that?)
• Tiling a strip with triangles
• Title not available (Why is that?)
• Tiling with L's and squares
• Title not available (Why is that?)

Cited In (4)

• Tiling problems, automata, and tiling graphs
• Enumerating tilings of rectangles by squares with recurrence relations
• Self-avoiding walks and polygons on quasiperiodic tilings
• Counting lattice walks by winding angle

Uses Software

• OEIS

This page was built for publication: Counting Tilings by Taking Walks in a Graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5118416)