Related papers: On rigidity and the isomorphism problem for tree b…
We investigate a group $B\_\bullet$ that includes Artin's braid group $B\_\infty$ and Thompson's group $F$. The elements of $B\_\bullet$ are represented by braids diagrams in which the distances between the strands are not uniform and,…
We show several geometric and algebraic aspects of a necklace: a link composed with a core circle and a series of circles linked to this core. We first prove that the fundamental group of the configuration space of necklaces (that we will…
The main result of this paper is that the isomorphism for omega-automatic trees of finite height is at least has hard as second-order arithmetic and therefore not analytical. This strengthens a recent result by Hjorth, Khoussainov,…
We investigate the parameterized complexity of the recognition problem for the proper $H$-graphs. The $H$-graphs are the intersection graphs of connected subgraphs of a subdivision of a multigraph $H$, and the properness means that the…
In this paper we formulate and study the problem of representing groups on graphs. We show that with respect to polynomial time turing reducibility, both abelian and solvable group representability are all equivalent to graph isomorphism,…
We consider the problem of constructing an an optimal-weight tree from the 3*(n choose 4) weighted quartet topologies on n objects, where optimality means that the summed weight of the embedded quartet topologiesis optimal (so it can be the…
We use rational formality of configuration spaces and the bar construction to study the cohomology of the space of braids in dimension four or greater. We provide a diagram complex for braids and a quasi-isomorphism to the de Rham cochains…
A result of Allock [1](arXiv:math/9907194) states that certain orbifold braid groups contain Artin groups of type $D_n$, $\tilde{B}_n$ and $\tilde{D}_n$ as finite index subgroups. The underlying orbifolds have at most two cone points of…
We present approximation algorithms for the following NP-hard optimization problems related to bottleneck spanning trees in metric spaces. 1. The disjoint bottleneck spanning tree problem: Given $n$ pairs of points in a metric space, find…
In this paper, we solve the conjugacy problem for Topological Full Groups of Irreducible Edge Shifts, introduced by Matui in 2015 and later recontextualized as groups of almost automorphisms of trees by Lederle in 2020. The techniques we…
The Tree Decomposition Conjecture by Bar\'at and Thomassen states that for every tree $T$ there exists a natural number $k(T)$ such that the following holds: If $G$ is a $k(T)$-edge-connected simple graph with size divisible by the size of…
In the present paper, we construct a monomorphism from (Artin) pure braid group $PB_{n}$ into a group, which is `bigger' than $PB_{n}$. Roughly speaking, this mapping is defined on words of braids by adding `new generators' between…
Trigraph list homomorphism problems (also known as list matrix partition problems) have generated recent interest, partly because there are concrete problems that are not known to be polynomial time solvable or NP-complete. Thus while…
Artin's representation is an injective homomorphism from the braid group $B_n$ on $n$ strands into $\operatorname{Aut}\mathbb{F}_n$, the automorphism group of the free group $\mathbb{F}_n$ on $n$ generators. The representation induces maps…
In this note, a new class of representations of the braid groups $B_{N}$ is constructed. It is proved that those representations contain three kinds of irreducible representations: the trivial (identity) one, the Burau one, and an…
We continue the study of $(\mathrm{tw},\omega)$-bounded graph classes, that is, hereditary graph classes in which the treewidth can only be large due to the presence of a large clique, with the goal of understanding the extent to which this…
In this paper, we introduce a new problem called Tree-Residue Vertex-Breaking (TRVB): given a multigraph $G$ some of whose vertices are marked "breakable," is it possible to convert $G$ into a tree via a sequence of "vertex-breaking"…
In this paper the author finds explicitly all finite-dimensional irreducible representations of a series of finite permutation groups that are homomorphic images of Artin braid group.
The aim of the present note is to construct invariants of the Artin braid group valued in $G_{N}^{2}$, and further study of groups related to $G_{n}^{3}$. In the groups $G_{n}^{2}$, the word problem is solved; these groups are much simpler…
An infinitary version of braid groups has been considered as a direct limit of n-braid groups. However, we can imagine more complicated braids with infinitely many strings. We invetisgate basic properties especially when the number of…