Related papers: Geometric presentations of braid groups for partic…
Interactions and relations between objects may be pairwise or higher-order in nature, and so network-valued data are ubiquitous in the real world. The "space of networks", however, has a complex structure that cannot be adequately described…
We demonstrate that graph-based models are fully capable of representing higher-order interactions, and have a long history of being used for precisely this purpose. This stands in contrast to a common claim in the recent literature on…
The Standard Model of particle physics provides very accurate predictions of phenomena occurring at the sub-atomic level, but the reason for the choice of symmetry group and the large number of particles considered elementary, is still…
Inspired by quantum information theory, we look for representations of the braid groups $B_n$ on $V^{\otimes (n+m-2)}$ for some fixed vector space $V$ such that each braid generator $\sigma_i, i=1,...,n-1,$ acts on $m$ consecutive tensor…
In our preceding papers we started considering the categories of tangles with flat G-connections in their complements, where G is a simple complex algebraic group. The braiding (or the commutativity constraint) in such categories satisfies…
We describe presentations of braid groups of type ADE and show how these presentations are compatible with mutation of quivers, building on work of Barot and Marsh for Coxeter groups. In types A and D these presentations can be understood…
Given a finite graph G there is a corresponding group given by the presentation with generators the vertices of G and a relation [x,y]=1 for generators x and y precisely when (x,y) is an edge of G. Such groups are known as partially…
A finite simple graph \G determines a right-angled Artin group G_\G, with one generator for each vertex v, and with one commutator relation vw=wv for each pair of vertices joined by an edge. The Bestvina-Brady group N_\G is the kernel of…
We give several new positive finite presentations for the pure braid group that are easy to remember and simple in form. All of our presentations involve a metric on the punctured disc so that the punctures are arranged "convexly", which is…
Quasi-median graphs are a tool commonly used by evolutionary biologists to visualise the evolution of molecular sequences. As with any graph, a quasi-median graph can contain cut vertices, that is, vertices whose removal disconnect the…
We investigate a family of (reducible) representations of Artin's braid groups corresponding to a specific solution to the Yang-Baxter equation. The images of the braid groups under these representations are finite groups, and we identify…
Consider a family $\mathcal{T}$ of 3-connected graphs of moderate growth, and let $\mathcal{G}$ be the class of graphs whose 3-connected components are graphs in $\mathcal{T}$. We present a general framework for analyzing such graphs…
Graphlets are subgraphs rooted at a fixed vertex. The number of occurrences of graphlets aligned to a particular vertex, called graphlet degree sequence (gds), gives a topological description of the surrounding of the analyzed vertex.…
We study the connectivity of proper power graphs of some family of finite groups including nilpotent groups, groups with a non-trivial partition, and symmetric and alternating groups.
The power graph of a group $G$, denoted as $P(G)$, constitutes a simple undirected graph characterized by its vertex set $G$. Specifically, vertices $a,b$ exhibit adjacency exclusively if $a$ belongs to the cyclic subgroup generated by $b$…
We investigate the problem of drawing graphs in 2D and 3D such that their edges (or only their vertices) can be covered by few lines or planes. We insist on straight-line edges and crossing-free drawings. This problem has many connections…
Graph spanners are sparse subgraphs which approximately preserve all pairwise shortest-path distances in an input graph. The notion of approximation can be additive, multiplicative, or both, and many variants of this problem have been…
We develop random graph models where graphs are generated by connecting not only pairs of vertices by edges but also larger subsets of vertices by copies of small atomic subgraphs of arbitrary topology. This allows the for the generation of…
Recently, the second and third author showed that complete geometric graphs on $2n$ vertices in general cannot be partitioned into $n$ plane spanning trees. Building up on this work, in this paper, we initiate the study of partitioning into…
There are several graphs defined on groups. Among them we consider graphs whose vertex set consists conjugacy classes of a group $G$ and adjacency is defined by properties of the elements of conjugacy classes. In particular, we consider…