Related papers: Chromatic Alpha Complexes
Our purpose is to show that complements of line graphs enjoy nice coloring properties. We show that for all graphs in this class the local and usual chromatic numbers are equal. We also prove a sufficient condition for the chromatic number…
In Euclidean Ramsey Theory usually we are looking for monochromatic configurations in the Euclidean space, whose points are colored with a fixed number of colors. In the canonical version, the number of colors is arbitrary, and we are…
We consider the maximum chromatic number of hypergraphs consisting of cliques that have pairwise small intersections. Designs of the appropriate parameters produce optimal constructions, but these are known to exist only when the number of…
In the paper we prove, in particular, that for any measurable coloring of the euclidian plane into two colours there is a monochromatic triangle with some restrictions on the sides. Also we consider similar problems in finite fields…
Recent results show that several important graph classes can be embedded as subgraphs of strong products of simpler graphs classes (paths, small cliques, or graphs of bounded treewidth). This paper develops general techniques to bound the…
In this paper, we apply persistent entropy, a novel topological statistic, for characterization of images of epithelial tissues. We have found out that persistent entropy is able to summarize topological and geometric information encoded by…
We consider quotients of complete flag manifolds in Cn and Rn by an action of the symmetric group on n objects. We compute their cohomology with field coefficients of any characteristic. Specifically, we show that these topological spaces…
This paper describes several new problems and ideas concerning algebraic geometry and complexity theory. It first uses the idea of coloring graphs with elements of finite fields. This procedure then shows that graph coloring problems can be…
In this work the topological order at finite temperature in two-dimensional color code is studied. The topological entropy is used to measure the behavior of the topological order. Topological order in color code arises from the colored…
The following article is an application of commutative algebra to the study of multiparameter persistent homology in topological data analysis. In particular, the theory of finite free resolutions of modules over polynomial rings is applied…
Chromatic maps for spherical tensor categories are instrumental tools to construct (non semisimple) invariants of 3-manifolds and their extension to (non compact) (2+1)-TQFTs. In this paper, we introduce left and right chromatic maps for…
This article shows several new methods for proofs on Kan complexes while using them to give a compact introduction to the homotopy groups of these complexes. Then more advanced objects are studied starting with homology and the Hurewicz…
This paper presents the basic properties of chromatic derivatives and chromatic expansions and provides an appropriate motivation for introducing these notions. Chromatic derivatives are special, numerically robust linear differential…
The coming quantum computation is forcing us to reexamine the cryptosystems people use. We are applying graph colorings of topological coding to modern information security and future cryptography against supercomputer and quantum computer…
The aim of this paper is to present a method for computation of persistent homology that performs well at large filtration values. To this end we introduce the concept of filtered covers. We show that the persistent homology of a bounded…
To compute the persistent homology of a grayscale digital image one needs to build a simplicial or cubical complex from it. For cubical complexes, the two commonly used constructions (corresponding to direct and indirect digital…
The topology of spaces of Hermitian operators in $C^n$ with non-simple spectra was studied by V.Arnold in a relation with the theory of adiabatic connections and the quantum Hall effect. The natural filtration of these spaces by the sets of…
We present mathematical models based on persistent homology for analyzing force distributions in particulate systems. We define three distinct chain complexes: digital, position, and interaction, motivated by different capabilities of…
We introduce a new algorithm to parallelise the computation of persistent homology of 2D alpha complexes. Our algorithm distributes the input point cloud among the cores which then compute a cover based on a rectilinear grid. We show how to…
We propose a new approach for defining and searching clusters in graphs that represent real technological or transaction networks. In contrast to the standard way of finding dense parts of a graph, we concentrate on the structure of edges…