Related papers: Subgroups of braid groups generated by Birman-Ko-L…
We relate full exceptional sequences in Fukaya categories of surfaces or equivalently in derived categories of graded gentle algebras to branched coverings over the disk, building on a previous classification result of the first and third…
If $G$ is a countable, discrete group generated by two finite subgroups $H$ and $K$ and $P$ is a II$_1$ factor with an outer G-action, one can construct the group-type subfactor $P^H \subset P \rtimes K$ introduced in \cite{BH}. This…
We construct, for the free group acting on its Cayley tree, boomerang subgroups whose critical exponent is arbitrarily close to the critical exponent of a given finitely generated subgroup.
We study several natural decision problems in braid groups and Artin groups. We classify the Artin groups with decidable submonoid membership problem in terms of the non-existence of certain forbidden induced subgraphs of the defining…
The main goal of this paper is to apply the arithmetic method developed in our previous paper \cite{13} to determine the number of some types of subgroups of finite abelian groups.
We define virtual braid groups of type B and construct a morphism from such a group to the group of isomorphism classes of some invertible complexes of bimodules up to homotopy.
We show that the generation problem in Thompson group $F$ is decidable, i.e., there is an algorithm which decides if a finite set of elements of $F$ generates the whole $F$. The algorithm makes use of the Stallings $2$-core of subgroups of…
We begin with a review of the notion of a braid group. We then discuss some known solutions to decision problems in braid groups. We then move on to proving new results in braid group algorithmics. We offer a quick solution to the…
Subgroup discovery is a local pattern mining technique to find interpretable descriptions of sub-populations that stand out on a given target variable. That is, these sub-populations are exceptional with regard to the global distribution.…
We introduce an axiomatization of the notion of a semidirect product of locally compact quantum groups and study properties. Our approach is slightly different from the one introduced in the thesis of S.~Roy and, unlike the investigations…
With an arbitrary finite graph having a special form of 2-intervals (a diamond-shaped graph) we associate a subgroup of a symmetric group and a representation of this subgroup; state a series of problems on such groups and their…
Previously the second author has constructed by cobordism methods, an invariant associated to a finite group $G$. This invariant approximates the number of subgroups of a group, giving in some cases the number of abelian and cyclic…
We introduce and develop a language of semigroups over the braid groups for a study of braid monodromy factorizations (bmf's) of plane algebraic curves and other related objects. As an application we give a new proof of Orevkov's theorem on…
We describe a new algorithm for computing braid orbits on Nielsen classes. As an application we classify all families of affine genus zero systems; that is all families of coverings of the Riemann sphere by itself such that the monodromy…
In this paper we continue to develop the topological method started in Santos-San Martin \cite{ariasm} to get semigroup generators of semi-simple Lie groups. Consider a subset $\Gamma \subset G$ that contains a semi-simple subgroup $G_{1}$…
A polynomial time algorithm to give a complete description of all subfields of a given number field was given in an article by van Hoeij et al. This article reports on a massive speedup of this algorithm. This is primary achieved by our new…
The existence of an infinite simple boundedly generated 2-generated group and the existence of a boundedly simple 2-generated group containing a free non-cyclic subgroup are proved.
We give a small generating set for the twist subgroup of the mapping class group of a non-orientable surface by Dehn twists. The difference between the number of the generators and a lower bound of numbers of generators for the twist…
In this paper we find the generating function for the number of vertices which have $k$ elements in their subtree and use this generating function to calculate the probability that a vertex has a size $k$ subtree. We also show how this same…
In this paper, we study subgroup separability (also known as LERF) and related properties for surface braid groups and virtual (singular) braid groups.