Forbidden partition configuration spaces of graphs (Q6894840)

The paper introduces a broad generalisation of classical configuration spaces by \textit{forbidding specific combinations} of simultaneous collisions via an upper set of partitions. When the underlying space is a finite graph, the author constructs a finite cubical complex that is homotopy equivalent to the new configuration space, using open covers, Mayer-Vietoris spectral sequences, and discrete Morse theory.\N\NKey Definitions\N\NThe classical \textit{ordered configuration space} \(\operatorname{Conf}_n(X)\) consists of all \(n\)-tuples \((x_1,\dots,x_n)\in X^n\) with \(x_i\neq x_j\) for all \(i\neq j\). Many generalisations exist (no-\(k\)-equal spaces, coloured configuration spaces, etc. See Example 1.1~ 1.6), but they all forbid collisions based on \textit{single} coincidence sets.\N\NThe author's key innovation is to control \textit{simultaneous} collisions through \textit{forbidden partitions}:\N\NLet \(\mathcal{P}\) be an \textit{upper set} of partitions of \(\{1,\dots,n\}\) (not containing the discrete partition \(\{\{1\},\dots,\{n\}\}\)). For a point \(x=(x_1,\dots,x_n)\in X^n\), let \(\pi(x)\) be the partition of \(\{1,\dots,n\}\) induced by coincidences: \(i\sim_{\pi(x)} j\) if and only if \(x_i=x_j\).\N\NThe \textbf{forbidden-partition configuration space} is defined as\N\[\N\operatorname{Conf}_n(X,\mathcal{P}) = \{x\in X^n \mid \pi(x)\notin\mathcal{P}\}.\N\]\NIn other words, any configuration whose coincidence pattern lies in the forbidden set \(\mathcal{P}\) is excluded. \N\NKey Theorems\N\NThe central contribution of the paper is to construct a finite cubical complex \(D_n(\Gamma,\mathcal{P})\) that computes the homology of the newly defined forbidden-partition configuration space \(\operatorname{Conf}_n(\Gamma,\mathcal{P})\). The main theorem is\N\N\textbf{Theorem 4.3 }\N\[\NH_*(\operatorname{Conf}_n(\Gamma,\mathcal{P})) \cong H_*(D_n(\Gamma,\mathcal{P})).\N\]\NThis isomorphism is obtained by showing that \(\operatorname{Conf}_n(\Gamma,\mathcal{P})\) and \(D_n(\Gamma,\mathcal{P})\) admit identical finite open covers \(\{U_\lambda\}\) and \(\{D_\lambda\}\) (indexed by the same set of conditions \(\lambda\)), such that for every finite collection \(\Lambda\) the inclusion \(D_\Lambda \hookrightarrow U_\Lambda\) is a homotopy equivalence (Theorems 4.2 and 4.3). Consequently, the two spaces have isomorphic Mayer-Vietoris spectral sequences with respect to these covers, yielding the desired homology isomorphism.\N\NThe discrete model is constructed as follows. First, subdivide the edges of the finite connected graph \(\Gamma\) (no loops, at least one vertex of degree \(\ge 2\)) to obtain a subdivided graph \(\Gamma'\):\N\NEdges between two vertices of degree \(\ge 2\) are subdivided into \(n+1\) segments of length \(1/(n+1)\). Edges incident to a degree-\(1\) vertex are subdivided into \(n\) segments of length \(1/n\).\N\NThe product \(\Gamma^n\) then inherits the structure of a cubical complex whose cells are \(n\)-tuples \(\tau = (\tau_1,\dots,\tau_n)\) with each \(\tau_i\) a node (0-cell) or segment (1-cell) of \(\Gamma'\).\N\NThe subcomplex \(D_n(\Gamma,\mathcal{P})\) is defined by keeping only those cells that do not force any forbidden partition:\N\N[Definition of \(D_n(\Gamma,\mathcal{P})\)]\N\[\ND_n(\Gamma,\mathcal{P}) = \Bigl\{ \tau = (\tau_1,\dots,\tau_n) \ \Big|\ \forall\, P \in \mathcal{P},\ \exists\, j \in N \text{ such that } \bigcap_{i \in [j]_P} \tau_i = \emptyset \Bigr\}.\N\]\NIn other words, a cell \(\tau\) belongs to \(D_n(\Gamma,\mathcal{P})\) if and only if, for every forbidden partition \(P \in \mathcal{P}\), there is no block \([j]_P\) such that all particles in that block are forced to occupy the exact same point in \(\tau\) (i.e., their corresponding cells \(\tau_i\) have nonempty common intersection).\N\NThis combinatorial condition directly excludes precisely those cubical cells in which a configuration would necessarily realize a forbidden simultaneous-collision pattern. The resulting complex is finite and provides a purely combinatorial model whose homology agrees with that of the continuous space \(\operatorname{Conf}_n(\Gamma,\mathcal{P})\).