Related papers: Colourful Carath\'eodory's Theorem plus a constrai…

Motivated by applications in the medical sciences, we study finite chromatic sets in Euclidean space from a topological perspective. Based on the persistent homology for images, kernels and cokernels, we design provably stable homological…

We introduce a general method for showing under weak forcing axioms that reduced products of countable models of a theory $T$ have as few automorphisms as possible. We show that such forcing axioms imply that reduced products of countably…

For a smooth finite cyclic covering over a projective space of dimension greater than one, we show that the group of automorphisms acts faithfully on the cohomology except for a few cases. In characteristic zero, we study the equivariant…

Let $X$ be a (repetitive) infinite connected simple graph with a finite upper bound $\Delta$ on the vertex degrees. The main theorem states that $X$ admits a (repetitive) limit aperiodic vertex coloring by $\Delta$ colors. This refines a…

The long-standing Erd\H{o}s-Faber-Lov\'asz conjecture states that every $n$-uniform linear hypergaph with $n$ edges has a proper vertex-coloring using $n$ colors. In this paper we propose an algebraic framework to the problem and formulate…

Colour algebras over fields of odd characteristic are well-known noncommutative Jordan algebras. We define colour algebras more generally over a unital commutative associative ring with $\frac{1}{2}\in R$, and show that colour algebras can…

We isolate a new preservation class of Suslin forcings and prove several associated consistency results in the choiceless theory ZF+DC regarding countable chromatic numbers of various Borel hypergraphs.

An abstract linking result for Cerami sequences is proved without the Cerami condition. It is applied directly in order to prove the existence of critical points for a class of indefinite problems in infinite dimensional Hilbert Spaces. The…

This paper discusses Tverberg-type theorems with coordinate constraints (i.e., versions of these theorems where all points lie within a subset $S \subset \mathbb{R}^d$ and the intersection of convex hulls is required to have a non-empty…

We give several new characterizations of Caratheodory convergence of simply connected domains. We then investigate how different definitions of convergence generalize to the multiply-connected case.

The physics of complex systems stands to greatly benefit from the qualitative changes in data availability and advances in data-driven computational methods. Many of these systems can be represented by interacting degrees of freedom on…

We give a pictorial proof that transparently illustrates why four colours suffce to chromatically differentiate any set of contiguous, simply connected and bounded, planar spaces; by showing that there is no minimal planar map. We show,…

The colourful simplicial depth conjecture states that any point in the convex hull of each of d+1 sets, or colours, of d+1 points in general position in R^d is contained in at least d^2+1 simplices with one vertex from each set. We verify…

We study a chromatic theory of asymptotic approximate groups for tuples of subsets of abelian groups, combining Nathanson's chromatic sumset formalism with asymptotic covering ideas from approximate group theory. This framework encodes…

We introduce the "sharp" (universal) extension of a 1-motive (with additive factors and torsion) over a field of characteristic zero. We define the "sharp de Rham realization" by passing to the Lie-algebra. Over the complex numbers we then…

Given an edge colouring of a graph with a set of $m$ colours, we say that the graph is (exactly) $m$-coloured if each of the colours is used. We consider edge colourings of the complete graph on $\mathbb{N}$ with infinitely many colours and…

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…

We classify the twisted tensor products of a finite set algebra with a two elements set algebra using colored quivers obtained through considerations analogous to Ore extensions. This provides also a classification of entwining structures…

We study the well-known variational and large deviation principle for graph homomorphisms from $\mathbb{Z}^m$ to $\mathbb{Z}$. We provide a robust method to deduce those principles under minimal a priori assumptions. The only ingredient…

The colorful simplicial depth of a collection of d+1 finite sets of points in Euclidean d-space is the number of choices of a point from each set such that the origin is contained in their convex hull. We use methods from combinatorial…