Related papers: Configuration Spaces of Points: A User's Guide
In the vector space of symmetric functions, the elements of the basis of elementary symmetric functions are (up to a factor) the chromatic symmetric functions of disjoint unions of cliques. We consider their graph complements, the functions…
This is a version of a part of the book ``Transformations of Grassman Spaces'' (in progress). We study transformations of Grassman spaces preserving certain geometrical constructions related to buildings. The next part will be devoted to…
The local chromatic number is a coloring parameter defined as the minimum number of colors that should appear in the most colorful closed neighborhood of a vertex under any proper coloring of the graph. Its directed version is the same when…
Point configurations have been widely used as model systems in condensed matter physics, materials science and biology. Statistical descriptors such as the $n$-body distribution function $g_n$ is usually employed to characterize the point…
Combinatorics, in particular graph theory, has a rich history of being a domain of successful applications of tools from other areas of mathematics, including topological methods. Here, we survey the study of the Hom-complexes, and the ways…
The first part of this paper is a short review of the construction [dg-ga/9710001] of invariants of rational homology 3-spheres and knots in terms of configuration space integrals. The second part describes the relationship between the…
We present some methods for constructing connected spatial geometric configurations $(p_{q}, n_{k})$ of points and lines, preserved by the same rotations (and reflections) of Euclidean space $E^{3}$ as the chosen Platonic solid. In this…
We give a new interpretation of the chromatic polynomial of a simple graph G in terms of the Kac-Moody Lie algebra with Dynkin diagram G. We show that the chromatic polynomial is essentially the q-Kostant partition function of this Lie…
We consider the space $P$ of generic complex 5-degree polynomials. Critical values of such polynomial, i.e. four points in the complex plane, either are vertices of a convex quadrangle $Q$, or vertices of a triangle $T$ with one point…
A new algorithm to obtain the chromatic number of a finite, connected graph is proposed in this paper. The algorithm is based on contraction of non adjacent vertices.
We study the structure and dynamics of the infinite sequence of extensions of the Poincar{\'e} algebra whose method of construction was described in a previous paper [1]. We give explicitly the Maurer-Cartan (MC) 1-forms of the extended Lie…
We produce combinatorial models for configuration space in a simplicial complex, and for configurations near a single point ("local configuration space.") The model for local configuration space is built out of the poset of poset structures…
Henri Poincar\'e formulated the mathematics of the Lorentz transformations, known as the Poincar\'e group. He also formulated the Poincar\'e sphere for polarization optics. It is shown that these two mathematical instruments can be combined…
Let K be the space of long j-knots in R^n. In this paper we introduce a graph complex D and a linear map I from D to the de Rham complex of K via configuration space integral, and prove that (1) when both n>j>=3 are odd, the map I is a…
We establish a set of recursion relations for the coefficients in the chromatic polynomial of a graph or a hypergraph. As an application we provide a generalization of Whitney's broken cycle theorem for hypergraphs, as well as deriving an…
We continue studying the properties of $\gamma_0$-compact, $\gamma^*$-regular and $\gamma$-normal spaces defined in [5]. We also define and discuss $\gamma$-locally compact spaces.
Our main result offers a new (quite systematic) way of deriving bounds for the cup-length of Poincare spaces over fields; we outline a general research program based on this result. For the oriented Grassmann manifolds, already a limited…
We introduce the notion of P-polynomial coherent configurations and show that they can have at most two fibres. We then introduce a class of two-fibre coherent configurations which have two distinguished bases for the coherent algebra,…
The goal of this paper is to show the existence (using probabilistic tools) of configurations of lines, boxes, and points with certain interesting combinatorial properties. (i) First, we construct a family of $n$ lines in $\mathbb{R}^3$…
For Gamma a finite, connected metric graph, we consider the space of configurations of n points in Gamma with a restraint parameter r dictating the minimum distance allowed between each pair of points. These restricted configuration spaces…