Related papers: On the Conjugacy Problem in Groups and its Variant…
Let $k$ be an algebraically closed field, $G$ a linear algebraic group over $k$ and $\varphi\in Aut(G)$, the group of all algebraic group automorphisms of $G$. Two elements $x, y$ of $G$ are said to be $\varphi$-twisted conjugate if…
We develop an explicit covering theory for complexes of groups, parallel to that developed for graphs of groups by Bass. Given a covering of developable complexes of groups, we construct the induced monomorphism of fundamental groups and…
In the marriage problem, a variant of the bi-parted matching problem, each member has a `wish-list' expressing his/her preference for all possible partners; this list consists of random, positive real numbers drawn from a certain…
Spinal groups and multi-GGS groups are both generalisations of the well-known Grigorchuk-Gupta-Sidki (GGS-)groups. Here we give a necessary condition for spinal groups to be conjugate, and we establish a necessary and sufficient condition…
A finitely presented group is semistable at infinity if all proper rays in the Cayley 2-complex are properly homotopic. A long standing open question asks whether all finitely presented groups are semistable at infinity. This article…
In this article we survey recent progress in the algorithmic theory of matrix semigroups. The main objective in this area of study is to construct algorithms that decide various properties of finitely generated subsemigroups of an infinite…
We find polynomial-time solutions to the word problem for free-by-cyclic groups, the word problem for automorphism groups of free groups, and the membership problem for the handlebody subgroup of the mapping class group. All of these…
In this paper, we consider one-to-one matchings between two disjoint groups of agents. Each agent has a preference over a subset of the agents in the other group, and these preferences may contain ties. Strong stability is one of the…
We present a new algorithm to solve the conjugacy problem in Artin braid groups, which is faster than the one presented by Birman, Ko and Lee. This algorithm can be applied not only to braid groups, but to all Garside groups (which include…
We prove that finitely presented residually free groups are subgroup conjugacy separable. Furthermore, if they are of type $FP_\infty$, then they are also subgroup conjugacy distinguished. Using a connection between conjugacy separability…
This paper studies a matching problem in which a group of agents cooperate with agents on two sides. In environments with either nontransferable or transferable utilities, we demonstrate that a stable outcome exists when cooperations…
This thesis deals with applications of experimental mathematics to a number of problems. The first problem is related to random graph statistics. We consider a certain class of Galton-Watson random trees and look at the total height…
We associate a finite directed graph with each equivalence class of words in $F_2$ under $\operatorname*{Aut} F_2$, and we completely classify these graphs, giving a structural classification of the automorphic conjugacy classes of $F_2$.…
The notion of acyclic matching property was provided by Losonczy and it was proved that torsion-free groups admit this property. In this paper, we introduce a duality of acyclic matching as a tool for classification of some Abelian groups,…
Recently knapsack problems have been generalized from the integers to arbitrary finitely generated groups. The knapsack problem for a finitely generated group $G$ is the following decision problem: given a tuple $(g, g_1, \ldots, g_k)$ of…
The aim of this paper is to unify the points of view of three recent and independent papers (Ventura 1997, Margolis, Sapir and Weil 2001 and Kapovich and Miasnikov 2002), where similar modern versions of a 1951 theorem of Takahasi were…
We present two sets of theoretical results on the grouped lasso with overlap of Jacob, Obozinski and Vert (2009) in the linear regression setting. This method allows for joint selection of predictors in sparse regression, allowing for…
A generalization of recent group-theoretic matrix multiplication algorithms to an analogue of the theory of partial matrix multiplication is presented. We demonstrate that the added flexibility of this approach can in some cases improve…
We study two modifications of the Post Correspondence Problem (PCP), namely 1) the bi-infinite version, where it is asked whether there exists a bi-infinite word such that two given morphisms agree on it, and 2) the conjugate version, where…
This paper is dedicated to the conjugacy problem in $GL(n,\Z)$ and its connection with algebraic number theory. This connection may be summed up in the Latimer-MacDuffee-Taussky Theorem, which, in a very broad sense, identifies the…