Related papers: Invariants of Spatial Graphs
We study how the problem of observables is fully resolved for background independent theories defined on finite graphs. We argue the correct analogue of coordinate independence is the invariance under changes of graph labels, a kind of…
Stanley in his paper [Stanley, Richard P.: Acyclic orientations of graphs In: Discrete Mathematics 5 (1973), Nr. 2, S. 171-178.] provided interpretations of the chromatic polynomial when it is substituted with negative integers. Greene and…
The A-polynomial is a knot invariant related to the space of $SL_2(\mathbb{C})$ representations of the knot group. In this paper our interests lies in the logarithmic Gauss map of the A-polynomial. We develop a homological point of view on…
We study invariants of virtual graphoids, which are virtual spatial graph diagrams with two distinguished degree-one vertices modulo graph Reidemeister moves applied away from the distinguished vertices. Generalizing previously known…
We present a simplified exposition of some classical and modern results on graph drawings in the plane. These results are chosen so that they illustrate some spectacular recent higher-dimensional results on the border of topology and…
We present recent advances in harmonic analysis on infinite graphs. Our approach combines combinatorial tools with new results from the theory of unbounded Hermitian operators in Hilbert space, geometry, boundary constructions, and spectral…
We introduce two new families of polynomial invariants of oriented classical and virtual knots and links defined as decategorfications of the quandle coloring quiver. We provide examples to illustrate the computation of the invariants, show…
We define a new graph invariant called the scramble number. We show that the scramble number of a graph is a lower bound for the gonality and an upper bound for the treewidth. Unlike the treewidth, the scramble number is not minor monotone,…
This is a survey of known algorithms in algebraic topology with a focus on finite simplicial complexes and, in particular, simplicial manifolds. Wherever possible an elementary approach is chosen. This way the text may also serve as a…
We show that (as conjectured by Lin and Wang) when a Vassiliev invariant of type $m$ is evaluated on a knot projection having $n$ crossings, the result is bounded by a constant times $n^m$. Thus the well known analogy between Vassiliev…
This article surveys the use of configuration space integrals in the study of the topology of knot and link spaces. The main focus is the exposition of how these integrals produce finite type invariants of classical knots and links. More…
Presented approach in polynomial time calculates large number of invariants for each vertex, which won't change with graph isomorphism and should fully determine the graph. For example numbers of closed paths of length k for given starting…
We focus on two specific generalizations of the chromatic symmetric function: one involving universal graphs and the other concerning vertex-weighted graphs. In this paper, we introduce a unified generalization that incorporates both…
We take the fundamental group of the complement of the branch curve of a generic projection induced from canonical embedding of a surface. This group is stable on connected components of moduli spaces of surfaces. Since for many classes of…
This article is a survey of the exponential polynomials (also called single-variable Bell polynomials) from the point of view of Analysis. Some new properties are included and several Analysis-related applications are mentioned.
We extend knot contact homology to a theory over the ring $\mathbb{Z}[\lambda^{\pm 1},\mu^{\pm 1}]$, with the invariant given topologically and combinatorially. The improved invariant, which is defined for framed knots in $S^3$ and can be…
In this paper, we survey results regarding the interlace polynomial of a graph, connections to such graph polynomials as the Martin and Tutte polynomials, and generalizations to the realms of isotropic systems and delta-matroids.
We introduce an invariant of alternating knots and links (called here WRP), namely a pair of integer polynomials associated with their two checkerboard planar graphs from their minimal diagram. We prove that the invariant is well-defined…
We study free scalar field theory on a graph, which gives rise to a modified version of discrete Green's function on a graph studied in \cite{CY}. We show that this gives rise to a graph invariant, which is closely related to the 2-dim…
For polynomials and rational maps of fixed degree over a finite field, we bound both the average number of connected components of their functional graphs as well as the average number of periodic points of their associated dynamical…