Related papers: Implementation: The conjugacy problem in right-ang…
We construct an algorithm that, given a pair of homomorphisms between polycyclic-by-finite groups, determines whether their Reidemeister number is finite, and if so returns a set of representatives of the twisted conjugacy classes.…
In this survey, we address the worst-case, average-case, and generic-case time complexity of the word problem and some other algorithmic problems in several classes of groups and show that it is often the case that the average-case…
We consider decidability problems in self-similar semigroups, and in particular in semigroups of automatic transformations of $X^*$. We describe algorithms answering the word problem, and bound its complexity under some additional…
In this paper, matching pairs of random graphs under the community structure model is considered. The problem emerges naturally in various applications such as privacy, image processing and DNA sequencing. A pair of randomly generated…
Solving Quadratic equation is one of the intrinsic interests as it is the simplest nonlinear equations. A novel approach for solving Quadratic Equation based on Genetic Algorithms (GAs) is presented. Genetic Algorithms (GAs) are a technique…
Baumslag-Solitar groups were introduced in 1962 by Baumslag and Solitar as examples for finitely presented non-Hopfian two-generator groups. Since then, they served as examples for a wide range of purposes. As Baumslag-Solitar groups are…
The orbit problem is at the heart of symmetry reduction methods for model checking concurrent systems. It asks whether two given configurations in a concurrent system (represented as finite strings over some finite alphabet) are in the same…
A new robust algorithm for the numerical computation of biarcs, i.e. $G^1$ curves composed of two arcs of circle, is presented. Many algorithms exist but are based on geometric constructions, which must consider many geometrical…
In this paper we show how to combine two algorithmic techniques to obtain linear time algorithms for various optimization problems on graphs, and present a subroutine which will be useful in doing so. The first technique is iterative…
Recently, there have been several progresses for the conjugacy search problem (CSP) in Garside groups, especially in braid groups. All known algorithms for solving this problem use a sort of exhaustive search in a particular finite set such…
There exist right angled Artin groups $A$ such that the isomorphism problem for finitely presented subgroups of $A$ is unsolvable, and for certain finitely presented subgroups the conjugacy and membership problems are unsolvable. It follows…
A new weak Galerkin (WG) finite element method for solving the biharmonic equation in two or three dimensional spaces by using polynomials of reduced order is introduced and analyzed. The WG method is on the use of weak functions and their…
A new weak Galerkin (WG) finite element method is introduced and analyzed in this paper for the biharmonic equation in its primary form. This method is highly robust and flexible in the element construction by using discontinuous piecewise…
Recently the third named author defined a 2-parametric family of groups $G_n^k$ \cite{gnk}. Those groups may be regarded as a certain generalisation of braid groups. Study of the connection between the groups $G_n^k$ and dynamical systems…
We define a family of groups that include the mapping class group of a genus g surface with one boundary component and the integral symplectic group Sp(2g,Z). We then prove that these groups are finitely generated. These groups, which we…
Lattice field theories with complex actions are not easily studied using conventional analytic or simulation methods. However, a large class of these models are invariant under CT, where C is charge conjugation and T is time reversal,…
Graph matching is a challenging problem with very important applications in a wide range of fields, from image and video analysis to biological and biomedical problems. We propose a robust graph matching algorithm inspired in…
We develop an analogy between right-angled Artin groups and mapping class groups through the geometry of their actions on the extension graph and the curve graph respectively. The central result in this paper is the fact that each…
There does not exist an algorithm that can determine whether or not a group presented by commutators is a right-angled Artin group.
For every integer l bigger than one, we find elements x and y in the mapping class group of an appropriate orientable surface S, satisfying the Artin relation of length l. That is, xyx... = yxy..., where each side of the equality contains l…