Related papers: Computer Bounds for Kronheimer-Mrowka Foam Evaluat…

Kronheimer and Mrowka used gauge theory to define a functor $J^\sharp$ from a category of webs in $\mathbb{R}^3$ to the category of finite-dimensional vector spaces over the field of two elements. They also suggested a possible…

We use SO(3) gauge theory to define a functor from a category of unoriented webs and foams to the category of finite-dimensional vector spaces over the field of two elements. We prove a non-vanishing theorem for this SO(3) instanton…

We give a near-linear time 4-coloring algorithm for planar graphs, improving on the previous quadratic time algorithm by Robertson et al. from 1996. Such an algorithm cannot be achieved by the known proofs of the Four Color Theorem (4CT).…

The Four color problem is closely related to other branches of mathematics and practical applications. More than 20 of its reformulations are known, which connect this problem with problems of algebra, statistical mechanics and planning.…

In this paper, we give a proof for four color theorem(four color conjecture). Our proof does not involve computer assistance and the most important is that it can be generalized to prove Hadwiger Conjecture. Moreover, we give algorithms to…

Coloring planar Feynman diagrams in spinor quantum electrodynamics, is a non trivial model soluble without computer. Four colors are necessary and sufficient.

In this paper, we use a topological quantum field theory (TQFT) to define families of new homology theories of a $2$-dimensional CW complex of a smooth closed surface. The dimensions of these homology groups can be used to count the number…

We show that manifolds which parameterize values of first integrals of integrable finite-dimensional bihamiltonian systems carry a geometric structure which we call a {\em Kronecker web}. We describe two functors between Kronecker webs and…

This paper presents a path to proving the Four-Color Theorem that differs from the traditional "reducible configuration" method. By introducing concepts such as "outer boundary," "primitive set," "Property A," "knot," "valid pair group,"…

A dynamical classification of the cosmic web is proposed. The large scale environment is classified into four web types: voids, sheets, filaments and knots. The classification is based on the evaluation of the deformation tensor, i.e. the…

In [J. Combin. Theory Ser. B 70 (1997), 2-44] we gave a simplified proof of the Four-Color Theorem. The proof is computer-assisted in the sense that for two lemmas in the article we did not give proofs, and instead asserted that we have…

We generalize overpartitions to (k,j)-colored partitions: k-colored partitions in which each part size may have at most j colors. We find numerous congruences and other symmetries. We use a wide array of tools to prove our theorems:…

Many graph coloring proofs proceed by showing that a minimal counterexample to the theorem being proved cannot contain certain configurations, and then showing that each graph under consideration contains at least one such configuration;…

We proved that the dimension of the F-vector space J#(G) for a plane trivalent graph G, defined by Kronheimer and Mrowka using their SO(3) instanton Floer homology, is equal to the number of Tait colorings of G.

K\"onig's edge coloring theorem says that a bipartite graph with maximal degree $n$ has an edge coloring with no more than $n$ colors. We explore the computability theory and Reverse Mathematics aspects of this theorem. Computable bipartite…

In [J. Combin. Theory Ser. B 70 (1997), 2-44] we gave a simplified proof of the Four-Color Theorem. The proof is computer-assisted in the sense that for two lemmas in the article we did not give proofs, and instead asserted that we have…

The famous four color theorem states that for all planar graphs, every vertex can be assigned one of 4 colors such that no two adjacent vertices receive the same color. Since Francis Guthrie first conjectured it in 1852, it is until 1976…

The inclusion relation between simple objects in the plane may be used to define geometric set systems, or hypergraphs. Properties of various types of colorings of these hypergraphs have been the subject of recent investigations, with…

There is an extensive history of scholarship into what constitutes a "basic" color term, as well as a broadly attested acquisition sequence of basic color terms across many languages, as articulated in the seminal work of Berlin and Kay…

This article aims to provide a novel formalization of the concept of computational irreducibility in terms of the exactness of functorial correspondence between a category of data structures and elementary computations and a corresponding…