Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

169,291 papers · 148 categories

Trend · papers per month

1223 · Dec 201919922001200920182026
48 results for A-colorings

The contents of this 98-page paper have been subsumed into the 191-page paper "A colored sl(N)-homology for links in S^3" (arXiv:0907.0695v1 [math.GT]), in which we further develop the theory and use it to construct a colored link homology.

2008-03-14abs ↗pdf ↗

Aicardi's invariant F(L)F(L) is extended to colored singular links using graphical calculus.

problem Constructing an invariant for colored classical and singular links.
method State-sum model using graphical calculus for oriented, colored, 4-valent planar graphs.
result Extends F(L)F(L) to colored singular links, showing it's stronger than HOMFLY-PT polynomial.

The slope of a colored link in an integral homology sphere is a rational function that generalizes the Kojima-Yamasaki η-function.

problem Defining and understanding the slope of colored links in integral homology spheres.
method Defining the slope as a rational function of Conway potentials and using generalized skein relations for tangles.
result The slope is responsible for an extra correction term in the signature formula for the splice of two links.

Budney recently constructed an operad that encodes splicing of knots. He further showed that the space of (long) knots is generated over this operad by the space of torus knots and hyperbolic knots, thus generalizing the satellite decomposition of knots from isotopy classes to the level of the space of knots. Infection…

2013-11-17abs ↗pdf ↗

If a knot has the Alexander polynomial not equal to 1, then it is linear nn-colorable. By means of such a coloring, such a knot is given an upper bound for the minimal quandle order, i.e., the minimal order of a quandle with which the knot is quandle colorable. For twist knots, we study the minimal quandle orders in d…

2011-10-18abs ↗pdf ↗

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 (…

2014-06-09abs ↗pdf ↗

We define a Khovanov homotopy type for sl2(C)sl_2(\mathbb{C}) colored links and quantum spin networks and derive some of its basic properties. In the case of nn-colored B-adequate links, we show a stabilization of the homotopy types as the coloring nn\rightarrow\infty, generalizing the tail behavior of the colored Jones …

2016-02-11abs ↗pdf ↗

This paper unifies observability notions for colored graphs and identifies graph modifications to improve observability.

problem Observability of colored graphs and its relationship to graph properties.
method Unified framework of observability notions, graph modifications, and NP-completeness results.
result Identification of graph modifications to improve observability and NP-completeness of one modification problem.

If all but two vertices of a triangulated sphere have degrees divisible by kk, then the exceptional vertices are not adjacent. This theorem is proved for k=2k=2 with the help of the coloring monodromy. For k=3,4,5k = 3, 4, 5 colorings by the vertices of platonic solids have to be used. With a coloring monodromy one can asso…

2015-03-02abs ↗pdf ↗

We associate a moduli problem to a colored trivalent graph; such graphs, when planar, appear in the state-sum description of the quantum sl(N) knot polynomial due to Murakami, Ohtsuki, and Yamada. We discuss how the resulting moduli space can be thought of a representation variety. We show that the Euler characteristic…

2012-04-24abs ↗pdf ↗

It can be conjectured that the colored Jones function of a knot can be computed in terms of counting paths on the graph of a planar projection of a knot. On the combinatorial level, the colored Jones function can be replaced by its weight system. We give two curious formulas for the weight system of a colored Jones fun…

2002-03-01abs ↗pdf ↗

Taking the signature of the closure of a braid defines a map from the braid group to the integers. In 2005, Gambaudo and Ghys expressed the homomorphism defect of this map in terms of the Meyer cocycle and the Burau representation. In the present paper, we simultaneously extend this result in two directions, considerin…

2015-07-28abs ↗pdf ↗

The study of tiling homology on flat surfaces, proving impossibility of certain tilings.

problem Proving the non-existence of polyomino tilings on specific square-tiled surfaces.
method Study of homology groups for topological tilings, using coloring proofs.
result Several results about the non-existence of polyomino tilings on certain square-tiled surfaces.

Fix an integer N>1. To each diagram of a link colored by 1,...,N, we associate a chain complex of graded matrix factorizations. We prove that the homotopy type of this chain complex is invariant under Reidemeister moves. When every component of the link is colored by 1, this chain complex is isomorphic to the chain com…

2009-07-03abs ↗pdf ↗

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

2006-09-20abs ↗pdf ↗

Hybrid deep learning algorithm optimizes register allocation for compiler.

problem Efficiently coloring interference graphs for register allocation.
method Deep learning network trained on random graphs, augmented with a color correction phase.
result Hybrid algorithm performs well compared to optimal and greedy register allocators.

We give a construction of quandle cocycles from group cocycles, especially, for any integer p \geq 3, quandle cocycles of the dihedral quandle R_p from group cocycles of the cyclic group Z/p. We will show that a group 3-cocycle of Z/p gives rise to a non-trivial quandle 3-cocycle of R_p. When p is an odd prime, since d…

2010-12-16abs ↗pdf ↗

A coloring scheme improves graph neural networks for node disambiguation.

problem Improving graph neural networks' ability to distinguish identical node attributes.
method Introducing a graph neural network called Colored Local Iterative Procedure (CLIP) that uses colors to disambiguate node attributes.
result CLIP is a universal approximator of continuous functions on graphs with node attributes.

Categorifies quantum invariants using cobordism categories and operads.

problem Categorify quantum invariants using cobordism categories and operads.
method Constructs a cobordism category with a colored operad action, categorifies quantum slnsl_n invariants.
result Consistency of the cobordism category and explicit functor to matrix factorizations conjectured.

This paper consists of three parts. First, we generalize the Jaeger Formula to express the Kauffman-Vogel graph polynomial as a state sum of the Murakami-Ohtsuki-Yamada graph polynomial. Then, we demonstrate that reversing the orientation and the color of a MOY graph along a simple circuit does not change the sl(N) Mur…

2011-07-26abs ↗pdf ↗

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

problem Computing the volume of hyperbolic polyhedral 3-manifolds.
method Introduces a relative version of Turaev-Viro invariants for ideally triangulated compact 3-manifolds with boundaries and a coloring on edges.
result Proves the Volume Conjecture for these invariants, suggesting a method to solve the conjecture for hyperbolic 3-manifolds with totally geodesic boundary.

Study uses knot theory to model RNA foldings, emphasizing both entanglement and intrachain interactions.

problem Modeling RNA foldings considering both entanglement and intrachain interactions.
method Combines knot theory with embedded rigid vertex graphs to emphasize both entanglement and intrachain interactions of RNA foldings.
result Defines and computes a coloring counting invariant for stuck links, providing explicit computations for arc diagrams of RNA foldings.

We extend Lipshitz-Sarkar's definition of a stable homotopy type associated to a link L whose cohomology recovers the Khovanov cohomology of L. Given an assignment c (called a coloring) of positive integer to each component of a link L, we define a stable homotopy type X_col(L_c) whose cohomology recovers the c-colored…

2016-02-03abs ↗pdf ↗

Quaternion CNN outperforms traditional CNN in color image reconstruction.

problem Efficient image processing with small or heterogeneous datasets.
method Introducing quaternion-valued convolutional neural networks (QCNN) to learn internal and external relations.
result QCAE outperforms CAE in reconstructing unseen color images.

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 …

1998-05-12abs ↗pdf ↗