Related papers: Identifying Powers of Half-Twists and Computing it…
We provide a characterization for multitwists satisfying the braid relation in the mapping class group of an orientable surface.
Let $X$ be a smooth scheme with an action of a reductive algebraic group $G$ over an algebraically closed field $k$ of characteristic zero. We construct an action of the extended affine Braid group on the $G$-equivariant absolute derived…
We adapt algorithms for resolving the singularities of complex algebraic varieties to prove that the natural map of homology theories from complex bordism to the bordism theory of complex derived orbifolds splits. In equivariant stable…
In this article, we give a numerical algorithm to compute braid groups of curves, hyperplane arrangements, and parameterized system of polynomial equations. Our main result is an algorithm that determines the cross-locus and the generators…
In \cite{Oh22}, the second author defined a complex of groups decomposition of the fundamental group of a finitely generated 2-dimensional special group, called an \emph{intersection complex}, which is a quasi-isometry invariant. In this…
In the work we discuss two invariants of conjugacy classes of braids. The first invariant is the conformal module which occurred in connection with the interest in the 13th Hilbert Problem. The second is a popular dynamical invariant, the…
We investigate the padded version of reduction, an extension of multifraction reduction as defined in arXiv:1606.08991, and connect it both with ordinary reduction and with the so-called Property $\mathrm{H}$. As an application, we show…
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…
According to the Tits conjecture proved by Crisp and Paris, [CP], the subgroups of the braid group generated by proper powers of the Artin elements are presented by the commutators of generators which are powers of commuting elements. Hence…
We give deterministic polynomial-time algorithms that, given an order, compute the primitive idempotents and determine a set of generators for the group of roots of unity in the order. Also, we show that the discrete logarithm problem in…
Conjugacy is not the only possible primitive for designing braid-based protocols. To illustrate this principle, we describe a Fiat--Shamir-style authentication protocol that be can be implemented using any binary operation that satisfies…
A Gauss diagram is a simple, combinatorial way to present a link. It is known that any Vassiliev invariant may be obtained from a Gauss diagram formula that involves counting subdiagrams of certain combinatorial types. In this paper we…
Governed by locality, we explore a connection between unitary braid group representations associated to a unitary $R$-matrix and to a simple object in a unitary braided fusion category. Unitary $R$-matrices, namely unitary solutions to the…
In their paper `A new algorithm for recognizing the unknot', in Geometry and Topology', 2 (1998) n. 9, 175-220, the first author and Michael Hirsch presented a then new algorithm for recognizing the unknot. The first part of the algorithm…
The orbifold braid groups of two dimensional orbifolds were defined in [1] (arXiv:math/9907194) to understand certain Artin groups as subgroups of some suitable orbifold braid groups. We studied orbifold braid groups in some more detail in…
The conjugacy growth function counts the number of distinct conjugacy classes in a ball of radius $n$. We give a lower bound for the conjugacy growth of certain branch groups, among them the Grigorchuk group. This bound is a function of…
In this article, we solve the twisted conjugacy problem for solvable Baumslag--Solitar groups $BS(n,1)$, i.e., we propose an algorithm which, given two elements $u,v \in BS(n,1)$ and an automorphism $\varphi \in \Aut(BS(n,1))$, decides…
In Artin-Tits groups attached to Coxeter groups of spherical type, we give a combinatorial formula to express the simple elements of the dual braid monoids in the classical Artin generators. Every simple dual braid is obtained by lifting an…
Multi-attributed graph matching is a problem of finding correspondences between two sets of data while considering their complex properties described in multiple attributes. However, the information of multiple attributes is likely to be…
We give a graph-sum algorithm that expresses any genus-$g$ Gromov-Witten invariant of the symmetric product orbifold $\mathrm{Sym}^d\mathbb{P}^r:=[(\mathbb{P}^r)^d/S_d]$ in terms of "Hurwitz-Hodge integrals" -- integrals over (compactified)…