Related papers: Knots and Polytopes
We introduce the simple extension complexity of a polytope P as the smallest number of facets of any simple (i.e., non-degenerate in the sense of linear programming) polytope which can be projected onto P. We devise a combinatorial method…
Symmetric edge polytopes are a recent and well-studied family of centrally symmetric polytopes arising from graphs. In this paper, we introduce a generalization of this family to arbitrary simplicial complexes. We show how topological…
Computational topology is a vibrant contemporary subfield and this article integrates knot theory and mathematical visualization. Previous work on computer graphics developed a sequence of smooth knots that were shown to converge point wise…
Four-manifold theory is employed to study the existence of (twisted) generalized complex structures. It is shown that there exist (twisted) generalized complex structures that have more than one type change loci. In an example-driven…
This article studies a large, general class of orthogonal polytopes which we may call "generic orthotopes". These objects emerged from a desire to represent a Coxeter complex by an orthogonal polytope that is particularly nice with respect…
There is a very extensive literature dealing with convex polytopes from the standpoints of combinatorics and numerical analysis. By contrast, the current paper adopts an alternative viewpoint that regards a polytope as an autonomous space…
Ng constructed an invariant of knots in ${\mathbb{R}}^3$, a combinatorial knot contact homology. Extending his study, we construct an invariant of surface-knots in ${\mathbb{R}}^4$ using marked graph diagrams.
Sutured manifolds defined by Gabai are useful in the geometrical study of knots and 3-dimensional manifolds. On the other hand, homology cylinders are in an important position in the recent theory of homology cobordisms of surfaces and…
We present an extremely elementary construction of the simple Lie algebras over the complex numbers in all of their minuscule representations, using the vertices of various polytopes. The construction itself requires no complicated…
We construct certain monoids, called tied monoids. These monoids result to be semidirect products finitely presented and commonly built from braid groups and their relatives acting on monoids of set partitions. The nature of our monoids…
In this paper geometry is studied with a novel approach. Every geometrical object is defined as a symbol which satisfies some properties. These symbols are then coded into a class of numbers which are named here as many dots numbers (MDN).…
For systems of polynomial equations, we study the problem of computing the Newton polytope of their eliminants. As was shown by Esterov and Khovanskii, such Newton polytopes are mixed fiber polytopes of the Newton polytopes of the input…
This paper is a survey of knot theory and invariants of knots and links from the point of view of categories of diagrams. The topics range from foundations of knot theory to virtual knot theory and topological quantum field theory.
An analysis of extensive simulations of interacting self-avoiding polygons on cubic lattice shows that the frequencies of different knots realized in a random, collapsed polymer ring decrease as a negative power of the ranking order, and…
A transportation polytope consists of all multidimensional arrays or tables of non-negative real numbers that satisfy certain sum conditions on subsets of the entries. They arise naturally in optimization and statistics, and also have…
Some of the basic concepts of topology are explored through known physics problems. This helps us in two ways, one, in motivating the definitions and the concepts, and two, in showing that topological analysis leads to a clearer…
We investigate how to make the surface of a convex polyhedron (a polytope) by folding up a polygon and gluing its perimeter shut, and the reverse process of cutting open a polytope and unfolding it to a polygon. We explore basic enumeration…
In this paper we discuss about properties of lattices and its application in theoretical and algorithmic number theory. This result of Minkowski regarding the lattices initiated the subject of Geometry of Numbers, which uses geometry to…
In recent work the author investigates perfect matchings of a bipartite graph obtained from a knot diagram and demonstrates that these correspond to discrete Morse functions on a 2-complex for the 2-sphere. This relationship is expounded…
Given a graph G, we construct a convex polytope whose face poset is based on marked subgraphs of G. Dubbed the graph multiplihedron, we provide a realization using integer coordinates. Not only does this yield a natural generalization of…