Abstract: A planar Tangle is a smooth simple closed curve piecewise defined by quadrants of circles with constant curvature. We can enumerate Tangles by counting their dual graphs, which consist of a certain family of polysticks. The number of Tangles with a given length or area grows exponentially, and we show the existence of their growth constants by comparing Tangles to two families of polyominoes.
Recommendations
Cites work
- A new transfer-matrix algorithm for exact enumerations: self-avoiding polygons on the square lattice
- An algorithm for finding a fundamental set of cycles of a graph
- Cell Growth Problems
- Counting polyominoes: yet another attack
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- Punctured polygons and polyominoes on the square lattice
- The mathematics of various entertaining subjects. Volume 2. Research in games, graphs, counting, and complexity. With a foreword by Ron Graham
Cited in
(5)
This page was built for publication: Enumeration of planar Tangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2197116)
