Related papers: Combinatorics of orbit configuration spaces
We consider colored compositions where only some parts are allowed different colors, depending on their locations in the composition. The counting sequences are obtained through generating functions. Connections to many other combinatorial…
The complement of an arrangement A of a finite number of affine hyperplanes in complex n-space has the structure of a poset of spaces indexed by the intersection poset, L(A). The space corresponding to G in L(A) is homotopy equivalent to…
We show that the homology over a field of the space of free maps from the n-sphere to the n-fold suspension of X depends only on the cohomology algebra of X and compute it explicitly. We compute also the homology of the closely related…
The motivation of this work is to define cohomology classes in the space of knots that are both easy to find and to evaluate, by reducing the problem to simple linear algebra. We achieve this goal by defining a combinatorial graded cochain…
We survey results on the topological complexity of classical configuration spaces of distinct ordered points in orientable surfaces and related spaces, including certain orbit configuration spaces and Eilenberg-Mac Lane spaces associated to…
In this article we introduce the space of configurations of commuting elements in a topological group and show that it satisfies rational homological stability for the sequences of unitary, special unitary and symplectic groups. We also…
We introduce ordered and unordered configuration spaces of 'clusters' of points in an Euclidean space $\mathbb{R}^d$, where points in each cluster satisfy a 'verticality' condition, depending on a decomposition $d=p+q$. We compute the…
We prove that the cohomology algebra of elliptic arrangements depends only on the poset of layers. In the particular case of braid elliptic arrangements, we study the cohomology as representation and we compute some Hodge numbers. Finally,…
We show that the well known {\em homotopy complementation formula} of Bj\"orner and Walker admits several closely related generalizations on different classes of topological posets (lattices). The utility of this technique is demonstrated…
We explain how to see finite combinatorics of preorders implicit in the {text} of basic topological definitions or arguments in (Bourbaki, General topology, Ch.I), and define a concise combinatorial notation such that complete definitions…
In this paper we study the homology and cohomology of confguration spaces of two distinct particles on a graph. Our main tool is intersection theory for cycles in graphs. We obtain an explicit description of the cohomology algebra of the…
The lattice of partitions of a set and its d-divisible generalization have been much studied for their combinatorial, topological, and representation-theoretic properties. An ordered set partition is a set partition where the subsets are…
Coordination geometries describe how the neighbours of a central particle are arranged around it. Such geometries can be thought to lie in an abstract topological space; a model of this space could provide a mathematical basis for…
The intersection data of a hyperplane arrangement is described by a geometric lattice, or equivalently a simple matroid. There is a rich interplay between this combinatorial structure and the topology of the arrangement complement. In this…
The homotopy type of the complement of a complex coordinate subspace arrangement is studied by fathoming out the connection between its topological and combinatorial structures. A family of arrangements for which the complement is homotopy…
Configuration spaces form a rich class of topological objects which are not usually presented to an undergraduate audience. Our aim is to present configuration spaces in a manner accessible to the advanced undergraduate. We begin with a…
Each finite configuration of points in the plane determines a corresponding lattice of noncrossing partitions. When these points form the vertex set of a convex polygon, the associated lattice is the classical noncrossing partition lattice…
We develop a tighter implementation of basic PL topology, which keeps track of some combinatorial structure beyond PL homeomorphism type. With this technique we clarify some aspects of PL transversality and give combinatorial proofs of a…
We examine properties of generic automorphisms of the random poset, with the goal of explicitly characterizing them. We associate to each automorphism an auxiliary first-order structure, consisting of the random poset equipped with an…
We survey interactions between the topology and the combinatorics of complex hyperplane arrangements. Without claiming to be exhaustive, we examine in this setting combinatorial aspects of fundamental groups, associated graded Lie algebras,…