Related papers: Computer Bounds for Kronheimer-Mrowka Foam Evaluat…
Machine learning models are a powerful theoretical tool for analyzing data from quantum simulators, in which results of experiments are sets of snapshots of many-body states. Recently, they have been successfully applied to distinguish…
We study the cosmological information contained in the cosmic web, categorized as four structure types: nodes, filaments, walls, and voids, using the Quijote simulations and a modified nexus+ algorithm. We show that splitting the density…
We define a cohomology for an arbitrary $K$-linear semistrict semigroupal 2-category $(\mathfrak{C},\otimes)$ (called in the paper a Gray semigroup) and show that its first order (unitary) deformations, up to the suitable notion of…
Due to the undecidability of most type-related properties of System F like type inhabitation or type checking, restricted polymorphic systems have been widely investigated (the most well-known being ML-polymorphism). In this paper we…
To any rigid analytic space (in the sense of Fujiwara-Kato) we assign an $\mathbb{A}^1$-invariant rigid analytic homotopy category with coefficients in any presentable category. We show some functorial properties of this assignment as a…
Let $C_1,\dots,C_{d+1}\subset \mathbb{R}^d$ be $d+1$ point sets, each containing the origin in its convex hull. We call these sets color classes, and we call a sequence $p_1, \dots, p_{d+1}$ with $p_i \in C_i$, for $i = 1, \dots, d+1$, a…
We study closed choice principles for different spaces. Given information about what does not constitute a solution, closed choice determines a solution. We show that with closed choice one can characterize several models of…
We tackle three optimization problems in which a colored graph, where each node is assigned a color, must be partitioned into colorful connected components. A component is defined as colorful if each color appears at most once. The problems…
A facial unique-maximum coloring of a plane graph is a proper vertex coloring by natural numbers where on each face $\alpha$ the maximal color appears exactly once on the vertices of $\alpha$. Fabrici and G\"oring proved that six colors are…
In this paper we study fractional coloring from the angle of distributed computing. Fractional coloring is the linear relaxation of the classical notion of coloring, and has many applications, in particular in scheduling. It was proved by…
Building on the algebraic framework developed by Hendricks, Manolescu, and Zemke, we introduce and study a set of Floer-theoretic invariants aimed at detecting corks. Our invariants obstruct the extension of a given involution over any…
We resolve a number of long-standing open problems in online graph coloring. More specifically, we develop tight lower bounds on the performance of online algorithms for fundamental graph classes. An important contribution is that our…
Niebrzydowski introduced a theory of region colorings for surface links. In this paper, we translate the coloring invariant to the context of triplane diagrams and movies of knots. We provide inequalities between the number of region…
This paper presents a short and simple proof of the Four-Color Theorem that can be utterly checkable by human mathematicians, without computer assistance. The new key idea that has allowed it and the global structure of the proof are…
The present work points out that the Deutsch-Jozsa algorithm was the first formal description of a quantum decider. In particular, it is studied here the class of languages whose indicator functions allow the Deutsch-Jozsa algorithm to…
We study colorful no-dimensional Tverberg-type problems and obtain several optimal results. A colorful no-dimensional Tverberg-type theorem provides a bound on a radius $R$ such that, for any pairwise disjoint $k$-element subsets…
The well-known Steinberg's conjecture asserts that any planar graph without 4- and 5-cycles is 3 colorable. In this note we have given a short algorithmic proof of this conjecture based on the spiral chains of planar graphs proposed in the…
We consider a cobordism category whose morphisms are punctured connect sums of $S^1 \times S^2$'s (wormhole spaces) with embedded admissibly colored banded trivalent graphs. We define a TQFT on this cobordism category over the field of…
The Quaternion Fourier transform (QFT) is one of the key tools in studying color image processing. Indeed, a deep understanding of the QFT has created the color images to be transformed as whole, rather than as color separated component. In…
Quantum Chemistry and Physics have been pinpointed as killer applications for quantum computers, and quantum algorithms have been designed to solve the Schr\"odinger equation with the wavefunction formalism. It is yet limited to small…