Related papers: Presentations of Graph Braid Groups

The undirected power graph (or simply power graph) of a group $G$, denoted by $P(G)$, is a graph whose vertices are the elements of the group $G$, in which two vertices $u$ and $v$ are connected by an edge between if and only if either…

A graph is a data structure composed of dots (i.e. vertices) and lines (i.e. edges). The dots and lines of a graph can be organized into intricate arrangements. The ability for a graph to denote objects and their relationships to one…

Given a graph G, of arbitrary size and unbounded vertex degree, denote by |G| the one-complex associated with $G$. The topological space |G| is n-arc connected (n-ac) if every set of no more than n points of |G| are contained in an arc (a…

We study the representations of the commutator subgroup K_{n} of the braid group B_{n} into a finite group . This is done through a symbolic dynamical system. Some experimental results enable us to compute the number of subgroups of K_{n}…

This paper defines, for each graph $G$, a flag vector $fG$. The flag vectors of the graphs on $n$ vertices span a space whose dimension is $p(n)$, the number of partitions on $n$. The analogy with convex polytopes indicates that the linear…

The $G$-graph $\Gamma(G,S)$ is a graph from the group $G$ generated by $S\subseteq G$, where the vertices are the right cosets of the cyclic subgroups $\langle s \rangle, s\in S$ with $k$-edges between two distinct cosets if there is an…

The power graph of a group is the graph whose vertex set is the set of non-trivial elements of group, two elements being adjacent if one is a power of the other. We define a new power graph and study on connectivity, diameter and clique…

We unify and generalize several approaches to constructing braid group representations from finite groups, using iterated twisted tensor products. Our results hint at a relationship between the braidings on the $G$-gaugings of a pointed…

With every matching in a graph we associate a group called the matching group. We study this group using the theory of non-positively curved cubed complexes. Our approach is formulated in terms of so-called gliding systems.

In many ways, graphs are the main modality of data we receive from nature. This is due to the fact that most of the patterns we see, both in natural and artificial systems, are elegantly representable using the language of graph structures.…

An arithmetical structure on a finite, connected graph without loops is an assignment of positive integers to the vertices that satisfies certain conditions. Associated to each of these is a finite abelian group known as its critical group.…

Let V be the 7-dimensional irreducible representation of the quantum group U_q(g_2). For each n, there is a map from the braid group B_n to the endomorphism algebra of the n-th tensor power of V, given by R-matrices. We can extend this…

A graphical model is a statistical model that is associated to a graph whose nodes correspond to variables of interest. The edges of the graph reflect allowed conditional dependencies among the variables. Graphical models admit…

Let $G$ be a finite group and $N(G)$ be the set of its conjugacy class sizes excluding~$1$. Let us define a directed graph $\Gamma(G)$, the set of vertices of this graph is $N(G)$ and the vertices $x$ and $y$ are connected by a directed…

Given a graph $\Gamma$ and a number $n$, the associated $n^{th}$ graph braid group $B_n(\Gamma)$ is the fundamental group of the unordered configuration space of $n$ points on $\Gamma$. \'{S}wi\k{a}tkowski showed that for a given $\Gamma$…

Gaussian graphical models have become a well-recognized tool for the analysis of conditional independencies within a set of continuous random variables. From an inferential point of view, it is important to realize that they are composite…

We describe a new presentation for the complex reflection groups of type $(e,e,r)$ and their braid groups. A diagram for this presentation is proposed. The presentation is a monoid presentation which is shown to give rise to a Garside…

For a graph $G$ and integer $k\geq1$, we define the token graph $F_k(G)$ to be the graph with vertex set all $k$-subsets of $V(G)$, where two vertices are adjacent in $F_k(G)$ whenever their symmetric difference is a pair of adjacent…

Let $G$ be a nonabelian group, $A\subseteq G$ an abelian subgroup and $n\geqslant 2$ an integer. We say that $G$ has an $n$-abelian partition with respect to $A$, if there exists a partition of $G$ into $A$ and $n$ disjoint commuting…

Let $G(V, E)$ be a simple connected graph, with $|E| = \epsilon.$ In this paper, we define an edge-set graph $\mathcal G_G$ constructed from the graph $G$ such that any vertex $v_{s,i}$ of $\mathcal G_G$ corresponds to the $i$-th…