Search for: All records

Abstract We present a combinatorial analysis of fiber bundles of generalized configuration spaces on connected abelian Lie groups. These bundles are akin to those of Fadell–Neuwirth for configuration spaces, and their existence is detected by a combinatorial property of an associated finite partially ordered set. This is consistent with Terao’s fibration theorem connecting bundles of hyperplane arrangements to Stanley’s lattice supersolvability. We obtain a combinatorially determined class of $K(\pi ,1)$toric and elliptic arrangements. Under a stronger combinatorial condition, we prove a factorization of the Poincaré polynomial when the Lie group is noncompact. In the case of toric arrangements, this provides an analogue of Falk–Randell’s formula relating the Poincaré polynomial to the lower central series of the fundamental group. 

As countless examples show, it can be fruitful to study a sequence of complicated objects all at once via the formalism of generating functions. We apply this point of view to the homology and combinatorics of orbit configuration spaces: using the notion of twisted commutative algebras, which essentially categorify algebras in exponential generating functions. This idea allows for a factorization of the orbit configuration space “generating function” into an infinite product, whose terms are surprisingly easy to understand. Beyond the intrinsic aesthetic of this decomposition and its quantitative consequences, it suggests a sequence of primary, secondary, and higher representation stability phenomena. Based on this, we give a simple geometric recipe for identifying new stabilization actions with finiteness properties in some cases, which we use to unify and generalize known stability results. We demonstrate our method by characterizing secondary and higher stability for configuration spaces on i i -acyclic spaces. For another application, we describe a natural filtration by which one observes a filtered representation stability phenomenon in configuration spaces on graphs.