Related papers: The algebra of knotted trivalent graphs and Turaev…
A triangulation of a polygon is a subdivision of it into triangles, using diagonals between its vertices. Two different triangulations of a polygon can be related by a sequence of flips: a flip replaces a diagonal by the unique other…
We propose a unified perspective on two sets of objects that usually arise in the study of bipartite field theories. Each of the sets consists of a polytope, or equivalently a toric Calabi-Yau, and a quiver theory. We refer to the two sets…
In this paper, twisted tensor product of DG algebras is studied and sufficient conditions for smoothness of such a product are given. It is shown that in the case of finite-dimensional DG algebras, applying this operation offers great…
We characterise the quotient surface graphs arising from symmetric contact systems of line segments in the plane and also from symmetric pointed pseudotriangulations in the case where the group of symmetries is generated by a translation or…
The primary objects of study in the ``knot theory of complex plane curves'' are C-links: links (or knots) cut out of a 3-sphere in the complex plane by complex plane transverse and totally tangential. Transverse C-links are naturally…
We construct an infinite family of hyperbolic, homologically thin knots that are not quasi-alternating. To establish the latter, we argue that the branched double-cover of each knot in the family does not bound a negative definite…
A convex combination mapping of a planar graph is a plane mapping in which the external vertices are mapped to the corners of a convex polygon and every internal vertex is a proper weighted average of its neighbours. If a planar graph is…
In the 1980s, Neumann and Zagier introduced a symplectic vector space associated to an ideal triangulation of a cusped 3-manifold, such as a knot complement. We give a geometric interpretation for this symplectic structure in terms of the…
A transparent rectangle visibility graph (TRVG) is a graph whose vertices can be represented by a collection of non-overlapping rectangles in the plane whose sides are parallel to the axes such that two vertices are adjacent if and only if…
We say that a graph is intrinsically knotted or completely 3-linked if every embedding of the graph into the 3-sphere contains a nontrivial knot or a 3-component link any of whose 2-component sublink is nonsplittable. We show that a graph…
A pseudo-triangle is a simple polygon with exactly three convex vertices, and all other vertices (if any) are distributed on three concave chains. A pseudo-triangulation~$\mathcal{T}$ of a point set~$P$ in~$\mathbb{R}^2$ is a partitioning…
Geometric torsions are torsions of acyclic complexes of vector spaces which consist of differentials of geometric quantities assigned to the elements of a manifold triangulation. We use geometric torsions to construct invariants for a…
A pseudo-triangle is a simple polygon with three convex vertices, and a pseudo-triangulation is a face-to-face tiling of a planar region into pseudo-triangles. Pseudo-triangulations appear as data structures in computational geometry, as…
Foundation models excel at language, where sentences become tokens, and vision, where images become pixels, because both reduce to discrete symbols on a shared, fixed grid. Knowledge Graphs share the discreteness, but not the geometry.…
We will consider P-graph complexes, where P is a cyclic operad. P-graph complexes are natural generalizations of Kontsevich's graph complexes -- for P = the operad for associative algebras it is the complex of ribbon graphs, for P = the…
Topological quantum field theories can be used as a powerful tool to probe geometry and topology in low dimensions. Chern-Simons theories, which are examples of such field theories, provide a field theoretic framework for the study of knots…
Tensor field theory (TFT) focuses on quantum field theory aspects of random tensor models, a quantum-gravity-motivated generalisation of random matrix models. The TFT correlation functions have been shown to be classified by graphs that…
AGT relations imply that the four-point conformal block admits a decomposition into a sum over pairs of Young diagrams of essentially rational Nekrasov functions - this is immediately seen when conformal block is represented in the form of…
In this paper, we research the grid homology for spatial graphs with cut edges. We show that the grid homology for spatial graph $f$ is trivial if $f$ has sinks, sources, or cut edges. As an application, we give purely combinatorial proofs…
The vertices of a $k$-token graph of a graph $G$ correspond to $k$ indistinguishable tokens placed on $k$ different vertices of $G$. Changing some conditions on both the nature of the tokens and the number of tokens allowed in each vertex…