Related papers: The power conjugacy problem in Higman-Thompson gro…
A $P_4$-free graph is called a cograph. In this paper we partially characterize finite groups whose power graph is a cograph. As we will see, this problem is a generalization of the determination of groups in which every element has prime…
There are several graphs defined on groups. Among them we consider graphs whose vertex set consists conjugacy classes of a group $G$ and adjacency is defined by properties of the elements of conjugacy classes. In particular, we consider…
In this paper we study conjugacy and subgroup separability properties in the class of nilpotent $\mathbb{Q}[x]$-powered groups. Many of the techniques used to study these properties in the context of ordinary nilpotent groups carry over…
In this paper, we will study presentations of the continuous full group $\Gamma_A$ of a one-sided topological Markov shift $(X_A,\sigma_A)$ for an irreducible matrix $A$ with entries in $\{0,1\}$ as a generalization of Higman-Thompson…
Let $n\in \mathbb{N}$. Houghton's group $H_n$ is the group of permutations of $\{1,\dots, n\}\times \mathbb{N}$, that eventually act as a translation in each copy of $\mathbb{N}$. We prove the solvability of the conjugacy problem and…
We consider the problem of constructing matched groups such that the resulting groups are statistically similar with respect to their average values for multiple covariates. This group-matching problem arises in many cases, including…
In his earlier work, the author introduced a group theory question that arises in the study of iterated Galois groups of post-critically finite quadratic polynomials. In this paper, we prove the first non-trivial results on this question.
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.
In this paper we provide an alternative solution to a result by Juh\'{a}sz that the twisted conjugacy problem for odd dihedral Artin groups is solvable, that is, groups with presentation $G(m) = \langle a,b \; | \; _{m}(a,b) = {}_{m}(b,a)…
Looking for an efficient algorithm for the computation of the homology groups of an algebraic set or even a semi-algebraic set is an important problem in the effective real algebraic geometry. Recently, Peter Burgisser, Felipe Cucker and…
An algorithm is constructed that, when given an explicit presentation of a finitely generated nilpotent group $G,$ decides for any pair of endomorphisms $\varphi, \psi : G \to G$ and any pair of elements $u, v \in G,$ whether or not the…
This article is concerned with conjugacy problems arising in homeomorphisms group, Hom($F$), of unbounded subsets $F$ of normed vector spaces $E$. Given two homeomorphisms $f$ and $g$ in Hom($F$), it is shown how the existence of a…
In this paper, we present a novel algorithm for power allocation in the Amplify-and-Forward cooperative communication that minimizes the outage probability with a given value of total power. We present the problem with new formulation and…
Geometric methods proposed by Stallings for treating finitely generated subgroups of free groups were successfully used to solve a wide collection of decision problems for free groups and their subgroups. In the present paper we employ the…
Complex polynomial optimization has recently gained more and more attention in both theory and practice. In this paper, we study the optimization of a real-valued general conjugate complex form over various popular constraint sets including…
There currently exists no algebraic algorithm for computing twisted conjugacy classes in free groups. We propose a new technique for deciding twisted conjugacy relations using nilpotent quotients. Our technique is generalization of the…
We give several algorithms addressing computations of intersections of conjugate subgroups.
Monod introduced in [14] a family of Thompson-like groups which provides natural counterexamples to the von Neumann-Day conjecture. We construct a characterization of conjugacy and invariant and use them to compute centralizers in one group…
We advocate a new approach of addressing hidden structure problems and finding efficient quantum algorithms. We introduce and investigate the Hidden Symmetry Subgroup Problem (HSSP), which is a generalization of the well-studied Hidden…
This article is dedicated to the computation of an explicit presentation of some asymptotically rigid mapping class groups, namely the braided Higman-Thompson groups. To do so, we use the action of these groups on the spine complex, a…