Related papers: Probabilistic Solutions of Equations in the Braid …

We show that a finitely generated subgroup of a free group, chosen uniformly at random, is strictly Whitehead minimal with overwhelming probability. Whitehead minimality is one of the key elements of the solution of the orbit problem in…

In this paper, we study properties of random walks on finite groups and later use them to obtain the limiting braid length expectation and component number of braid closure in a model of random braids, which is constructed by lifting…

In this paper we studied combinatorial problems with parameterized locally budgeted uncertainty. We are looking for a solutions set such that for any parameters vector there exists a solution in the set with robustness near optimal. The…

We study and give examples of braided groupoids, and, a fortiori, non-degenerate solutions of the quiver-theoretical braid equation.

In this paper, we develop an ensemble-based time-stepping algorithm to efficiently find numerical solutions to a group of linear, second-order parabolic partial differential equations (PDEs). Particularly, the PDE models in the group could…

The Equation Problem in finitely presented groups asks if there exists an algorithm which determines in finite amount of time whether any given equation system has a solution or not. We show that the Equation Problem in central extensions…

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 the paper we give a survey on braid groups and subjects connected with them. We start with the initial definition, then we give several interpretations as well as several presentations of these groups. Burau presentation for the pure…

In the last decade, a number of public key cryptosystems based on com- binatorial group theoretic problems in braid groups have been proposed. We survey these cryptosystems and some known attacks on them. This survey includes: Basic facts…

The problem of pattern selection arises when the evolution equations have many solutions, whereas observed patterns constitute a much more restricted set. An approach is advanced for treating the problem of pattern selection by defining the…

We study ranked enumeration of join-query results according to very general orders defined by selective dioids. Our main contribution is a framework for ranked enumeration over a class of dynamic programming problems that generalizes…

In this paper we give an algorithm for solving a main case of the conjugacy problem in the braid groups. We also prove that half-twists satisfy a special root property which allows us to reduce the solution for the conjugacy problem in…

Consider a relatively hyperbolic group G. We prove that if G is finitely presented, so are its parabolic subgroups. Moreover, a presentation of the parabolic subgroups can be found algorithmically from a presentation of G, a solution of its…

We give a new method to compute the centralizer of an element in Artin braid groups and, more generally, in Garside groups. This method, together with the solution of the conugacy problem given by the authors in a previous paper, are two…

We introduce a set of iterative equations that exactly solves the size distribution of components on small arbitrary graphs after the random removal of edges. We also demonstrate how these equations can be used to predict the distribution…

In this paper we investigate the decidability and complexity of problems related to braid composition. While all known problems for a class of braids with three strands, $B_3$, have polynomial time solutions we prove that a very natural…

The discrete logarithm problem in a finite group is the basis for many protocols in cryptography. The best general algorithms which solve this problem have time complexity of $\mathcal{O}(\sqrt{N}\log N)$, and a space complexity of…

We investigate analytically the problem of enumeration of nonequivalent primitive words in the braid group B_n for n >> 1 by analysing the random word statistics and the target space on the basis of the locally free group approximation. We…

We give an algorithm to decide whether a given braid with four strings is a product of three factors which are conjugates of standard generators of the braid group. The algorithm is of polynomial time. It is based on the Garside theory. We…

We define the min-min expectation selection problem (resp. max-min expectation selection problem) to be that of selecting k out of n given discrete probability distributions, to minimize (resp. maximize) the expectation of the minimum value…