Enumeration of planar Tangles

DOI10.1007/S12044-020-00575-7zbMATH Open1447.05052arXiv1906.01541OpenAlexW3048580718MaRDI QIDQ2197116FDOQ2197116

Authors: Douglas A. Torrance 

Publication date: 4 September 2020

Published in: Proceedings of the Indian Academy of Sciences. Mathematical Sciences (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1906.01541

Recommendations

• scientific article; zbMATH DE number 7359764
• Tangles and degenerate tangles
• Enumeration of Algebraic Tangles with Applications to Theta-curves and Handcuff Graphs
• On the counting of colored tangles
• Tangled thrackles

zbMATH Keywords

tanglepolyominodual graphgrowth constant

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Polyominoes (05B50)

Cites Work

• Title not available (Why is that?)
• Cell Growth Problems
• Counting polyominoes: yet another attack
• An algorithm for finding a fundamental set of cycles of a graph
• Punctured polygons and polyominoes on the square lattice
• A new transfer-matrix algorithm for exact enumerations: self-avoiding polygons 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)

• Title not available (Why is that?)
• Enumeration in torus arrangements
• tanglenum
• Counting tanglegrams with species
• Title not available (Why is that?)

Uses Software

• NetworkX
• OEIS
• Python

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)