Related papers: Identifying Half-Twists Using Randomized Algorithm…
We introduce an algorithmic framework to investigate spherical and geodesic growth series of braid groups relatively to the Artin's or Birman-Ko-Lee's generators. We present our experimentations in the case of three and four strands and…
In this paper, we propose a deterministic algorithm that approximates the optimal path cover on weighted undirected graphs. Based on the 1/2-Approximation Path Cover Algorithm by Moran et al., we add a procedure to remove the redundant…
Graded posets frequently arise throughout combinatorics, where it is natural to try to count the number of elements of a fixed rank. These counting problems are often $\#\textbf{P}$-complete, so we consider approximation algorithms for…
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.…
In this paper we present a novel algorithm for computing a congruence on an inverse semigroup from a collection of generating pairs. This algorithm uses a myriad of techniques from the theories of groups, automata, and inverse semigroups.…
An introduction to the universal algebra approach to Higman-Thompson groups (including Thompson's group $V$) is given, following a series of lectures by Graham Higman in 1973. In these talks, Higman outlined an algorithm for the conjugacy…
A numerical semigroup $S$ is an additively-closed set of non-negative integers, and a factorization of an element $n$ of $S$ is an expression of $n$ as a sum of generators of $S$. It is known that for a given numerical semigroup $S$, the…
The paper considers the problem of finding the number of dominant voters in two-level voting procedures. At the first stage, voting is conducted among local groups of voters, and at the second stage, the results are aggregated to form a…
In the paper we give a survey of rather new notions and results which generalize classical ones in the theory of braids. Among such notions are various inverse monoids of partial braids. We also observe presentations different from standard…
This work considers clustering nodes of a largely incomplete graph. Under the problem setting, only a small amount of queries about the edges can be made, but the entire graph is not observable. This problem finds applications in…
When the boundary of a familiar object is shown by a series of isolated dots, humans can often recognize the object with ease. This ability can be sustained with addition of distracting dots around the object. However, such capability has…
This paper aims to develop a grafting method to address Majid's conjecture, which enables the construction of a larger target quantum group by grafting two given smaller ones. This method is significant for advancing the understanding of…
We prove that every finitely-generated right-angled Artin group can be embedded into some Brin-Thompson group $nV$. It follows that many other groups can be embedded into some $nV$ (e.g., any finite extension of any of Haglund and Wise's…
Twisted right-angled Artin groups are defined through presentation based on mixed graphs. Each vertex corresponds to a generator, each undirected edge yields a commuting relation and each directed edge gives a Klein bottle relation. If…
We present a new algorithm deciding if the intersection of a quasiconvex subgroup of a negatively curved group with a conjugate is finite. We also give a short proof of decidability of the membership problem for quasiconvex subgroups of…
We consider the topological complexity of subgroups of Artin's braid group consisting of braids whose associated permutations lie in some specified subgroup of the symmetric group. We give upper and lower bounds for the topological…
Braids can be represented geometrically as curve diagrams. The geometric complexity of a braid is the minimal complexity of a curve diagram representing it. We introduce and study the corresponding notion of geometric generating function.…
The homology of a Garside monoid, thus of a Garside group, can be computed efficiently through the use of the order complex defined by Dehornoy and Lafont. We construct a categorical generalization of this complex and we give some…
We introduce the canonical reduction system of an element in an Artin-Tits group of spherical type, which generalizes the similar notion for braids (and mapping classes) introduced by Birman, Lubotzky and McCarthy. We show its basic…
Any positive word comprised of random sequence of tokens form a finite alphabet can be reduced (without change of length) using an appropriate size Braid group relationships. Surprisingly the Braid relations dramatically reduce the…