Related papers: Configuration spaces of graphs with certain permit…

We investigate an algebraic problem related to the determination of the fundamental group of a class of spaces of configurations on surfaces. The configuration spaces are spaces of points grouped into colors. Whether two points are allowed…

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…

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…

We consider for two based graphs $G$ and $H$ the sequence of graphs $G_k$ given by the wedge sum of $G$ and $k$ copies of $H$. These graphs have an action of the symmetric group $\Sigma_k$ by permuting the $H$-summands. We show that 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…

Let G be a graph. The (unlabeled) configuration space of n points on G is the space of all n-element subsets of G. The fundamental group of such a configuration space is called a graph braid group. We use a version of discrete Morse theory…

Configuration spaces of distinct labeled points on the plane are of practical relevance in designing safe control schemes for Automated Guided Vehicles (robots) in industrial settings. In this announcement, we consider the problem of the…

In this paper we introduce a graph structure, called subspace sum graph $\mathcal{G}(\mathbb{V})$ on a finite dimensional vector space $\mathbb{V}$ where the vertex set is the collection of non-trivial proper subspaces of a vector space and…

In this paper we study the topology of the space of Riemann surfaces in a simply connected space X, S_{g,n} (X, \gamma). This is the space consisting of triples, (F_{g,n}, \phi, f), where F_{g,n} is a Riemann surface of genus g and…

There has been growing interest in studies of general random intersection graphs. In this paper, we consider a general random intersection graph $\mathbb{G}(n,\overrightarrow{a}, \overrightarrow{K_n},P_n)$ defined on a set $\mathcal{V}_n$…

An $(n_k)$-configuration is a set of $n$ points and $n$ lines in the projective plane such that their point-line incidence graph is $k$-regular. The configuration is geometric, topological, or combinatorial depending on whether lines are…

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…

We present a mathematical framework for describing the topology of configuration spaces for particles on one-connected graphs. In particular, we compute the homology groups over integers for different classes of one-connected graphs. Our…

A graph is Hamiltonian if it contains a cycle passing through every vertex. One of the cornerstone results in the theory of random graphs asserts that for edge probability $p \gg \frac{\log n}{n}$, the random graph $G(n,p)$ is…

The cycle space of a graph $G$, denoted $C(G)$, is a vector space over ${\mathbb F}_2$, spanned by all incidence vectors of edge-sets of cycles of $G$. If $G$ has $n$ vertices, then $C_n(G)$ is the subspace of $C(G)$, spanned by the…

We introduce and study the pinnacle sets of a simple graph $G$ with $n$ vertices. Given a bijective vertex labeling $\lambda\,:\,V(G)\rightarrow [n]$, the label $\lambda(v)$ of vertex $v$ is a pinnacle of $(G, \lambda)$ if…

Let $V_1, V_2, V_3, \dots $ be a sequence of $\mathbb{Q}$-vector spaces where $V_n$ carries an action of $\mathfrak{S}_n$ for each $n$. {\em Representation stability} and {\em multiplicity stability} are two related notions of when the…

A simple topological graph T = (V(T), E(T)) is a drawing of a graph in the plane where every two edges have at most one common point (an endpoint or a crossing) and no three edges pass through a single crossing. Topological graphs G and H…

The generalized Petersen graph $G(n, k)$ is a cubic graph with vertex set $V(G(n, k)) = \{v_i\}_{0 \leq i < n} \cup \{w_i\}_{0 \leq i < n}$ and edge set $E(G(n, k)) = \{v_i v_{i+1}\}_{0 \leq i < n} \cup \{w_i w_{i+k}\}_{0 \leq i < n} \cup…

The intersection graph of a group $G$ is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper non-trivial subgroups of $G$, and there is an edge between two distinct vertices $H$…