Related papers: Configuration Spaces of Colored Graphs

We describe a construction (the `warped cone construction') which produces examples of coarse spaces with large groups of translations. We show that by this construction we can obtain many examples of coarse spaces which do not have…

The aim of this paper is to generalize the notion of the coloring complex of a graph to hypergraphs. We present three different interpretations of those complexes -- a purely combinatorial one and two geometric ones. It is shown, that most…

In this paper we determine the topological complexity of configuration spaces of graphs which are not necessarily trees, which is a crucial assumption in previous results. We do this for two very different classes of graphs: fully…

Following our previous works on $C^*$-graph algebras and the associated Cuntz-Krieger graph families, in this paper we will try to have a look at the colored version of these structures and to see what a $C^*$-colored graph algebra might…

In this paper we study the spaces of $q$-tuples of points in a Euclidean space, without $k$-wise coincidences (configuration-like spaces). A transitive group action by permuting these points is considered, and some new upper bounds on the…

The purpose of this paper is to continue studying the properties of $\gamma$-regular open sets introduced and explored in [6]. The concept of $\gamma$-closed spaces have also been defined and discussed.

We introduce a class of non-commutative geometries, loosely referred to as para-spaces, which are manifolds equipped with sheaves of non-commutative algebras called para-algebras. A differential analysis on para-spaces is investigated,…

Finitely many hypersurfaces are removed from unordered configuration spaces of $n$ points in $\mathbb{C}$ to obtain a fibration over unordered configuration spaces of $n-1$ complex points. Fundamental groups of these restricted…

In [1] we introduced the concept of structured space, which is a topological space that locally resembles some algebraic structures. In [2] we proceeded the study of these spaces, developing two cohomology theories. The aim of this paper is…

Classification is an important goal in many branches of mathematics. The idea is to describe the members of some class of mathematical objects, up to isomorphism or other important equivalence in terms of relatively simple invariants. Where…

Given a finite graph G and a topological space Z, the graphical configuration space Conf(G, Z) is the space of functions V(G) -> Z so that adjacent vertices map to distinct points. We provide a homotopy decomposition of Conf(G, X x Y) in…

This paper studies the structure of graphs with given tree-width and excluding a fixed complete bipartite subgraph, which generalises the bounded degree setting. We give a new structural description of such graphs in terms of so-called…

I consider configuration spaces for $N$-body problems, gauge theories and for GR in both geometrodynamical and Ashtekar variables forms, including minisuperspace and inhomogeneous perturbations thereabout in the former case. These examples…

For a given bundle $\xi \colon E \to M$ over a manifold, configuration-section spaces on $\xi$ parametrise finite subsets $z \subseteq M$ equipped with a section of $\xi$ defined on $M \smallsetminus z$, with prescribed "charge" in a…

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 consider, for a finite graph $G$, when the surjective map $\mathrm{Conf}_{n+1}(G) \rightarrow \mathrm{Conf}_n(G)$ of configuration spaces admits a section. We study when the answer depends only on the homotopy type of $G$, and give a…

Compositionality is a key property for dealing with complexity, which has been studied from many points of view in diverse fields. Particularly, the composition of individual computations (or programs) has been widely studied almost since…

This is the first in a series of papers math.AG/0503029, math.AG/0410267, math.AG/0410268 on "configurations" in an abelian category A. Given a finite partially ordered set (I,<), an (I,<)-configuration (\sigma,\iota,\pi) is a finite…

The aim of this article is to provide space level maps between configuration spaces of graphs that are predicted by algebraic manipulations of cellular chains. More explicitly, we consider edge contraction and half-edge deletion, and…

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…