Related papers: Polynomial invariants of cyclically ordered graphs
A group invariant for links in thickened closed orientable surfaces is studied. Associated polynomial invariants are defined. The group detects nontriviality of a virtual link and determines its virtual genus.
We present a construction of new invariant sets for fibred polynomial dynamics with base an irrational rotation over the unit circle, called multi-curves. Furthermore, the local dynamical theory for attracting invariant curves is extended…
The notion of a pseudoknot is defined as an equivalence class of knot diagrams that may be missing some crossing information. We provide here a topological invariant schema for pseudoknots and their relatives, 4-valent rigid vertex spatial…
The study of Feynman rules is much facilitated by the two Symanzik polynomials, homogeneous polynomials based on edge variables for a given Feynman graph. We review here the role of a recently discovered third graph polynomial based on…
We construct knot invariants from the radical part of projective modules of restricted quantum groups. We also show a relation between these invariants and the colored Alexander invariants.
We define an invariant of welded virtual knots from each finite crossed module by considering crossed module invariants of ribbon knotted surfaces which are naturally associated with them. We elucidate that the invariants obtained are non…
We study functional graphs generated by quadratic polynomials over prime fields. We introduce efficient algorithms for methodical computations and provide the values of various direct and cumulative statistical parameters of interest. These…
Roots of graph polynomials such as the characteristic polynomial, the chromatic polynomial, the matching polynomial, and many others are widely studied. In this paper we examine to what extent the location of these roots reflects the graph…
This paper revisits the notion of classical orthogonal polynomials from a broader functional-analytic point of view. It is intended neither as a survey of known results nor as a review of the literature, but rather as a conceptual…
Mixed graphs have both directed and undirected edges. A mixed cage is a regular mixed graph of given girth with minimum possible order. In this paper mixed cages are studied. Upper bounds are obtained by general construction methods and…
The class of closed graphs by a linear ordering on their sets of vertices is investigated. A recent characterization of such a class of graphs is analyzed by using tools from the proper interval graph theory.
In this work, we give a formula for the logarithmic invariant of knots in terms of certain derivatives of the colored Jones invariant. This invariant is related to the logarithmic conformal field theory, and was defined by using the centers…
We consider an algebra of (classical or virtual) tangles over an ordered circuit operad and introduce Conway-type invariants of tangles which respect this algebraic structure. The resulting invariants contain both the coefficients of the…
Directed acyclic graphs (DAGs) are commonly used to model causal relationships among random variables. In general, learning the DAG structure is both computationally and statistically challenging. Moreover, without additional information,…
Directed acyclic graphs whose nodes are all the divisors of a positive integer $n$ and arcs $(a,b)$ defined by $a$ divides $b$ are considered. Fourteen graph invariants such as order, size, and the number of paths are investigated for two…
We define scrollar invariants of tropical curves with a fixed divisor of rank 1. We examine the behavior of scrollar invariants under specialization, and provide an algorithm for computing these invariants for a much-studied family of…
Graphs arise naturally in many real-world applications including social networks, recommender systems, ontologies, biology, and computational finance. Traditionally, machine learning models for graphs have been mostly designed for static…
We define a range of new coarse geometric invariants based on various graph-theoretic measures of complexity for finite graphs, including: treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these…
We introduce cyclic diagram monoids, a generalisation of classical diagram monoids that adds elements of arbitrary period by including internal components, with a view towards cryptography. We classify their simple representations and…
Motivated by circle graphs, and the enumeration of Euler circuits, we define a one-variable ``interlace polynomial'' for any graph. The polynomial satisfies a beautiful and unexpected reduction relation, quite different from the cut and…