Related papers: An Algorithm to Solve the Generalized Conjugacy Pr…
Given a system of equations in a "random" finitely generated subgroup of the braid group, we show how to find a small ordered list of elements in the subgroup, which contains a solution to the equations with a significant probability.…
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…
We prove that the conjugacy problem in the first Grigorchuck group $\Gamma$ can be solved in linear time. Furthermore, the problem to decide if a list of elements $w_1,\ldots,w_k\in\Gamma$ contains a pair of conjugate elements can be solved…
We study, from a constructive computational point of view, the techniques used to solve the conjugacy problem in the "generic" lattice-ordered group Aut(R) of order automorphisms of the real line. We use these techniques in order to show…
We explore the combination theorem for a group G splitting as a graph of relatively hyperbolic groups. Using the fine graph approach to relative hyperbolicity, we find short proofs of the relative hyperbolicity of G under certain…
Guba and Sapir asked if the simultaneous conjugacy problem was solvable in Diagram Groups or, at least, for Thompson's group F. We give a solution to the latter question using elementary techniques which rely purely on the description of F…
This article is dedicated to the characterisation of the relative hyperbolicity of Haglund and Wise's special groups. More precise, we introduce a new combinatorial formalism to study (virtually) special groups, and we prove that, given a…
Let $G$ be a group endowed with a solution to the conjugacy problem and with an algorithm which computes the centralizer in $G$ of any element of $G$. Let $H$ be a subgroup of $G$. We give some conditions on $H$, under which we provide a…
We describe an implementation of a genetic algorithm on partially commutative groups and apply it to the double coset search problem on a subclass of groups. This transforms a combinatorial group theory problem to a problem of combinatorial…
We give several algorithms addressing computations of intersections of conjugate subgroups.
This paper studies decision problems for semigroups that are word-hyperbolic in the sense of Duncan & Gilman. A fundamental investigation reveals that the natural definition of a `word-hyperbolic structure' has to be strengthened slightly…
This course introduces the use of semigroup methods in the solution of linear and nonlinear (quasi-linear) hyperbolic partial differential equations, with particular application to wave equations and Hermitian hyperbolic systems. Throughout…
In this paper we generalize techniques of Belk-Matucci to solve the conjugacy problem for every Thompson-like group $V_n(H)$, where $n \geq 2$ and $H$ is a subgroup of the symmetric group on $n$ elements. We use this to prove that, if $n…
We consider the Cauchy problem for a system of fully nonlinear parabolic equations. In this paper, we shall show the existence of global-in-time solutions to the problem. Our condition to ensure the global existence is specific to the fully…
In this paper we study a semilinear hyperbolic-parabolic system modeling biological phenomena evolving on a network composed by oriented arcs. We prove the existence of global (in time) smooth solutions to this problem. The result is…
In this short paper we present an algorithm for finding a solution to a generalized Sudoku.
We study the conjugacy problem in cyclic extensions of free groups. It is shown that the conjugacy problem is solvable in split extensions of finitely generated free groups by virtually inner automorphisms. An algorithm for construction of…
We study a hyperbolic-parabolic model of chemotaxis in dimensions one and two. In particular, we prove the global existence of classical solutions in certain dissipation regimes.
In this paper we show that certain special cases of the hidden subgroup problem can be solved in polynomial time by a quantum algorithm. These special cases involve finding hidden normal subgroups of solvable groups and permutation groups,…
We prove that the generalised word problem of a finitely generated subgroup of a finitely generated virtually free group is context-free, that a hyperbolic group must be virtually free if it has a torsion-free quasiconvex subgroup of…