Related papers: Presentations of Graph Braid Groups
Given a graphical degree sequence ${\bf d}=(d_1,\ldots, d_n)$, let $G(n, {\bf d})$ denote a uniformly random graph on vertex set $[n]$ where vertex $ i$ has degree $d_i$ for every $1\le i\le n$. We give upper and lower bounds on the joint…
We give a description of the centralizer algebras for tensor powers of spin objects in the pre-modular categories $SO(N)_2$ (for $N$ odd) and $O(N)_2$ (for $N$ even) in terms of quantum $(n-1)$-tori, via non-standard deformations of…
Define a Garside monoid to be a cancellative monoid where right and left lcm's exist and that satisfy additional finiteness assumptions, and a Garside group to be the group of fractions of a Garside monoid. The family of Garside groups…
Extending the methods from our previous work on quantum knots and quantum graphs, we describe a general procedure for quantizing a large class of mathematical structures which includes, for example, knots, graphs, groups, algebraic…
We compute all sections of the finite Weyl group, that satisfy the braid relations, in the case that G is an almost-simple connected reductive group defined over an algebraically closed field. We then demonstrate that this set of sections…
An obstacle representation of a graph $G$ consists of a set of pairwise disjoint simply-connected closed regions and a one-to-one mapping of the vertices of $G$ to points such that two vertices are adjacent in $G$ if and only if the line…
In this paper we introduce the framed pure braid group on $n$ strands of an oriented surface, a topological generalisation of the pure braid group $P_n$. We give different equivalents definitions for framed pure braid groups and we study…
In previous two papers, we defined fractional Brauer configuration algebras and developed their covering theory. In this paper, we study the representation theory of fractional Brauer graph algebras of type MS, a special class of fractional…
Graphs are fundamental data structures which concisely capture the relational structure in many important real-world domains, such as knowledge graphs, physical and social interactions, language, and chemistry. Here we introduce a powerful…
Recently there has been growing interest in discrete homotopies and homotopies of graphs beyond treating graphs as 1-dimensional simplicial spaces. One such type of homotopy is $\times$-homotopy. Recent work by Chih-Scull has developed a…
For every graph that is mimimally rigid in the plane, its Galois group is defined as the Galois group generated by the coordinates of its planar realizations, assuming that the edge lengths are transcendental and algebraically independent.…
Let $X$ be a non-empty set of positive integers and $X^*=X\setminus \{1\}$. The divisibility graph $D(X)$ has $X^*$ as the vertex set and there is an edge connecting $a$ and $b$ with $a, b\in X^*$ whenever $a$ divides $b$ or $b$ divides…
Many multivariate data such as social and biological data exhibit complex dependencies that are best characterized by graphs. Unlike sequential data, graphs are, in general, unordered structures. This means we can no longer use classic,…
A monotone drawing of a graph G is a straight-line drawing of G such that every pair of vertices is connected by a path that is monotone with respect to some direction. Trees, as a special class of graphs, have been the focus of several…
There has been a great deal of attention recently to graphs whose vertex set is a group, defined using the group structure. (The commuting graph, where two elements are joined if they commute, is the oldest and most famous example.) The…
A planar pure braid consists of $n$ descending smooth arcs, each connecting a point on one horizontal line $\ell_{1}$ to a point on a horizontal line $\ell_{2}$, which is required to be directly below the first point. Two arcs are allowed…
For a finite group $G$, the vertices of the prime graph $\Gamma(G)$ are the primes that divide $|G|$, and two vertices $p$ and $q$ are connected by an edge if and only if there is an element of order $pq$ in $G$. Prime graphs of solvable…
We study a novel type of braid groups on a closed orientable surface $\Sigma$. These are fundamental groups of certain manifolds that are hybrids between symmetric products and configuration spaces of points on $\Sigma$; a class of examples…
The (proper) power graph of a group is a graph whose vertex set is the set of all (nontrivial) elements of the group and two distinct vertices are adjacent if one is a power of the other. Various kinds of planarity of (proper) power graphs…
In~\cite{Ma} Manturov studied groups $G_{n}^{k}$ for fixed integers $n$ and $k$ such that $k<n$. In particular, $G_{n}^{2}$ is isomorphic to the group of free braids of $n$-stands. In~\cite{KiMa} Manturov and the author studied an invariant…