Related papers: Computer Bounds for Kronheimer-Mrowka Foam Evaluat…
Recent programs on conformal bootstrap suggest an empirical relationship between the existence of non-trivial conformal field theories and non-trivial features such as a kink in the unitarity bound of conformal dimensions in the conformal…
Van der Waerden's (VDW) colouring theorem in combinatoric number theory [1] has scope for physical applications.The solution of the two colour case has enabled the construction of an explicit mapping of an infinite, one dimensional…
We review a new theory of orthogonal separation of variables on pseudo-Riemannian spaces of constant zero curvature via concircular tensors and warped products. We then apply this theory to three-dimensional Minkowski space, obtaining an…
Nearly Euclidean Thurston (NET) maps are described by simple diagrams which admit a natural notion of size. Given a size bound $C$, there are finitely many diagrams of size at most $C$. Given a NET map $F$ presented by a diagram of size at…
A new approach for the classification of the cosmic web is presented. In extension of the previous work of Hahn et al. (2007) and Forero-Romero et al. (2009) the new algorithm is based on the analysis of the velocity shear tensor rather…
We employ the sl(2) foam cohomology to define a cohomology theory for oriented framed tangles whose components are labelled by irreducible representations of U_q(sl(2)). We show that the corresponding colored invariants of tangles can be…
We show, without using the Four Color Theorem, that for each planar triangulation, the number of its proper vertex colorings by 4 colors is a determinant and thus can be calculated in a polynomial time. In particular, we can efficiently…
A "dominating $K_t$-model" in a graph $G$ is a sequence $(T_1,\dots,T_t)$ of pairwise vertex-disjoint connected subgraphs of $G$, such that whenever $1\leq i<j\leq t$ every vertex in $T_j$ has a neighbour in $T_i$. Replacing "every vertex…
A facial-parity edge-coloring of a $2$-edge-connected plane graph is a facially-proper edge-coloring in which every face is incident with zero or an odd number of edges of each color. A facial-parity vertex-coloring of a $2$-connected plane…
Many conforming finite elements on squares and cubes are elegantly classified into families by the language of finite element exterior calculus and presented in the Periodic Table of the Finite Elements. Use of these elements varies, based…
The chromaticity diagram associated with the CIE 1931 color matching functions is shown to be slightly non-convex. While having no impact on practical colorimetric computations, the non-convexity does have a significant impact on the shape…
Webs are graphical objects that give a tangible, combinatorial way to compute and classify tensor invariants. Recently, [Gaetz, Pechenik, Pfannerer, Striker, Swanson 2023+] found a rotation-invariant web basis for $\mathrm{SL}_4$, as well…
We prove the following optimal colorful Tverberg-Vrecica type transversal theorem: For prime r and for any k+1 colored collections of points C^l of size |C^l|=(r-1)(d-k+1)+1 in R^d, where each C^l is a union of subsets (color classes) C_i^l…
We prove that proper coloring distinguishes between block-factors and finitely dependent stationary processes. A stochastic process is finitely dependent if variables at sufficiently well-separated locations are independent; it is a…
Colored tensor models (CTM) is a random geometrical approach to quantum gravity. We scrutinize the structure of the connected correlation functions of general CTM-interactions and organize them by boundaries of Feynman graphs. For rank-$D$…
Trivalent plane graphs are used in various areas of mathematics which relate for instance to the colored Jones polynomial, invariants of 3-manifolds and quantum computation. Their evaluation is based on computations in the Temperley-Lieb…
Tverberg's theorem bounds the number of points $\mathbb{R}^d$ needed for the existence of a partition into $r$ parts whose convex hulls intersect. If the points are colored with $N$ colors, we seek partitions where each part has at most one…
Webs and Springer fibers are separately important objects in representation theory: webs give a diagrammatic calculus for tensor invariants of $\mathfrak{sl}_k$, and the cohomology group of Springer fibers can be used to construct the…
A family of invariants of smooth, oriented four-dimensional manifolds is defined via handle decompositions and the Kirby calculus of framed link diagrams. The invariants are parameterised by a pivotal functor from a spherical fusion…
In 1880, P. G. Tait showed that the four colour theorem is equivalent to the assertion that every 3-regular planar graph without cut-edges is 3-edge-colourable, and in 1891, J. Petersen proved that every 3-regular graph with at most two…