Related papers: Grid diagram for singular links

In this series, we introduce and investigate the concept of connectoids, which captures the connectivity structure of various discrete objects such as undirected graphs, directed graphs, bidirected graphs, hypergraphs and finitary matroids.…

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…

A strict bramble of a graph $G$ is a collection of pairwise-intersecting connected subgraphs of $G.$ The order of a strict bramble ${\cal B}$ is the minimum size of a set of vertices intersecting all sets of ${\cal B}.$ The strict bramble…

A block graph is a graph in which every block is a complete graph. Let $G$ be a block graph and let $A(G)$ be its (0,1)-adjacency matrix. Graph $G$ is called nonsingular (singular) if $A(G)$ is nonsingular (singular). An interesting open…

In this paper we introduce distinct approaches to loop braid groups, a generalisation of braid groups, and unify all the definitions that have appeared so far in literature, with a complete proof of the equivalence of these definitions.…

A differential geometric characterization of the braid-index of a link is found. After multiplication by 2pi, it equals the infimum of the sum of total curvature and total absolute torsion over holonomic representatives of the link. Upper…

Let $G$ be a finite group. The solubility graph associated with the finite group $G$, denoted by $\Gamma_{\cal S}(G)$, is a simple graph whose vertices are the non-trivial elements of $G$, and there is an edge between two distinct elements…

Braidoids form a counterpart theory to the theory of planar knotoids, just as braids do for three-dimensional links. As such, planar knotoid diagrams represent the same knotoid in $\mathbb{R}^2$ if and only if they can be presented as the…

We present an untyped linear lambda calculus with braids, the corresponding combinatory logic, and the semantic models given by crossed G-sets.

Tree-width is an invaluable tool for computational problems on graphs. But often one would like to compute on other kinds of objects (e.g. decorated graphs or even algebraic structures) where there is no known tree-width analogue. Here we…

We define an equivalence relation on graphs with signed edges, such that the associated adjacency matrices of two equivalent graphs are congruent over $\mathbb{Z}$. We show that signed graphs whose eigenvalues are larger than $-2$ are…

We develop a purely set-theoretic formalism for binary trees and binary graphs. We define a category of binary automata, and display it as a fibred category over the category of binary graphs. We also relate the notion of binary graphs to…

Exceptional sequences are certain ordered sequences of quiver representations. We introduce a class of objects called strand diagrams and use this model to classify exceptional sequences of representations of a quiver whose underlying graph…

An independent set in a graph G is a set of vertices no two of which are joined by an edge. A vertex-weighted graph associates a weight with every vertex in the graph. A vertex-weighted graph G is called a unique independence…

Let $G$ be a group. The directed endomorphism graph, $\dend(G)$ of $G$ is a directed graph with vertex set $G$ and there is a directed edge from the vertex $a$ to the vertex $b$ if $a \neq b$ and there exists an endomorphism on $G$ mapping…

Let $G$ be a finite subgroup of $\text{SL}(2,\Bbbk)$ and let $R = \Bbbk[x,y]^G$ be the coordinate ring of the corresponding Kleinian singularity. In 1998, Crawley-Boevey and Holland defined deformations $\mathcal{O}^\lambda$ of $R$…

We show that the virtual singular braid monoid on $n$ strands embeds in a group $VSG_n$, which we call the virtual singular braid group on $n$ strands. The group $VSG_n$ contains a normal subgroup $VSPG_n$ of virtual singular pure braids.…

We associate to a braided 2-stack ${\cal C}$ a torsor, endowed with a symmetric cube structure (or $\Sigma$-structure), whose triviality is equivalent to the existence on ${\cal C}$ of a fully symmetric monoidal structure. In order to…

We propose here a multidimensional generalisation of the notion of link introduced in our previous papers and we discuss some consequences for simplicial measures and sums of function algebras.

This work introduces a general theory of universal pseudomorphisms and develops their connection to diagrammatic coherence. The main results give hypotheses under which pseudomorphism coherence is equivalent to the coherence theory of…