相关论文: Knots and Polytopes

A calligraph is a graph that for almost all edge length assignments moves with one degree of freedom in the plane, if we fix an edge and consider the vertices as revolute joints. The trajectory of a distinguished vertex of the calligraph is…

Data science offers a powerful tool to understand objects in multiple sciences. In this paper we utilize concept of data science, most notably topological data analysis, to extend our understanding of knot theory. This approach provides a…

Given a knot K in the 3-sphere, consider a singular disk bounded by K and the intersections of K with the interior of the disk. The absolute number of intersections, minimised over all choices of singular disk with a given algebraic number…

A clustering algorithm partitions a set of data points into smaller sets (clusters) such that each subset is more tightly packed than the whole. Many approaches to clustering translate the vector data into a graph with edges reflecting a…

This paper is a survey on the theory of knotoids and braidoids. Knotoids are open ended knot diagrams in surfaces and braidoids are geometric objects analogous to classical braids, forming a counterpart theory to the theory of knotoids in…

The lectures review the state of affairs in modern branch of mathematical physics called probabilistic topology. In particular we consider the following problems: (i) We estimate the probability of a trivial knot formation on the lattice…

Global textures are interesting because they are promising candidates for seeds in the structure formation of the universe. The important configurations are those who will be able to collapse. The type of configurations that I will consider…

Simple closed curves in the plane can be mapped to nontrivial knots under the action of origami foldings that allow the paper to self-intersect. We show all tame knot types may be produced in this manner, motivating the development of a new…

The study of knot mosaics is based upon representing knot diagrams using a set of tiles on a square grid. This branch of knot theory has many unanswered questions, especially regarding the efficiency with which we draw knots as mosaics.…

The mathematical software system polymake provides a wide range of functions for convex polytopes, simplicial complexes, and other objects. A large part of this paper is dedicated to a tutorial which exemplifies the usage. Later sections…

Zonotopes are a rich and fascinating family of polytopes, with connections to many areas of mathematics. In this article we provide a brief survey of classical and recent results related to lattice zonotopes. Our emphasis is on connections…

Given a surface with boundary and some points on its boundary, a polygon diagram is a way to connect those points as vertices of non-overlapping polygons on the surface. Such polygon diagrams represent non-crossing permutations on a surface…

We provide a way to produce knots in $S^3$ from signed chord diagrams, and prove that every knot can be produced in this way. Using these diagrams, we generalize the fundamental theorem of finite type invariants. We also provide moves for…

Index maps taking values in the $K$-theory of a mapping cone are defined and discussed. The resulting index theorem can be viewed in analogy with the Freed-Melrose index theorem. The framework of geometric $K$-homology is used in a…

Starting from filters over the set of indices, we introduce structures in a product of sets where the coordinate sets have the given structures.

In this Thesis we examine the interplay between the encoding of information in quantum systems and their geometrical and topological properties. We first study photonic qubit probes of space-time curvature, showing how gauge-independent…

It has been suggested recently that knots might exist as stable soliton solutions in a simple three-dimensional classical field theory, opening up a wide range of possible applications in physics and beyond. We have re-examined and extended…

Frequent itemsets form a polytope and can be found and analyzed with Linear Programming.

Long, flexible physical filaments are naturally tangled and knotted, from macroscopic string down to long-chain molecules. The existence of knotting in a filament naturally affects its configuration and properties, and may be very stable or…

The goal of this paper is to discuss the possibility of finding an algorithm that can give all distinct knots up to a desired complexity. Two such algorithms are presented, one based on projections on a plane, the other on closed…