Design and serial construction of digraph braids

DOI10.1080/17513472.2015.1007410zbMath1326.00037OpenAlexW2094218550MaRDI QIDQ3453872

D. Jacob Wildstrom

Publication date: 1 December 2015

Published in: Journal of Mathematics and the Arts (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/17513472.2015.1007410

zbMATH Keywords

braidsdigraphstournamentsknot theorydecomposabilityacyclic digraphs

Mathematics Subject Classification ID

Braid groups; Artin groups (20F36) Directed graphs (digraphs), tournaments (05C20) Mathematics and visual arts (00A66)

Uses Software

• OEIS

Cites Work

• A short proof of a theorem of Reid and Parker on tournaments
• On tournaments and their largest transitive subtournaments
• On tournaments free of large transitive subtournaments
• Developing a mathematical model for bobbin lace
• A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs
• A solution of the isomorphism problem for circulant graphs
• Disproof of a conjecture of Erdös and moser on tournaments

This page was built for publication: Design and serial construction of digraph braids