Related papers: Computer Bounds for Kronheimer-Mrowka Foam Evaluat…
The four-color theorem states that no more than four colors are required to color all nodes in planar graphs such that no two adjacent nodes are of the same color. The theorem was first propounded by Francis Guthrie in 1852. Since then,…
A distinguishing colouring of a graph is a colouring of the vertex set such that no non-trivial automorphism preserves the colouring. Tucker conjectured that if every non-trivial automorphism of a locally finite graph moves infinitely many…
This is a treatise on finite point configurations spanning a fixed volume to be found in a single color-class of an arbitrary finite (measurable) coloring of the Euclidean space $\mathbb{R}^n$, or in a single large measurable subset…
We demonstrate that the Weihrauch lattice can be used to classify the uniform computational content of computability-theoretic properties as well as the computational content of theorems in one common setting. The properties that we study…
Lipshitz, Ozsv\'ath and Thurston defined a bordered Heegaard Floer invariant CFDA for 3-manifolds with two boundary components, including mapping cylinders for surface diffeomorphisms. We define a related invariant for certain 4-dimensional…
Rooted in group field theory and matrix models, random tensor models are a recent background-invariant approach to quantum gravity in arbitrary dimensions. Colored tensor models (CTM) generate random triangulated orientable…
We study the problem of finding homomorphisms into odd cycles from planar graphs with high odd-girth. The Jaeger-Zhang conjecture states that every planar graph of odd-girth at least $4k+1$ admits a homomorphism to the odd cycle $C_{2k+1}$.…
Starting from the foundational axiomatization of the perceptual color space initiated by Schr\"odinger in 1920 and eventually refined by Resnikoff in 1974, Berthier, Provenzi and their collaborators have recently proposed a reformulation of…
Under mild assumptions, we characterise modules with projective resolutions of length n in the target category of filtrated K-theory over a finite topological space in terms of two conditions involving certain Tor-groups. We show that the…
Hot big bang cosmology says nothing about the topology of the Universe. A topology-independent algorithm is presented which is complementary to that of Lehoucq et al. 1996 and which searches for evidence of multi-connectedness using…
Node coloring is the task of assigning colors to the nodes of a graph such that no two adjacent nodes have the same color, while using as few colors as possible. It is the most widely studied instance of graph coloring and of central…
Hassler Whitney's theorem of 1931 reduces the task of finding proper, vertex 4-colorings of triangulations of the 2-sphere to finding such colorings for the class \(\mathfrak H\) of triangulations of the 2-sphere that have a Hamiltonian…
Webs are planar graphs with boundary that describe morphisms in a diagrammatic representation category for $\mathfrak{sl}_k$. They are studied extensively by knot theorists because braiding maps provide a categorical way to express link…
We study K-theoretic Gromov--Witten invariants of projective hypersurfaces using a virtual localization formula under finite group actions. In particular, it provides all K-theoretic Gromov--Witten invariants of the quintic threefold modulo…
This is a mathematical commentary on Teichm{\"u}ller's paper ``Bestimmung der extremalen quasikonformen Abbildungen bei geschlossenen orientierten Riemannschen Fl{\"a}chen'' (Determination of extremal quasiconformal maps of closed oriented…
Over a perfect field $k$ of characteristic $p > 0$, we construct a ``Witt vector cohomology with compact supports'' for separated $k$-schemes of finite type, extending (after tensorisation with $\mathbb{Q}$) the classical theory for proper…
Colored tensor models have recently burst onto the scene as a promising conceptual and computational tool in the investigation of problems of random geometry in dimension three and higher. We present a snapshot of the cutting edge in this…
This paper proposes a connection between algebraic K-theory and foam cobordisms, where foams are stratified manifolds with singularities of a prescribed form. We consider $n$-dimensional foams equipped with a flat bundle of…
We work with simple graphs in ZF (Zermelo--Fraenkel set theory without the Axiom of Choice (AC)) and assume that the sets of colors can be either well-orderable or non-well-orderable to prove that the following statements are equivalent to…
We study webs in quantum type $C$, focusing on the rank three case. We define a linear pivotal category $\mathbf{Web}(\mathfrak{sp}_6)$ diagrammatically by generators and relations, and conjecture that it is equivalent to the category…