Related papers: Grid Diagrams, Braids, and Contact Geometry
A grid drawing of a graph maps vertices to grid points and edges to line segments that avoid grid points representing other vertices. We show that there is a number of grid points that some line segment of an arbitrary grid drawing must…
Spin networks, essentially labeled graphs, are ``good quantum numbers'' for the quantum theory of geometry. These structures encompass a diverse range of techniques which may be used in the quantum mechanics of finite dimensional systems,…
In this article, we propose the approach to structural optimization of neural networks, based on the braid theory. The paper describes the basics of braid theory as applied to the description of graph structures of neural networks. It is…
The intersection graph of a collection of trapezoids with corner points lying on two parallel lines is called a trapezoid graph. These graphs and their generalizations were applied in various fields, including modeling channel routing…
Let G be a graph. The (unlabeled) configuration space of n points on G is the space of all n-element subsets of G. The fundamental group of such a configuration space is called a graph braid group. We use a version of discrete Morse theory…
A graph is a mathematical object consisting of a set of vertices and a set of edges connecting vertices. Graphs can be drawn on paper in various ways, but until recently all published methods of drawing graphs have had undesirable…
Graph transformations definable in logic can be described using the notion of transductions. By understanding transductions as a basic embedding mechanism, which captures the possibility of encoding one graph in another graph by means of…
This is a survey paper on Legendrian and transversal knots for Handbook of Knot Theory.
In this series, we introduce and investigate the concept of connectoids, which captures the connectivity structure of various discrete objects such as undirected graphs, directed graphs, bidirected graphs, hypergraphs and finitary matroids.…
Braids can be represented geometrically as curve diagrams. The geometric complexity of a braid is the minimal complexity of a curve diagram representing it. We introduce and study the corresponding notion of geometric generating function.…
We give uniform, explicit, and simple face-pairing descriptions of all the branched cyclic covers of the 3-sphere, branched over two-bridge knots. Our method is to use the bi-twisted face-pairing constructions of Cannon, Floyd, and Parry;…
In this paper we consider Contact graphs of Paths on a Grid (CPG graphs), i.e. graphs for which there exists a family of interiorly disjoint paths on a grid in one-to-one correspondence with their vertex set such that two vertices are…
The relations, rather than the elements, constitute the structure of networks. We therefore develop a systematic approach to the analysis of networks, modelled as graphs or hypergraphs, that is based on structural properties of…
Given a knot in $S^3$, one can associate to it a surface diffeomorphism in two different ways. First, an arbitrary knot in $S^{3}$ can be represented by braids, which can be thought of as diffeomorphisms of punctured disks. Second, if the…
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…
In this (mostly) survey article, we give a synopsis of a number of results relating to Brill--Noether theory on curves and metric graphs, together with some speculations about the behavior of one-dimensional linear series on a class of…
The unit-distance graph on the $n$-dimensional integer lattice $\mathbb{Z}^n$ is called the $n$-dimensional grid. We attempt to maximize the girth of a $k$-regular (possibly induced) subgraph of the $n$-dimensional grid, and provide…
We introduce constructions of exact Lagrangian cobordisms with cylindrical Legendrian ends and study their invariants which arise from Symplectic Field Theory. A pair $(X,L)$ consisting of an exact symplectic manifold $X$ and an exact…
Using convex surfaces and Kanda's classification theorem, we classify Legendrian isotopy classes of Legendrian linear curves in all tight contact structures on $T^3$. Some of the knot types considered in this article provide new examples of…
In this survey paper we present the $L$--moves between braids and how they can adapt and serve for establishing and proving braid equivalence theorems for various diagrammatic settings, such as for classical knots, for knots in knot…