相关论文: Chromatic completion

Using Ravenel's Thom spectrum $X(n)$, we introduce the concept of chromatic defect, which measures how far a spectrum is from being complex-orientable. We compute the chromatic defect of various examples of interest, such as finite spectra,…

In this note, we give a brief overview of the telescope conjecture and the chromatic splitting conjecture in stable homotopy theory. In particular, we provide a proof of the folklore result that Ravenel's telescope conjecture for all…

Chromatic quantum contextuality is a criterion of quantum nonclassicality based on (hyper)graph coloring constraints. If a quantum hypergraph requires more colors than the number of outcomes per maximal observable (context), it lacks a…

Proper vertex colorings of a graph are related to its boundary map, also called its signed vertex-edge incidence matrix. The vertex Laplacian of a graph, a natural extension of the boundary map, leads us to introduce nowhere-harmonic…

The completion tower of a nonunital commutative ring is a classical construction in commutative algebra. In the setting of structured ring spectra as modeled by algebras over a spectral operad, the analogous construction is the homotopy…

We use a well known concept of proper vertex colouring of a graph to introduce the construction of a chromatic completion graph and its related parameter, the chromatic completion number of a graph. We then give the chromatic completion…

We initiate a systematic study of spectral theory for bounded-degree Borel pmp graphs. Specifically, we study spectral properties of the associated adjacency and Laplacian operators. We start with proving a spectral characterization of…

We develop a general theory of higher semiadditive Fourier transforms that includes both the classical discrete Fourier transform for finite abelian groups at height $n=0$, as well as a certain duality for the $E_n$-(co)homology of…

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…

We construct Borel graphs which settle several questions in descriptive graph combinatorics. These include "Can the Baire measurable chromatic number of a locally finite Borel graph exceed the usual chromatic number by more than one?" and…

Hoffman's bound is a well-known eigenvalue bound on the chromatic number of a graph. By interpreting this bound as a parameter, we show multiple applications of colorings attaining the bound (Hoffman colorings) for several notions of graph…

In the past, analogues to Brooks' theorem have been found for various parameters of graph coloring for infinite locally finite connected graphs in ZFC. We prove these theorems are not provable in ZF (i.e. the Zermelo-Fraenkel set theory…

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…

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 prove multiple generalizations of Fan's combinatorial labeling result for sphere triangulations. This can be seen as a comprehensive extension of the Borsuk--Ulam theorem. In typical applications, the Borsuk--Ulam theorem gives…

We formulate a version of Hopkins' chromatic splitting conjecture for an arbitrary structured ring spectrum $R$, and prove it whenever $\pi_*R$ is Noetherian. As an application, these results provide a new local-to-global principle in the…

We prove lower and upper bounds for the chromatic number of certain hypergraphs defined by geometric regions. This problem has close relations to conflict-free colorings. One of the most interesting type of regions to consider for this…

At each prime $p$ and height $n+1 \ge 2$, we prove that the telescopic and chromatic localizations of spectra differ. Specifically, for $\mathbb{Z}$ acting by Adams operations on $\mathrm{BP}\langle n \rangle$, we prove that the…

The topological Tverberg theorem has been generalized in several directions by setting extra restrictions on the Tverberg partitions. Restricted Tverberg partitions, defined by the idea that certain points cannot be in the same part, are…

Polarization of light is one of the fundamental concepts in optics. There are many ways to measure and characterise this feature of light but at the fundamental level it is quantum mechanics that imposes ultimate limits to such…