Certain homology cycles of the independence complex of grids

26Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Let G be an infinite graph such that the automorphism group of G contains a subgroup K≅ℤd with the property that G/K is finite. We examine the homology of the independence complex Σ(G/I) of G/I for subgroups I of K of full rank, focusing on the case that G is the square, triangular, or hexagonal grid. Specifically, we look for a certain kind of homology cycles that we refer to as "cross-cycles," the rationale for the terminology being that they are fundamental cycles of the boundary complex of some cross-polytope. For the special cases just mentioned, we determine the set Q(G,K) of rational numbers r such that there is a group I with the property that Σ(G/I) contains cross-cycles of degree exactly r·{pipe}G/I{pipe}-1; {pipe}G/I{pipe} denotes the size of the vertex set of G/I. In each of the three cases, Q(G,K) turns out to be an interval of the form [a,b]∩ℚ={r∈ℚ:a≤r≤b}. For example, for the square grid, we obtain the interval [1/5,1/4]∩ℚ. © 2009 Springer Science+Business Media, LLC.

Cite

CITATION STYLE

APA

Jonsson, J. (2010). Certain homology cycles of the independence complex of grids. Discrete and Computational Geometry, 43(4), 927–950. https://doi.org/10.1007/s00454-009-9224-9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free