Related papers: Scarf's theorems, simplices, and oriented matroids
We prove that with high probability over the choice of a random graph $G$ from the Erd\H{o}s-R\'enyi distribution $G(n,1/2)$, a natural $n^{O(\varepsilon^2 \log n)}$-time, degree $O(\varepsilon^2 \log n)$ sum-of-squares semidefinite program…
The chromatic symmetric function of a graph is a generalization of the chromatic polynomial. The key motivation for studying the structure of a chromatic symmetric function is to answer positivity conjectures by Stanley in 1995 and Gasharov…
We review and extend recent findings of Godsil and Zaks, who published a constructive coloring of the rational unit sphere with the property that for any orthogonal tripod formed by rays extending from the origin of the points of the…
We compute the cohomology ring of a generalised type of configuration space of points in $\mathbb{R}^r$. This configuration space is indexed by a graph. In the case the graph is complete the result is known and it is due to Arnold and…
By proving graph theoretical versions of Green-Stokes, Gauss-Bonnet and Poincare-Hopf, core ideas of undergraduate mathematics can be illustrated in a simple graph theoretical setting. In this pedagogical exposition we present the main…
A generalized transport theorem for convecting irregular domains is presented in the setting of Federer's geometric measure theory. A prototypical $r$-dimensional domain is viewed as a flat $r$-chain of finite mass in an open set of an…
We prove the following generalisation of Schauder's fixed point conjecture: Let $C_1,...,C_n$ be convex subsets of a Hausdorff topological vector space. Suppose that the $C_i$ are closed in $C=C_1\cup...\cup C_n$. If $f:C\to C$ is a…
We study a problem proposed by Hurtado et al. (2016) motivated by sparse set visualization. Given $n$ points in the plane, each labeled with one or more primary colors, a \emph{colored spanning graph} (CSG) is a graph such that for each…
We give a short and much simplified proof of the main theorem of the recent study, by T. Barthel, M. Hausmann, N. Naumann, T. Nikolaus, J. Noel, and N. Stapleton, of the Balmer spectrum for A-equivariant stable homotopy when A is a finite…
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…
In this paper we define the triangulated category of motives over a simplicial scheme. The morphisms between the Tate objects in this category compute the motivic cohomology of the underlying scheme. In the last section we consider the…
Four-Color Theorem has secret in its logical proof and actual operating. In this paper we will give a proof of Four-Color Theorem based on Kuratowski's Theorem using some induction argument and give a description of the most complicated…
Hoffman's bound is a well-known spectral bound on the chromatic number of a graph, known to be tight for instance for bipartite graphs. While Hoffman colorings (colorings attaining the bound) were studied before for regular graphs, for…
The description of light diffraction using catastrophe optics is one of the most intriguing theoretical invention in the field of classical optics of the last four decades. Its practical implementation has faced some resistance over the…
We study whether symplectic quandle colorings can reveal causal structure encoded by "sky links" - i.e. links consisting of spheres of all light rays through two points in the space of all light rays of a spacetime. Building on the known…
The proof uses the property that the vertices of a triangulated planar graph can be four coloured if the triangles can have a +1 or -1 orientation so that the sum of the triangle orientations around each vertex is a multiple of 3. Such…
The objective of this manuscript is to introduce and develop the concept of a generalized $\theta$-parametric metric space-a novel extension that enriches the modern metric fixed point theory. We study of its fundamental properties,…
We start with a bijective proof of Schur's theorem due to Alladi and Gordon and describe how a particular iteration of it leads to some very general theorems on colored partitions. These theorems imply a number of important results,…
Given $d+1$ sets, or colours, $S_1, S_2,...,S_{d+1}$ of points in $\mathbb{R}^d$, a {\em colourful} set is a set $S\subseteq\bigcup_i S_i$ such that $|S\cap S_i|\leq 1$ for $i=1,...,d+1$. The convex hull of a colourful set $S$ is called a…
We establish a connection between root multiplicities for Borcherds-Kac-Moody algebras and graph coloring. We show that the generalized chromatic polynomial of the graph associated to a given Borcherds algebra can be used to give a closed…