Related papers: Configuration Graph Cohomology
We survey decades of research identifying the (co)homology of configuration spaces with Lie algebra (co)homology. The different routes to this one proto-theorem offer genuinely different explanations of its truth, and we attempt to convey…
We study finite graphs embedded in oriented surfaces by associating a polynomial to it. The tools used in developing a theory of such graph polynomials are algebraic topological while the polynomial itself is inspired from ideas arising in…
The symmetries of a finite graph are described by its automorphism group; in the setting of Woronowicz's quantum groups, a notion of a quantum automorphism group has been defined by Banica capturing the quantum symmetries of the graph. In…
The presented work focuses on problems from determinant theory, set theory and topology. The term graph is the binding element that connects these problems. Graphs are distinguished by their geometrical simplicity, which helps in showing…
We classify graphs and, more generally, finite relational structures that are identified by C2, that is, two-variable first-order logic with counting. Using this classification, we show that it can be decided in almost linear time whether a…
Homographies -- a mathematical formalism for relating image points across different camera viewpoints -- are at the foundations of geometric methods in computer vision and are used in geometric camera calibration, image registration, and…
The rational homology of unordered configuration spaces of points on any surface was studied by Drummond-Cole and Knudsen. We compute the rational cohomology of configuration spaces on a closed orientable surface, keeping track of the mixed…
We compute the integral homology and cohomology groups of configuration spaces of two distinct points on a given real projective space. The explicit answer is related to the (known multiplicative structure in the) integral cohomology---with…
In this paper we calculate the homology of configuration spaces of $n$ points on a circle, subject to the condition that two pre-determined points are included in the configuration. We make use of discrete Morse theory both to determine the…
Determining whether two graphs are structurally identical is a fundamental problem with applications spanning mathematics, computer science, chemistry, and network science. Despite decades of study, graph isomorphism remains a challenging…
Hoffman's bound is a well-known spectral bound on the chromatic number of a graph, known to be tight for instance for bipartite graphs. While Hoffman colorings (colorings attaining the bound) were studied before for regular graphs, for…
In this paper we consider the generalized anchored configuration spaces on $n$ labeled points on a~graph. These are the spaces of all configurations of $n$ points on a~fixed graph $G$, subject to the condition that at least $q$ vertices in…
A cohomological study is made of an equivariant map betwen the configuration space of n points in space and the flag manifold of U(n).
We explore the concept of a graph homomorphism through the lens of C$^*$-algebras and operator systems. We start by studying the various notions of a quantum graph homomorphism and examine how they are related to each other. We then define…
In this paper, we survey recent works on the structure of the mapping class groups of surfaces mainly from the point of view of topology. We then discuss several possible directions for future research. These include the relation between…
The \emph{Square Colouring} of a graph $G$ refers to colouring of vertices of a graph such that any two distinct vertices which are at distance at most two receive different colours. In this paper, we initiate the study of a related…
We consider the problems of finding optimal identifying codes, (open) locating-dominating sets and resolving sets of an interval or a permutation graph. In these problems, one asks to find a subset of vertices, normally called a…
Given a finite simple connected graph $\Gamma$, the graphical configuration space $\mathrm{Conf}_{\Gamma}(X)$ is the space of collections of points in $X$ indexed by the vertices of $\Gamma$, where points corresponding to adjacent vertices…
Hard disks systems are often considered as prototypes for simple fluids. In a statistical mechanics context, the hard disk configuration space is generally quotiented by the action of various symmetry groups. The changes in the topological…
Colouring problems arising from group-based constructions provide a natural link between combinatorics and algebra, particularly in the study of Cayley graphs and Latin squares. We introduce the notion of colouring bijections of finite…