Related papers: Computer Bounds for Kronheimer-Mrowka Foam Evaluat…
Topological color codes defined by the 4.8.8 semiregular lattice feature geometrically local check operators and admit transversal implementation of the entire Clifford group, making them promising candidates for fault-tolerant quantum…
In this work we study approximation algorithms for the \textit{Bounded Color Matching} problem (a.k.a. Restricted Matching problem) which is defined as follows: given a graph in which each edge $e$ has a color $c_e$ and a profit $p_e \in…
In this paper we have given a unified graph coloring algorithm for planar graphs. The problems that have been considered in this context respectively, are vertex, edge, total and entire colorings of the planar graphs. The main tool in the…
The approach is through a singularity analysis of generating functions for 3- and 4-connected triangulations, asymptotic analysis, properties of the ${{}_3F_2}$ hypergeometric series, and Tutte's enumerative work on planar maps and…
We give a pictorial proof that transparently illustrates why four colours suffce to chromatically differentiate any set of contiguous, simply connected and bounded, planar spaces; by showing that there is no minimal planar map. We show,…
This work studies and develop projection-free algorithms for online learning with linear optimization oracles (a.k.a. Frank-Wolfe) for handling the constraint set. More precisely, this work (i) provides an improved (optimized) variant of an…
Suppose that the vertices of ${\mathbb Z}^d$ are assigned random colors via a finitary factor of independent identically distributed (iid) vertex-labels. That is, the color of vertex $v$ is determined by a rule that examines the labels…
In this paper, two recursion formulae of chromatic polynomial of a maximal planar graph G are obtained. Moreover, the application of these formulaes to the proof of Four-Color Conjecture is investigated. By using these formulae, the proof…
Producing spatial transformations that are diffeomorphic is a key goal in deformable image registration. As a diffeomorphic transformation should have positive Jacobian determinant |J| everywhere, the number of voxels with |J|<0 has been…
Progress along the line of a previous article are reported. One main point is to include chiral operators with fractional quantum group spins (fourth or sixth of integers) which are needed to achieve modular invariance. We extend the study…
Since the proof of the four color theorem in 1976, computer-generated proofs have become a reality in mathematics and computer science. During the last decade, we have seen formal proofs using verified proof assistants being used to verify…
A Birch and Swinnerton-Dyer conjecture for number fields $K / \mathbb{Q}$ would assert that $dim V_K = ord_{s = 1/2} \zeta_K (s)$ for some vector space functorially attached to $K$. Presently there is no natural candidate for the $V_K$'s.…
Consider the Hales-Jewett theorem. The $k$-dimensional version of it tells us that the combinatorial space $\mathcal{U}_{M, \Lambda} = \{ \eta \mid \eta: M \to \Lambda \}$ has, under suitable assumptions, monochromatic $k$-dimensional…
In this paper we introduce a new invariant of virtual knots and links that is non-trivial for infinitely many virtuals, but is trivial on classical knots and links. The invariant is initially be expressed in terms of a relative of the…
The 2-twist spun trefoil is an example of a sphere that is knotted in 4-dimensional space. Here this example is shown to be distinct from the same sphere with the reversed orientation. To demonstrate this fact a state-sum invariant for…
In this paper we describe progress made toward the construction of the Witten-Reshetikhin-Turaev theory of knot invariants from the geometric point of view. This is done in the perspective of a joint result of the author with A. Uribe which…
Checkerboard framings are an extension of checkerboard colorings for virtual links. According to checkerboard framings, in 2017, Dye obtained an independent invariant of virtual links: the cut point number. Checkerboard framings and cut…
In this thesis, we investigate the computational content and the logical strength of Ramsey's theorem and its consequences. For this, we use the frameworks of reverse mathematics and of computable reducibility. We proceed to a systematic…
Sutured Floer homology, denoted by SFH, is an invariant of balanced sutured manifolds previously defined by the author. In this paper we give a formula that shows how this invariant changes under surface decompositions. In particular, if…
Scattering amplitudes for colored theories have recently been formulated in a new way, in terms of curves on surfaces. In this note we describe a canonical set of functions we call surface functions, associated to all orders in the…