To any two graphs G and H one can associate a cell complex Hom (G, H) by taking all graph multihomomorphisms from G to H as cells.In this paper we prove the Lovász conjecture which states thatwhere r, k ∈ Z, r ≥ 1, k ≥ −1, and C 2r+1 denotes the cycle with 2r +1 vertices.The proof requires analysis of the complexes Hom (C 2r+1 , K n ). For even n, the obstructions to graph colorings are provided by the presence of torsion in H * (Hom (C 2r+1 , K n ); Z). For odd n, the obstructions are expressed as vanishing of certain powers of Stiefel-Whitney characteristic classes of Hom (C 2r+1 , K n ), where the latter are viewed as Z 2 -spaces with the involution induced by the reflection of C 2r+1 .
Abstract. In this paper we study the topology of moduli spaces of tropical curves of genus g with n marked points. We view the moduli spaces as being embedded in a larger space, which we call the moduli space of metric graphs with n marked points. We describe the shrinking bridges strong deformation retraction, which leads to a substantial simplification of all these moduli spaces.In the rest of the paper, this reduction is used to analyze the case of genus 1. The corresponding moduli space is presented as a quotient space of a torus with respect to the conjugation Z 2 -action; and furthermore, as a homotopy colimit over a simple diagram. The latter allows us to compute all Betti numbers of this moduli space with coefficients in Z 2 .
Abstract. In this paper we study a family of discrete configuration spaces, the so-called protocol complexes, which are of utmost importance in theoretical distributed computing. Specifically, we consider questions of the existance of compliant binary labelings on the vertices of iterated standard chromatic subdivisions of an n-simplex. The existance of such labelings is equivalent to the existance of distributed protocols solving Weak Symmetry Breaking task in the standard computational model.As a part of our formal model, we introduce function sb(n), defined for natural numbers n, called the symmetry breaking function. From the geometric point of view sb(n) denotes the minimal number of iterations of the standard chromatic subdivision of an (n − 1)-simplex, which is needed for the compliant binary labeling to exist. From the point of view of distributed computing, the function sb(n) measures the minimal number of rounds in a protocol solving the Weak Symmetry Breaking task.In addition to the development of combinatorial topology, which is applicable in a broader context, our main contribution is the proof of new bounds for the function sb(n). Accordingly, the bulk of the paper is taken up by in-depth analysis of the structure of adjacency graph on the set of n-simplices in iterated standard chromatic subdivision of an n-simplex. On the algorithmic side, we provide the first distributed protocol solving Weak Symmetry Breaking task in the layered immediate snapshot computational model for some number of processes.It is well known, that the smallest number of processes for which Weak Symmetry Breaking task is solvable is 6. Based on our analysis, we are able to find a very fast explicit protocol, solving the Weak Symmetry Breaking for 6 processes using only 3 rounds. Furthermore, we show that no protocol can solve Weak Symmetry Breaking in fewer than 2 rounds.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.