Related papers: The Chromatic Splitting Conjecture at n=p=2

We prove that Thompson's group $V$ is acyclic, answering a 1992 question of Brown in the positive. More generally, we identify the homology of the Higman-Thompson groups $V_{n,r}$ with the homology of the zeroth component of the infinite…

The clique chromatic number of a graph is the smallest number of colors in a vertex coloring so that no maximal clique is monochromatic. In this paper, we determine the order of magnitude of the clique chromatic number of the random graph…

In a previous paper we showed that the category of cocommutative color Hopf algebras is semi-abelian in case the group $G$ is abelian and finitely generated and the characteristic of the base field is different from 2 (not needed if $G$ is…

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,…

For a graph G, let h(G) denote the largest k such that G has k pairwise disjoint pairwise adjacent connected nonempty subgraphs, and let s(G) denote the largest k such that G has k pairwise disjoint pairwise adjacent connected subgraphs of…

We investigate the notion of quantum chromatic number of a graph, which is the minimal number of colours necessary in a protocol in which two separated provers can convince an interrogator with certainty that they have a colouring of the…

Let p>3 be a prime, let ku be the connective complex K-theory spectrum, and let K(ku) be the algebraic K-theory spectrum of ku. We study the p-primary homotopy type of the spectrum K(ku) by computing its mod (p,v_1) homotopy groups. We show…

Chromatic symmetric functions are well-studied symmetric functions in algebraic combinatorics that generalize the chromatic polynomial and are related to Hessenberg varieties and diagonal harmonics. Motivated by the Stanley--Stembridge…

For every stable presentably symmetric monoidal $\infty$-category $\mathcal{C}$ we use the Koszul duality between the spectral Lie operad and the cocommutative cooperad to construct an enveloping Hopf algebra functor $\mathcal{U}:…

For a Specht module S^\lambda for the symmetric group \Sigma_d, the cohomology H^i(\Sigma_d, S^\lambda) is known only in degree i=0. We give a combinatorial criterion equivalent to the nonvanishing of the degree i=1 cohomology, valid in odd…

A proper 2-tone $k$-coloring of a graph is a labeling of the vertices with elements from $\binom{[k]}{2}$ such that adjacent vertices receive disjoint labels and vertices distance 2 apart receive distinct labels. The 2-tone chromatic number…

We prove that a graph whose chromatic number is 2 is a homotopy test graph. We also prove that there is a graph $K$ with two involutions $\gamma_1$ and $\gamma_2$ such that $(K,\gamma_1)$ is a Stiefel-Whitney test graph, but $(K,\gamma_2)$…

Let $F/F^+$ be a CM extension and $H_{/F^+}$ a definite unitary group in three variables that splits over $F$. We describe Hecke isotypic components of mod $p$ algebraic modular forms on $H$ at first principal congruence level at $p$ and…

Kummer's conjecture states that the relative class number of the $p$-th cyclotomic field follows a strict asymptotic law. Granville has shown it unlikely to be true -- it cannot be true if we assume the truth of two other widely believed…

For a graph $G$, let $\chi(G)$ denote its chromatic number and $\sigma(G)$ denote the order of the largest clique subdivision in $G$. Let H(n) be the maximum of $\chi(G)/\sigma(G)$ over all $n$-vertex graphs $G$. A famous conjecture of…

We show that the problem of deciding positivity of Kronecker coefficients is NP-hard. Previously, this problem was conjectured to be in P, just as for the Littlewood-Richardson coefficients. Our result establishes in a formal way that…

Given a graph $G$, let $\Delta_2(G)$ denote the maximum number of neighbors any two distinct vertices of $G$ have in common. Vu (2002) proposed that, provided $\Delta_2(G)$ is not too small as a proportion of the maximum degree $\Delta(G)$…

Reed conjectured that the chromatic number of any graph is closer to its clique number than to its maximum degree plus one. We consider a recolouring version of this conjecture, with respect to Kempe changes. Namely, we investigate the…

We extend the theory of ambidexterity developed by M. J. Hopkins and J. Lurie and show that the $\infty$-categories of $T(n)$-local spectra are $\infty$-semiadditive for all $n$, where $T(n)$ is the telescope on a $v_{n}$-self map of a type…

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…