Circuit presentation and lattice stick number with exactly four z-sticks
From MaRDI portal
Publication:4579866
Abstract: The lattice stick number of a link is defined to be the minimal number of straight line segments required to construct a stick presentation of in the cubic lattice. Hong, No and Oh found a general upper bound . A rational link can be represented by a lattice presentation with exactly 4 -sticks. An -circuit is the disjoint union of arcs in the lattice plane . An -circuit presentation is an embedding obtained from the -circuit by connecting each pair of vertices with one line segment above the circuit. By using a 2-circuit presentation, we can easily find the lattice presentation with exactly 4 -sticks. In this paper, we show that an upper bound for the lattice stick number of rational -links realized with exactly 4 -sticks is . Furthermore it is if is a 2-component link.
Recommendations
Cites work
- scientific article; zbMATH DE number 2120368 (Why is no real title available?)
- scientific article; zbMATH DE number 3321941 (Why is no real title available?)
- Knots with small lattice stick numbers
- Lattice stick number of knots
- LATTICE STICK NUMBERS OF SMALL KNOTS
- Links with small lattice stick numbers
- STICK INDEX OF KNOTS AND LINKS IN THE CUBIC LATTICE
- The Curvature of Lattice Knots
- Total curvature, ropelength and crossing number of thick knots
- Upper bound on lattice stick number of knots
This page was built for publication: Circuit presentation and lattice stick number with exactly four \(z\)-sticks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4579866)