Related papers: Knots and Polytopes
This is a brief introduction to the basic concepts of topology. It includes the basic constructions, discusses separation properties, metric and pseudometric spaces, and gives some applications arising from the use of topology in computing.
This paper builds a novel bridge between algebraic coding theory and mathematical knot theory, with applications in both directions. We give methods to construct error-correcting codes starting from the colorings of a knot, describing…
A new methodological approach for the study of topology for shapes made of arrangements of lines, planes or solids is presented. Topologies for shapes are traditionally built on the classical theory of point-sets. In this paper, topologies…
Knot theory provides a powerful tool for the understanding of topological matters in biology, chemistry, and physics. Here knot theory is introduced to describe topological phases in the quantum spin system. Exactly solvable models with…
Polytopes from subgraph statistics are important in applications and conjectures and theorems in extremal graph theory can be stated as properties of them. We have studied them with a view towards applications by inscribing large explicit…
We introduce and study knots and links in 2-dimensional complexes. In particular, we define linking numbers for oriented two-component links in 2-complexes and a Kauffman-type bracket polynomial for links in 2-complexes. We also discuss…
Polytope numbers for a given polytope are an integer sequence defined by the combinatorics of the polytope. Recent work by H. K. Kim and J. Y. Lee has focused on writing polytope number sequences as sums of simplex number sequences. We…
While the problem of knot classification is far from solved, it is possible to create computer programs that can be used to tabulate knots up to a desired degree of complexity. Here we discuss the main ideas on which such programs can be…
Tensors are fundamental in mathematics, computer science, and physics. Their study through algebraic geometry and representation theory has proved very fruitful in the context of algebraic complexity theory and quantum information. In…
This note wants to explain how to obtain meaningful pictures of (possibly high-dimensional) convex polytopes, triangulated manifolds, and other objects from the realm of geometric combinatorics such as tight spans of finite metric spaces…
Network coding is studied when an adversary controls a subset of nodes in the network of limited quantity but unknown location. This problem is shown to be more difficult than when the adversary controls a given number of edges in the…
We present a number of complexity results concerning the problem of counting vertices of an integral polytope defined by a system of linear inequalities. The focus is on polytopes with small integer vertices, particularly 0/1 polytopes and…
While the parameters of atomic nuclei, Z and A, indicate a general structural pattern for the nuclei, their exact masses in their fine differences seem not to exhibit the orderly kind of logical system that systematic and orderly nature…
In this paper we will present some ideas to use 3D topology for quantum computing extending ideas from a previous paper. Topological quantum computing used \textquotedblleft knotted\textquotedblright{} quantum states of topological phases…
We directly connect topological changes that can occur in mathematical three-space via surgery, with black hole formation, the formation of wormholes and new generalizations of these phenomena. This work widens the bridge between topology…
A knot is a circle piecewise-linearly embedded into the 3-sphere. The topology of a knot is intimately related to that of its exterior, which is the complement of an open regular neighborhood of the knot. Knots are typically encoded by…
Knot diagrams are among the most common visual tools in topology. Computer programs now make it possible to draw, manipulate and render them digitally, which proves to be useful in knot theory teaching and research. Still, an openly…
A physical interpretation of the rope simulated by the SONO algorithm is presented. Properties of the tight polygonal knots delivered by the algorithm are analyzed. An algorithm for bounding the ropelength of a smooth inscribed knot is…
The main purpose of this paper is to report on the state of the art of computing integer hulls and their facets as well as counting lattice points in convex polytopes. Using the polymake system we explore various algorithms and…
We provide a systematic description of the solid angle function as a means of constructing a knotted field for any curve or link in $\mathbb{R}^3$. This is a purely geometric construction in which all of the properties of the entire knotted…