Related papers: Colored tangles and signatures

The third author recently proved that the Shoikhet-Dolgushev L-infinity-morphism from Hochschild chains of the algebra of smooth functions on manifold to differential forms extends to cyclic chains. Localization at a solution of the…

A signed graph is a simple graph with two types of edges. Switching a vertex $v$ of a signed graph corresponds to changing the type of each edge incident to $v$. A homomorphism from a signed graph $G$ to another signed graph $H$ is a…

Turaev showed that there is a well-defined map assigning to an oriented link L in the three-sphere a Spin structure t_0 on Sigma(L), the 2-fold cover of S^3 branched along L. We prove, generalizing results of Manolescu-Owens and…

Let $\bar{M}$ be a manifold with boundary $Y$ which is the total space of a fibre bundle, and is defined by the vanishing of a boundary defining function, $x$. We prove $L^2$ Hodge and signature theorems for $M$ endowed with a metric of the…

We construct a functor from the category of oriented tangles in R^3 to the category of Hermitian modules and Lagrangian relations over Z[t,t^{-1}]. This functor extends the Burau representations of the braid groups and its generalization to…

Coloring numbers are one of the simplest combinatorial invariants of knots and links to describe. And with Joyce's introduction of quandles, we can understand them more algebraically. But can we extend these invariants to tangles -- knots…

Let $G$ be a planar graph and let $C$ be a cycle in $G$. Inside of each finite face of $G$, we write down the number of edges of that face which belong to $C$. This is the signature of $C$ in $G$. The notion of a signature arises naturally…

In 2020, Behr defined the problem of edge coloring of signed graphs and showed that every signed graph $(G, \sigma)$ can be colored using exactly $\Delta(G)$ or $\Delta(G) + 1$ colors, where $\Delta(G)$ is the maximum degree in graph $G$.…

A signed graph $(G, \sigma)$ is a graph $G$ along with a function $\sigma: E(G) \to \{+,-\}$. A closed walk of a signed graph is positive (resp., negative) if it has an even (resp., odd) number of negative edges, counting repetitions. A…

By coloring a signed graph by signed colors, one obtains the signed chromatic polynomial of the signed graph. For each signed graph we construct graded cohomology groups whose graded Euler characteristic yields the signed chromatic…

Arc permutations, which were originally introduced in the study of triangulations and characters, have recently been shown to have interesting combinatorial properties. The first part of this paper continues their study by providing signed…

A colored graph is a directed graph in which nodes or edges have been assigned colors that are not necessarily unique. Observability problems in such graphs consider whether an agent observing the colors of edges or nodes traversed on a…

Refinements of the transchromatic generalized character maps are constructed by taking into account the torus action on the inertia groupoid (also known as the Fix functor). The relationship between this construction and the geometry of…

A meromorphic quadratic differential on a compact Riemann surface defines a complex projective structure away from the poles via the Schwarzian equation. In this article we first prove the analogue of Thurston's Grafting Theorem for the…

Proper vertex colorings of a graph are related to its boundary map, also called its signed vertex-edge incidence matrix. The vertex Laplacian of a graph, a natural extension of the boundary map, leads us to introduce nowhere-harmonic…

We introduce a generalization of oriented tangles, which are still called tangles, so that they are in one-to-one correspondence with the sutured manifolds. We define cobordisms between sutured manifolds (tangles) by generalizing cobordisms…

We investigate a class of 2-edge coloured bipartite graphs known as alternating signed bipartite graphs (ASBGs) that encode the information in alternating sign matrices. The central question is when a given bipartite graph admits an…

We introduce the concept of a $k$-token signed graph and study some of its combinatorial and algebraic properties. We prove that two switching isomorphic signed graphs have switching isomorphic token graphs. Moreover, we show that the…

Stanley introduced the chromatic symmetric function of a simple graph, which is a generalization of a chromatic polynomial. This is expressed in terms of the integer points of the complements of the corresponding graphic arrangement.…

We characterize the fractional Dehn twist coefficient of a braid in terms of a slope of the homogenization of the Upsilon function, where Upsilon is the function-valued concordance homomorphism defined by Ozsv\'ath, Stipsicz, and Szab\'o.…