Related papers: Cobounding odd cycle colorings
We prove an explicit cabling formula for the colored Jones polynomial. As an application we prove the volume conjecture for all zero volume knots and links, i.e. all knots and links that are obtained from the unknot by repeated cabling and…
A coloring of a direct product of graphs is said to be {\em trivial} iff it is induced by some coloring of a factor of the product. A graph $G$ is trivially power colorable iff every coloring of a finite power of $G$ with $\chi(G)$-many…
Motivated by the work in [15], this paper deals with the theory of the braids from chromatic configuration spaces. This kind of braids possess the property that some strings of each braid may intersect together and can also be untangled, so…
We introduce the definability strength of combinatorial principles. In terms of definability strength, a combinatorial principle is strong if solving a corresponding combinatorial problem could help in simplifying the definition of a…
The Conway potential function (CPF) for colored links is a convenient version of the multi-variable Alexander-Conway polynomial. We give a skein characterization of CPF, much simpler than the one by Murakami. In particular, Conway's…
Given a projective morphism of compact, complex, algebraic varieties and a relatively ample line bundle on the domain we prove that a suitable choice, dictated by the line bundle, of the decomposition isomorphism of the Decomposition…
In the minimum sum edge coloring problem, we aim to assign natural numbers to edges of a graph, so that adjacent edges receive different numbers, and the sum of the numbers assigned to the edges is minimum. The {\em chromatic edge strength}…
Quandle colorings and cocycle invariants are studied for composite knots, and applied to chirality and abelian extensions. The square and granny knots, for example, can be distinguished by quandle colorings, so that a trefoil and its mirror…
We prove that the bigraded colored Khovanov-Rozansky type A link and tangle invariants are functorial with respect to link and tangle cobordisms.
In this note, we would like to propose a suitable extension of the arithmetic Chow group of codimension one, in which the Hodge index theorem holds. We also prove an arithmetic analogue of Bogomolov's instability theorem for rank 2 vector…
We introduce the notion of refined unramified cohomology of algebraic schemes and prove comparison theorems that identify some of these groups with cycle groups. This recovers for cycles of low codimensions on smooth projective varieties…
We prove a Livsic type theorem for cocycles taking values in groups of diffeomorphisms of low-dimensional manifolds. The results hold without any localization assumption and in very low regularity. We also obtain a general result (in any…
We develop a topological framework in an attempt to generalize the classical colourful Caratheodory theorem by imposing an additional constraint. For that we introduce the notion of zero-avoding complexes and covering criteria for the…
A path (cycle) is properly-colored if consecutive edges are of distinct colors. In 1997, Bang-Jensen and Gutin conjectured a necessary and sufficient condition for the existence of a Hamilton path in an edge-colored complete graph. This…
We show that on a dense open set of analytic one-frequency complex valued cocycles in arbitrary dimension Oseledets filtration is either dominated or trivial. The underlying mechanism is different from that of the Bochi-Viana Theorem for…
K. Cho and S. Nelson introduced the notion of a quandle coloring quiver, which is a quiver-valued link invariant, and a quandle cocycle quiver which is an enhancement of the quandle coloring quiver by assigning to each vertex a weight…
The main result of this paper is a proof of the following conjecture of Babson & Kozlov: Theorem. Let G be a graph of maximal valency d, then the complex Hom(G,K_n) is at least (n-d-2)-connected. Here Hom(-,-) denotes the polyhedral complex…
We prove that every family of (not necessarily distinct) odd cycles $O_1, \dots, O_{2\lceil n/2 \rceil-1}$ in the complete graph $K_n$ on $n$ vertices has a rainbow odd cycle (that is, a set of edges from distinct $O_i$'s, forming an odd…
We say that a vertex or edge colouring of a graph is distinguishing if the only automorphism that preserves this colouring is the identity. A (proper) distinguishing colouring is irreducible if there is no possibility of merging two…
This paper has been withdrawn by the author. Peterson and Woodall previously proved that the list-edge-colouring conjecture holds for graphs without odd cycles of length 5 or longer. D. Peterson and D. R. Woodall, Edge-choosability in…