arXiv research

Bundling of graph edges (node-to-node connections) is a common technique to enhance visibility of overall trends in the edge structure of a large graph layout, and a large variety of bundling algorithms have been proposed. However, with strong bundling, it becomes hard to identify origins and destinations of individual…

Develops new methods to create imperceptible image changes that fool classifiers.

We show that the edges of every 3-connected planar graph except $K_4$ can be colored with two colors in such a way that the graph has no color preserving automorphisms. Also, we characterize all graphs which have the property that their edges can be $2$-colored so that no matter how the graph is embedded in any orienta…

Algorithm determines spatial graph isomorphism with vertex, edge colorings and orientations.

Consider the collection of edge bicolorings of a graph that is cellularly embedded on an orientable surface. In this work, we count the number of equivalence classes of such colorings under two relations: reversing colors around a face and reversing colors around a vertex. In the case of the plane, this is well studied…

Counterexample disproves Spencer-Brown's claim about parity-pass algorithm.

By means of color chord diagrams we establish a necessary and sufficient condition for $O$-topological equivalence of functions with one essentially critical point on oriented surfaces with edge. We also calculate the number of $O$-topologically non-equivalent functions with one essentially critical point on oriented s…

In this article we give an explicit description of the representation matrix of a Heisenberg type action constructed by Blanchet, Habegger, Masbaum and Vogel. We give the matrix in terms of a ribbon graph and its admissible colorings. We show that components of the representation matrix satisfies the {\it external edge…

We consider triangulations of surfaces with edges painted three colors so that edges of each triangle have different colors. Such structures arise as Belyi data (or Grothendieck dessins d'enfant), on the other hand they enumerate pairs of permutations determined up to a common conjugation. The topic of these notes is l…

The study characterizes torus links' coloring quivers using dihedral quandles.

The paper tackles fair correlation clustering with fairness constraints.

Paper describes a state sum formula for a graph coloring polynomial.

The paper finds 3-colorings of 2-sphere triangulations.

In this article we describe a canonical way to expand a certain kind of $(\mathbb Z_2)^{n+1}$-colored regular graphs into closed $n$-manifolds by adding cells determined by the edge-colorings inductively. We show that every closed combinatorial $n$-manifold can be obtained in this way. When $n\leq 3$, we give simple eq…

Every cubic graph is a bridge trisection's 1-skeleton for a knotted surface.

Murakami-Ohtsuki-Yamada introduced an evaluation of certain oriented planar trivalent graphs with colored edges. This evaluation plays a key role in the evaluation of the colored HOMFLY polynomial of a link in 3-space and its Khovanov-Rozansky categorification. Our goal is is to give a generating series formula for the…

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 path in the graph can determine which node they are at currently or which nodes wer…

CMRFs extend PGMs for topological data, capturing both conditional and marginal dependencies.

A classical spin network consists of a ribbon graph (i.e., an abstract graph with a cyclic ordering of the vertices around each edge) and an admissible coloring of its edges by natural numbers. The standard evaluation of a spin network is an integer number. In a previous paper, we proved an existence theorem for the as…

Defines a new version of Turaev-Viro invariants for 3-manifolds with boundaries.

Most digital cameras use sensors coated with a Color Filter Array (CFA) to capture channel components at every pixel location, resulting in a mosaic image that does not contain pixel values in all channels. Current research on reconstructing these missing channels, also known as demosaicing, introduces many artifacts, …

A link diagram is said to be lune-free if, when viewed as a 4-regular plane graph it does not have multiple edges between any pair of nodes. We prove that any colored link diagram is equivalent to a colored lune-free diagram with the same number of colors. Thus any colored link diagram with a minimum number of colors (…

A new method solves graph coloring problems using gradient descent.

The paper introduces a quantum state system to count perfect matchings in graphs.

A {\em balanced} spatial graph has an integer weight on each edge, so that the directed sum of the weights at each vertex is zero. We describe the Alexander module and polynomial for balanced spatial graphs (originally due to Kinoshita \cite{ki}), and examine their behavior under some common operations on the graph. We…

We formulate a conjecture (already proven by A. Kricker) about the structure of Kontsevich integral of a knot. We describe its value in terms of the generating functions for the numbers of external edges attached to closed 3-valent diagrams. We conjecture that these functions are rational functions of the exponentials …

Paper proposes an algorithm to reconstruct optimal model structure from graph adjacency matrix.

Solves weighted bi-colored plane tree enumeration and applies to geometric problems.

SU(3) instanton homology counts Tait colorings for webs and foams.

Hybrid deep learning algorithm optimizes register allocation for compiler.

Study abelian factors in Lie algebras from graph edge labels.

A representation for compact 3-manifolds with non-empty non-spherical boundary via 4-colored graphs (i.e., 4-regular graphs endowed with a proper edge-coloration with four colors) has been recently introduced by two of the authors, and an initial classification of such manifolds has been obtained up to 8 vertices of th…

The article studies embeddings of edge-colored graphs related to balanced 3- and 4-manifolds.

Proves volume conjecture for double twist knots using complexified tetrahedrons.

Let N be a regular branched cover of a homology 3-sphere M with deck group G isomorphic to Z_2^d and branch set a trivalent graph Gamma; such a cover is determined by a coloring of the edges of Gamma with elements of G. For each index-2 subgroup H of G, M_H = N/H is a double branched cover of M. Sakuma has proved that …

We construct a small regular cellular decomposition of the Fulton MacPherson operad $FM_2$ that is compatible with the operad composition. The cells are indexed by trees with edges of two colors and vertices labelled by cells of the cacti operad. We compute the generating functions counting the cells, that are algebrai…

Gem theory helps estimate trisection genus of 4-manifolds.

The generalized volume conjecture and the AJ conjecture (a.k.a. the quantum volume conjecture) are extended to $U_q(\fraksl_2)$ colored quantum invariants of the theta and tetrahedron graph. The $\SL(2,\bC)$ character variety of the fundamental group of the complement of a trivalent graph with $E$ edges in $S^3$ is a L…

The paper connects Kirby diagrams and 5-colored graphs to represent 4-manifolds.

Convolutional neural networks (CNN) have recently achieved state-of-the-art results in various applications. In the case of image recognition, an ideal model has to learn independently of the training data, both local dependencies between the three components (R,G,B) of a pixel, and the global relations describing edge…

A strong interaction is known to exist between edge-colored graphs (which encode PL pseudo-manifolds of arbitrary dimension) and random tensor models (as a possible approach to the study of Quantum Gravity). The key tool is the {\it G-degree} of the involved graphs, which drives the {\it $1/N$ expansion} in the tensor …

We consider certain invariants of links in 3-manifolds, obtained by a specialization of the Turaev-Viro invariants of 3-manifolds, that we call colored Turaev-Viro invariants. Their construction is based on a presentation of a pair (M,L), where M is a closed oriented 3-manifold and L is an oriented link in M, by a tria…

The paper shows links can be colored with fewer colors than previously thought.

In this paper, it is explained that a topological invariant for 3-manifold $M$ with $b_1(M)=1$ can be constructed by applying Fukaya's Morse homotopy theoretic approach for Chern--Simons perturbation theory to a local system on $M$ of rational functions associated to the free abelian covering of $M$. Our invariant take…

For a link with zero determinants, a Z-coloring is defined as a generalization of Fox coloring. We call a link having a diagram which admits a non-trivial Z-coloring a Z-colorable link. The minimal coloring number of a Z-colorable link is the minimal number of colors for non-trivial Z-colorings on diagrams of the link.…

Study on knots using 17 colors, finding specific color assignments.

It was shown that any $\mathbb{Z}$-colorable link has a diagram which admits a non-trivial $\mathbb{Z}$-coloring with at most four colors. In this paper, we consider minimal numbers of colors for non-trivial $\mathbb{Z}$-colorings on minimal diagrams of $\mathbb{Z}$-colorable links. We show, for any positive integer $N…

Biological and cellular systems are often modeled as graphs in which vertices represent objects of interest (genes, proteins, drugs) and edges represent relational ties among these objects (binds-to, interacts-with, regulates). This approach has been highly successful owing to the theory, methodology and software that …