Related papers: Chromatic Alpha Complexes
Various results ensure the existence of large complete bipartite graphs in properly colored graphs when some condition related to a topological lower bound on the chromatic number is satisfied. We generalize three theorems of this kind,…
We investigate the existence of perfect homogeneous sets for analytic colorings. An analytic coloring of X is an analytic subset of [X]^N, where N>1 is a natural number. We define an absolute rank function on trees representing analytic…
We generalize the notion of a coloring complex of a graph to linearized combinatorial Hopf monoids. We determine when a linearized combinatorial Hopf monoid has such a construction, and discover some inequalities that are satisfied by the…
We describe the second homotopy group of any CW-complex $K$ by analyzing the universal cover of a locally finite model of $K$ using the notion of $G$-coloring of a partially ordered set. As applications we prove a generalization of the…
An assignment of colours to the vertices of a graph is stable if any two vertices of the same colour have identically coloured neighbourhoods. The goal of colour refinement is to find a stable colouring that uses a minimum number of…
We study a certain monoid of endofunctors of the stable homotopy category that includes localizations with respect to finite unions of Morava $K$-theories. We work in an axiomatic framework that can also be applied to analogous questions in…
A brief summary of the application of coherent states in the examination of quantum dynamics of cosmological models is given. We discuss quantization maps, phase space probability distributions and semiclassical phase spaces. The…
The universality properties of kernels characterize the class of functions that can be approximated in the associated reproducing kernel Hilbert space and are of fundamental importance in the theoretical underpinning of kernel methods in…
We study the approximability of an existing framework for clustering edge-colored hypergraphs, which is closely related to chromatic correlation clustering and is motivated by machine learning and data mining applications where the goal is…
We show that the existence of a universal countably chromatic graph of size $\aleph_1$ together with the failure of continuum hypothesis is consistent. The proof is a forcing iteration of strongly proper ccc posets. The construction works…
This is a survey of some recent developments in the study of complements of line arrangements in the complex plane. We investigate the fundamental groups and finite covers of those complements, focusing on homological and enumerative…
We study graphon counterparts of the chromatic and the clique number, the fractional chromatic number, the b-chromatic number, and the fractional clique number. We establish some basic properties of the independence set polytope in the…
We discuss representations and colorings of orthogonality hypergraphs in terms of their two-valued states interpretable as classical truth assignments. Such hypergraphs, if they allow for a faithful orthogonal representation, have quantum…
We prove that the space of complex irreducible polynomials of degree $d$ in $n$ variables satisfies two forms of homological stability: first, its cohomology stabilizes as $d$ increases, and second, its compactly supported cohomology…
We develop a new method to compute the homology groups of finite topological spaces (or equivalently of finite partially ordered sets) by means of spectral sequences giving a complete and simple description of the corresponding…
The algebraic cluster model is is applied to study cluster states in the nuclei 12C and 16O. The observed level sequences can be understood in terms of the underlying discrete symmetry that characterizes the geometrical configuration of the…
The symmetric homology of a unital algebra $A$ over a commutative ground ring $k$ is defined using derived functors and the symmetric bar construction of Fiedorowicz. For a group ring $A = k[\Gamma]$, the symmetric homology is related to…
We discuss and review recent developments in the area of applied algebraic topology, such as persistent homology and barcodes. In particular, we discuss how these are related to understanding more about manifold learning from random point…
A proper vertex colouring of a graph is \emph{nested} if the vertices of each of its colour classes can be ordered by inclusion of their open neighbourhoods. Through a relation to partially ordered sets, we show that the nested chromatic…
Counting problems, determining the number of possible states of a large system under certain constraints, play an important role in many areas of science. They naturally arise for complex disordered systems in physics and chemistry, in…