Related papers: An Algorithm to Solve the Generalized Conjugacy Pr…
Parabolic cut pairs in the boundaries of relatively hyperbolic group are a new and previously unexplored phenomenon. In this paper, we give a way to create examples of relatively hyperbolic groups with parabolic cut pairs on their boundary…
We design new deterministic and randomized algorithms for computational problems in free solvable groups. In particular, we prove that the word problem and the power problem can be solved in quasi-linear time and the conjugacy problem can…
We study existence, uniqueness, and distributional aspects of generalized solutions to the Cauchy problem for first-order symmetric (or Hermitian) hyperbolic systems of partial differential equations with Colombeau generalized functions as…
We show that one can define and effectively compute Stallings graphs for quasi-convex subgroups of automatic groups (\textit{e.g.} hyperbolic groups or right-angled Artin groups). These Stallings graphs are finite labeled graphs, which are…
This paper proves under certain conditions the existence of an algorithm, which detects relatively quasiconvex subgroups $H$ of relatively hyperbolic groups $(G,\mathbb{P})$. Additionally, this algorithm outputs an induced peripheral…
It is undecidable in general whether a given finitely presented group is word hyperbolic. We use the concept of pregroups, introduced by Stallings, to define a new class of van Kampen diagrams, which represent groups as quotients of…
Suppose that a finitely generated group $G$ is hyperbolic relative to a collection of subgroups $\mathbb{P}=\{P_1,\dots,P_m\}$. Let $H_1,H_2$ be subgroups of $G$ such that $H_1$ is relatively quasiconvex with respect to $\mathbb{P}$ and…
In this paper we study the generic, i.e., typical, behavior of finitely generated subgroups of hyperbolic groups and also the generic behavior of the word problem for amenable groups. We show that a random set of elements of a nonelementary…
We give an algorithm to solve the Conjugacy Problem for ascending HNN-extensions of free groups. To do this, we give algorithms to solve certain problems on dynamics of free group endomorphisms.
We discuss time complexity of The Conjugacy Problem in HNN-extensions of groups, in particular, in Miller's groups. We show that for "almost all", in some explicit sense, elements, the Conjugacy Problem is decidable in cubic time. It is…
We show that a relatively hyperbolic group either is virtually cyclic or has uniform exponential growth.
In this paper we introduce a polynomial time algorithm that solves both the conjugacy decision and search problems in free abelian-by-infinite cyclic groups where the input is elements in normal form. We do this by adapting the work of…
We present both, theory and an algorithm for solving time-harmonic wave problems in a general setting. The time-harmonic solutions will be achieved by computing time-periodic solutions of the original wave equations. Thus, an exact…
By deploying dense subalgebras of $\ell^1(G)$ we generalize the Bass conjecture in terms of Connes' cyclic homology theory. In particular, we propose a stronger version of the $\ell^1$-Bass Conjecture. We prove that hyperbolic groups…
In this article, we prove a combination theorem for a complex of relatively hyperbolic groups. It is a generalization of Martin's \cite{martin} work for combination of hyperbolic groups over a finite $M_K$-simplicial complex, where $k\leq…
We study the word and conjugacy problems in lacunary hyperbolic groups (briefly, LHG). In particular, we describe a necessary and sufficient condition for decidability of the word problem in LHG. Then, based on the graded small-cancellation…
In this paper, we establish the existence of solutions for a particular class of degenerate hyperbolic equations. Following this, we approximate these degenerate equations by employing a sequence of uniformly hyperbolic equations. Notably,…
In this paper, we generalize Spencer's hyperbolic cosine algorithm to the matrix-valued setting. We apply the proposed algorithm to several problems by analyzing its computational efficiency under two special cases of matrices; one in which…
The conjugacy problem for a finitely generated group $G$ is the two-variable problem of deciding for an arbitrary pair $(u,v)$ of elements of $G$, whether or not $u$ is conjugate to $v$ in $G$. We construct examples of finitely generated,…
The Hidden Subgroup Problem is used in many quantum algorithms such as Simon's algorithm and Shor's factoring and discrete log algorithms. A polynomial time solution is known in case of abelian groups, and normal subgroups of arbitrary…