Homology and Euler characteristic of generalized anchored configuration spaces of graphs

In this paper we consider the generalized anchored configuration spaces on $n$ labeled points on a~graph. These are the spaces of all configurations of $n$ points on a~fixed graph $G$, subject to the condition that at least $q$ vertices in some pre-determined set $K$ of vertices of $G$ are included in each configuration. We give a non-alternating formula for the Euler characteristic of such spaces for arbitrary connected graphs, which are not trees. Furthermore, we completely determine the homology groups of the generalized anchored configuration spaces of $n$ points on a circle graph.


Introduction
The study of the anchored configuration spaces was initiated in [Ko21] and continued in [HM,Ko22].These spaces are motivated by certain considerations in logistics and differ from classical configuration spaces in a crucial way.The formal definition is as follows.
Definition 1.1.Let X be a non-empty topological space, let K be a set of distinct points in X, and let n be an arbitrary positive integer.An anchored configuration space, denoted Σ(X, K, n), is defined as the subspace of the direct product X n , consisting of all tuples (x 1 , . . ., x n ), such that K ⊆ {x 1 , . . ., x n }.
In this paper we continue with this line of research and generalize Definition 1.1, by relaxing the conditions on the allowed n-tuples (x 1 , . . ., x n ).Definition 1.2.As above, let X be a non-empty topological space, let K be a set of k distinct points in X, k 0, and let n be an arbitrary positive integer.Furthermore, let q be an arbitrary integer, such that k q 0. A generalized anchored configuration space, denoted Σ(X, K, n, q), is defined as the subspace of the direct product X n , consisting of all tuples (x 1 , . . ., x n ), such that |K ∩ {x 1 , . . ., x n }| q.
Clearly, the case k = q in Definition 1.2 corresponds to Definition 1.1.So far, the anchored configuration spaces have been studied in the situation when X is a geometric realization of a graph G, and K is a subset of the set of the vertices of G.These spaces are of particular interest for the logistics, since they formalize networks with moving goods, with the extra condition that at each point in time a certain set of nodes is securely supplied with the goods.Accordingly, the generalized anchored configuration spaces relax this condition and only require that at each point in time at least q nodes out of some previously fixed set K are supplied.
The case of the anchored spaces, where the graph G is a tree has been settled in [Ko21], where the homotopy type of Σ(X, K, n) has been completely determined.Accordingly, in this paper, we consider the case when G is not a tree.
As a first result we provide a non-recursive formula for the Euler characteristic of Σ(G, K, n, q), expressed as a sum of positive terms (rather than a sign-alternating sum).After that we turn to study the topology of these spaces.
We consider the case when G is a circle graph, which appears to be the most natural next step, after the case of G being a tree.This is the same as to consider the case when the topological space X is homeomorphic to a circle, since changing the positions of the points in K will produce homeomorphic anchored configuration spaces.Since all we need to record is the cardinality of K, we let Ω(k, n) denote Σ(G, K, n), where G is a cycle graph with k vertices, and K is the set of vertices of G. Passing on to the generalized anchored configuration spaces, we let Ω(k, n, q) denote Σ(G, K, n, q) in this case.
The spaces Ω(2, n) were the focus of investigations in [Ko22] and [HM].More specifically, the homology of these spaces was calculated in [Ko22] using discrete Morse theory.This work was continued in [HM], where the cup product structure was completely described, and connection to the topological complexity was established.
In this paper we study the spaces Ω(k, n) of an arbitrary k, and more generally Ω(k, n, q), for an arbitrary q k, and calculate their homology groups in all dimensions.Rather than using discrete Morse theory, our method is to consider classical long sequences for the corresponding combinatorially given chain complexes.For the standard concepts of Algebraic Topology we refer to [Fu95,GH81,Hat,Mu84]. Our study lies within the field of Applied Topology, see [Ca09, EH10, Ko08, Ko20] for more information.

The Euler characteristic of the generalized anchored configuration spaces
Let G be a connected graph, which is not a tree, and let V and E denote its sets of vertices and edges, respectively.Let K be an arbitrary subset of V, and let q |K|.In this section we give a theorem which provides a complete non-recursive and nonalternating formula for the Euler characteristic of the spaces Σ(G, K, n, q).Before we proceed with its formulation and its proof, let recall the following concepts.
First, for arbitrary positive integers a b the Stirling numbers of the second kind, denoted a b , count the number of ways to partition a set of a labelled objects into b nonempty unlabelled subsets.Clearly, then b! a b is the number of ways to partition a set of a labelled objects into b nonempty labelled subsets.
Second, if we have a set U, a subset S ⊆ U and an element x ∈ U, we let S XOR x denote the subset of U obtained from S by the exclusive or operation with respect to x. Formally, we set We can now formulate the main result of this section.
Theorem 2.1.Let G be an arbitrary connected graph, whose set of vertices is V, and whose set of edges is E. Let K be an arbitrary non-empty subset of V, and let q be a positive integer, such that q |K|.Finally, let n be a natural number, such that n q.
Assume the graph G is not a tree.Then, the Euler characteristic of the cell complex Σ(G, K, n, q) is given by the formula 1 (2.1) where k := |K| and ε := |E| − |V|.
We can think about the Euler characteristic χ(Σ(G, K, n, q)) as a sum of ±1, more precisely (−1) dim σ , ranging over the set of all cells σ in Σ(G, K, n, q).By definition of Σ(G, K, n, q), each such cell is indexed by a function ϕ : V ∪ E → 2 [n] , which satisfies two conditions: (1) the number of vertices v ∈ K, for which ϕ(v) ∅ is at least q; (2) the set of images {ϕ(x) | x ∈ V ∪E} is a partition of [n] = {1, . . ., n} into disjoint sets.Let us now introduce some further notation.Consider the following collection of sets: Set P σ := (A 1 , . . ., A α , U).Clearly, the tuple P σ is an ordered set partition of [n], in which we allow empty sets.We shall now group all the cells σ ∈ Σ(G, K, n, q) according to their tuple P σ , and calculate the contribution to the Euler characteristic separately in each group.
Consider first an arbitrary tuple P σ , such that ∪ α i=k+1 A i ∅.Let M be the set of all cells with this tuple.Let l be the minimal element of ∪ α i=k+1 A i , and let t denote the index k + 1 t α, for which l ∈ A t = ϕ(v t ) ∪ ϕ(e t ).We can then define an involution µ : M → M, by moving the element l from ϕ(v t ) to ϕ(e t ), and vice versa.Formally, we set Since k + 1 t α, there are no conditions on ϕ(v t ), so the involution µ is welldefined.It produces a perfect matching on the set M. The difference of dimensions of any two matched cells is 1, so their contributions to the Euler characteristic of Σ(G, K, n, q) have opposite signs.It follows that the contribution of each matched pair is 0, and hence also the total contribution of all the cells in M is 0.
This means, that when computing the Euler characteristic of Σ(G, K, n, q) we can limit ourselves to considering the tuples P σ , for which A k+1 = • • • = A α = ∅, which we do for the rest of the argument.
Assume now σ is one of the remaining cells.Set 1 Note, that in the formula (2.1) we use the convention 0 0 = 1, while of course 0 t = 0, for t > 0.
and set r(σ) := i q .This is well-defined since by condition (1) above, we know that m q.
Let us now fix the following data Ω: • the index set {i 1 , . . ., i q }, where • the non-empty sets A i1 , . . ., A iq .Let M denote the set of all cells with this data Ω (and with Note, that for each cell σ ∈ M, we have r(σ) = i q .Let us calculate the total contribution of the cells in M to the Euler characteristic of Σ(G, K, n, q).
Let M denote the subset of M consisting of all cells σ for which the union s j=r(σ)+1 A j is not empty.For σ ∈ M, set ρ(σ) := min s j=r(σ)+1 A j .Let s t > r(σ) be the index, for which ρ(σ) ∈ A t .In a complete analogy to the above, we define a matching µ : M → M by moving the element ρ(σ) from ϕ(v t ) to ϕ(e t ) and vice versa.This is a perfect matching on M, since t i q + 1, so there is no restriction ϕ(v t ) being non-empty.The difference of the dimensions of the matched cells is equal to 1.This implies that the total contribution to the Euler characteristic by the cells from M is 0. We can therefore from now on concentrate on the cells from For 1 j q, we set l j to be the minimum of A ij .Since A ij ∅, the element l j is well-defined.
We now partition the set M \ M into the sets M 1 , M 2 , . . ., M q+1 as follows.For each cell σ ∈ M \ M we define h(σ) to be the index z, uniquely determined by the following condition: ϕ(v iz ) l z , and ϕ(v ij ) = l j , for all j < z.
Here, if ϕ(v ij ) = l j , for all 1 j k, we set h(σ) = q + 1. Clearly 1 h(σ) q + 1, and we define the above partition of M \ M by saying that σ ∈ M i if and only if Next, fix an index 1 d q, and calculate the contribution of the cells in M d .Same way as earlier in the proof, we can define an involution µ : M d → M d .This time it is shifting l d from ϕ(v id ) to ϕ(e id ) and back.Formally, Since ϕ(v id ) l d , the involution µ is well-defined.As before, it matches cells with dimension difference 1, so the contribution of these two cells, and hence also the contribution of the total set M d to the Euler characteristic of Σ(G, K, n, q) is 0.
The only interesting contribution occurs in M q+1 .Note, that all cells in M q+1 have dimension n − q.Indeed, if σ ∈ M q+1 , we have ϕ(v ij ) = l j , for all 1 j q, and ϕ This means that each σ ∈ M q+1 gives the contribution (−1) n−q , and we need to compute the cardinality |M q+1 |.Set W := [n] \ q j=1 A ij .The cells σ ∈ M q+1 are obtained by arbitrarily distributing the elements of W among the sets ϕ(e j ), for • either j ∈ {1, . . ., r(σ)} \ {i 1 , . . ., i q }, • or α + 1 j β.In total, there are β − α + r(σ) − q = ε + r(σ) − q such sets, so we have At this point, let us specifically consider what happens when ε + r(σ) − q = 0, which of course is equivalent to saying that ε = 0 and r(σ) = q.In this case, there are no sets to distribute the elements of W to. Therefore, the number of ways to distribute the elements of W, and hence also the cardinality of M q+1 , is equal to 0, unless, of course, the set W itself is empty, in which case the cardinality of M q+1 is equal to 1. Note, how this is compatible with our convention for 0 t , cf. the footnote on page 3.
Summing over all choices of Ω, we have (2.2) To further evaluate (2.2) we can choose the data Ω in the following order.First, pick r, such that q r k.Set i q := r and choose the remaining elements i 1 , . . . ,i q−1 , such that i 1 < • • • < i q−1 < i q , in r−1 q−1 ways.After that, choose the cardinality t := |W|, we have 0 t n − q.Proceed by choosing W itself, there are n t possibilities.Finally, distribute the elements of [n] \ W into the sets A i1 , . . . ,A iq , so that they are non-empty.The number of ways to do that is q! n−t q .Summarizing, we obtain Now, set λ := ε + r − q.Then r = q, . . ., k translates to λ = ε, . . ., ε + k − q, and r − 1 = λ − ε + q − 1, so we obtain (2.1).
We can now specialize Theorem 2.1 to the case of the regular anchored configuration spaces.

The chain complexes for the generalized anchored configuration spaces on circle graphs
Let us fix positive integers k and n, such that n k 2. Let C k be a cycle graph with k vertices and k edges.Let E denote its set of edges, and let V denote its set of vertices.We can choose the index set to be Z k , and write E = {e 1 , . . ., e k } and V = {v 1 , . . ., v k }, in such a way that the adjacency map ∂ : E → 2 V is given by For a vertex-edge n-tuple σ = (σ 1 , . . ., σ n ) we define two subsets of Z k , which we call vertex and edge support sets, and which we denote supp V (σ) and supp E (σ), as follows: Finally, the dimension of σ is defined to be dim σ := |{i | σ i ∈ E}|.So, in particular, we have 0 dim σ n.
Clearly, for any vertex-set n-tuple σ = (σ 1 , . . ., σ n ), the set {σ 1 , . . ., σ n } is a disjoint union of the sets has a natural structure of the cubical complex, whose geometric realization is an n-torus.Its cells are indexed by the vertexedge whose dimensions, as described in Definition 3.1, coincide with the geometric dimension of the corresponding cells.Therefore, the chain complex whose chain groups are generated by the vertex-edge n-tuples, with appropriately defined boundary operators, will calculate the homology of an n-torus.
We shall now consider the chain complexes whose chain groups are generated by the vertex-edge n-tuples, satisfying additional conditions on the vertex support set supp V (σ).Definition 3.2.Assume we are given an arbitrary subset P ⊆ Z k , and a nonnegative integer q, such that q |P|.We define a chain complex C P,q = (C P,q * , ∂ * ), where C P,q * are free abelian groups, as follows.
(1) For each d, the free abelian group C P,q d is generated by the vertex-edge n-tuples σ = (σ 1 , . . ., σ n ), with dim σ = d, satisfying the following two conditions: • supp V (σ) ⊆ P; (2) The boundary operator takes the vertex-edge n-tuple σ, and replaces, with an appropriate sign, any of the edges σ i ∈ E by any of its boundary vertices, subject to the condition that the index of that vertex lies in P. Formally we have where V P := {v j | j ∈ P}, and ρ(σ, i) Note the special case when |P| = q, when the chain groups C P,q d are generated by all σ, satisfying dim σ = d and supp V (σ) = P.
For convenience, we introduce additional notation for the complement set H := Z k \ P, and h := |H| = n − |P|.
Remark 3.3.Obviously, C P,q i = 0, for i < 0. Furthermore, if a vertex-edge n-tuple σ = (σ 1 , . . ., σ n ) satisfies |supp V (σ)| q, then dim σ n − q, so C P,q i = 0 also for all In what follows, we shall compute the homology groups of the chain complexes C P,q .When P is a proper subset of Z k , the complexes C P,q do not correspond to topological spaces, and play here an auxilliary role.Accordingly, the case which interests us most is when P = Z k , since it gives us the homology of the generalized anchored configuration spaces Ω(k, n, q).We stress this observation for a later reference.
Fact 3.4.The chain complex C Zk,q is isomorphic to the cubical chain complex of the generalized anchored configuration space Ω(k, n, q).In particular, the chain complex C Zk,k is isomorphic to the cubical chain complex of the anchored configuration space Ω(k, n).
Our calculation will proceed by induction, and we shall compute the homology groups for all values of P and q.
4. Calculation of the homology groups of C P,q 4.1.The case q = 0. Let us start with the case q = 0.When q = 0 the condition |supp V (σ)| q is void, which radically simplifies the situation.The homology is then given by the following proposition.(1) The chain complex C Zk,0 calculates the homology of an n-torus.In fact, it is a chain complex of the cubical complex obtained as an n-fold direct product of the k-cycle.
(2) When P is a proper subset of Z k , we have H n (C P,0 ) ≈ Z h n , and all other homology groups are trivial.
Proof.Statement (1) is trivial and simply formalizes our earlier observation, so we proceed to proving the statement (2).Let C k be the graph which is in a sense dual to C k .It is also a cycle graph with k vertices and k edges, but with a different indexing.Let E denote its set of edges, and let V denote its set of vertices.Both again are indexed by Z k , E = {ẽ 1 , . . ., ẽk } and V = {ṽ 1 , . . ., ṽk }, but now in such a way, that the boundary map ∂ : E → 2 V is given by ∂( ẽi ) = {ṽ i−1 , ṽi }.So, compared to C k , the relative indexing is shifted by 1.
Let G denote the subgraph of the cycle graph C k , obtained by deleting all edges indexed by H. Consider the cubical complex , and consider the cochain complex of G n , let us call it C * .It is easy to see that C P,0 is isomorphic to this cochain complex, with the isomorphism ϕ given by ϕ(v i ) := ẽi , and ϕ(e i ) := ṽi , for all i ∈ Z k .In particular, we have H i (C P,0 ) ≈ H n−i ( C * ), for all i.
On the other hand, we assumed that h 1, so topologically, the graph G consists of h disjoint intervals.In particular, the direct product G n is homotopy equivalent to the discrete space with h n points.Therefore, we have otherwise, and it follows that otherwise.

Structure of the relative chain complexes.
Assume now q 1, and consider the chain complex C P,q−1 .The condition as to which vertex-edge n-tuples are allowed to be taken as generators of the chain groups is weaker for C P,q−1 , than it is for C P,q , so the latter is its chain subcomplex.The following lemma states that their quotient can be decomposed as a direct sum of chain complexes of the same type.Lemma 4.2.For any P ⊆ Z k , and any q 1, we have the following chain complex isomorphism: (4.1) where the sum is taken over all subsets of P of cardinality q − 1.
Call such a coset σ.The relative boundary operator in C P,q−1 /C P,q is then given by the following formula, cf.(3.1), (4.2) where V = {v j | j ∈ supp V (σ)}, and ρ(σ, i) is the same as in (3.1).
In other words, when taking the boundary, we are allowed to replace an edge with any of its boundary vertices, subject to the condition, that this does not change the vertex support set.
Since the boundary operator preserves the vertex support set, the chain complex C P,q−1 /C P,q decomposes as a direct sum, with direct summands indexed by all possible choices of supp V (σ), which is the same as to say all possible choices of (q − 1)-subsets of P.This proves (4.1).4.3.The case P Z k .When P is a proper subset of Z k , it turns out that all the homology of the chain complex C P,q is concentrated in its top dimension.Theorem 4.3.Assume P is a proper subset of Z k .Then, the homology of C P,q is concentrated in dimension n − q, in other words, H i (C P,q ) = 0, for i n − q.
Proof.The proof proceeds by induction on q.For the base case q = 0, this has been proved in Proposition 4.1(2).
Assume now q 1.Since the chain complex C P,q is a subcomplex of C P,q−1 , we have the following long exact sequence: (4.3) . . .→ H * (C P,q ) → H * (C P,q−1 ) → H * (C P,q−1 /C P,q ) ∂ → H * −1 (C P,q ) → . . .Note, that by induction assumption, the homology of the complex C P,q−1 is concentrated in dimension n− (q − 1) = n− q + 1.Furthermore, due to dimensional reasons, see Remark 3.3, the homology of C P,q must be 0 in dimension n − q + 1 and above.
By Lemma 4.2 we have C P,q−1 /C P,q ≈ ⊕ S C S,q−1 , where the sum is taken over all subsets of P of cardinality q − 1.Since each S is a proper subset of Z k , by induction assumption, the homology of C S,q−1 is also concentrated in dimension n − q + 1.It follows that the only nontrivial part of the long exact sequence (4.3) is 0 → H n−q+1 (C P,q−1 ) → H n−q+1 (C P,q−1 /C P,q ) → H n−q (C P,q ) → 0, so it follows that H i (C P,q ) = 0, for i n − q.
4.4.The case P = Z k .We are now ready to deal with the main case.
This implies the statement of the theorem.
Note, that for dimensional reasons, see Remark 3.3, the top-dimensional homology group H n−q (C Zk,q ) must be free.The Betti number β n−q (C Zk,q ) can then be computed using the Euler-Poincaré formula.
When G is a cycle, we have |V| = |E|.This means that ε = 0, so in (2.3) all the terms except for the first one vanish, and we have the following formula.For the generalized anchored configuration spaces, we need to substitute ε = 0 in (2.1), and obtain the following corollary.
Again, together with Theorem 4.4 this gives us the Betti numbers of Ω(n, k, q).