Related papers: Algorithmic theory of free solvable groups: random…
Most classical scheduling formulations assume a fixed and known duration for each activity. In this paper, we weaken this assumption, requiring instead that each duration can be represented by an independent random variable with a known…
We introduce and study the bounded word problem and the precise word problem for groups given by means of generators and defining relations. For example, for every finitely presented group, the bounded word problem is in NP, i.e., it can be…
In this paper, three efficient ensemble algorithms are proposed for fast-solving the random fluid-fluid interaction model. Such a model can be simplified as coupling two heat equations with random diffusion coefficients and a friction…
The word problem for discrete groups is well-known to be undecidable by a Turing Machine; more precisely, it is reducible both to and from and thus equivalent to the discrete Halting Problem. The present work introduces and studies a real…
In 1971 C.F.\ Miller associated to every finitely presented group $G$ a free-by-free group $M(G)$ known as the Miller Machine, whose conjugacy problem is closely related to the conjugacy and word problems of $G$. We quantify this…
Let H and K be quasiconvex subgroups of a negatively curved torsion-free group G. We give an algorithm which decides whether an element of H is conjugated in G to an element of K.
The discrete logarithm problem in a finite group is the basis for many protocols in cryptography. The best general algorithms which solve this problem have time complexity of $\mathcal{O}(\sqrt{N}\log N)$, and a space complexity of…
We prove that the problems of deciding whether a quadratic equation over a free group has a solution is NP-complete.
We generalize the classical Post correspondence problem ($\mathbf{PCP}_n$) and its non-homogeneous variation ($\mathbf{GPCP}_n$) to non-commutative groups and study the computational complexity of these new problems. We observe that…
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…
Equations in free groups have become prominent recently in connection with the solution to the well known Tarski Conjecture. Results of Makanin and Rasborov show that solvability of systems of equations is decidable and there is a method…
In this paper we study the complexity of solving quadratic equations in the lamplighter group. We give a complete classification of cases (depending on genus and other characteristics of a given equation) when the problem is…
The conjugacy problem belongs to algorithmic group theory. It is the following question: given two words x, y over generators of a fixed group G, decide whether x and y are conjugated, i.e., whether there exists some z such that zxz^{-1} =…
In this paper, I investigate more closely the recently proposed Free Energy Monte Carlo algorithm that is devised in particular for calculations where conventional Monte Carlo simulations struggle with ergodicity problems. The simplest…
This manuscript represents the author's PhD dissertation thesis.The first part studies decision problems in Thompson's groups F,T,V and some generalizations. The simultaneous conjugacy problem is determined to be solvable for Thompson's…
We propose a new cryptosystem based on polycyclic groups. The cryptosystem is based on the fact that the word problem can be solved effectively in polycyclic groups, while the known solutions to the conjugacy problem are far less efficient.
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 an optimal control problem under uncertainty, where the target function is the solution of an elliptic partial differential equation with random coefficients, steered by a control function. The robust formulation of the…
In this paper we investigate the word problem of the free Burnside semigroup satisfying x^2=x^3 and having two generators. Elements of this semigroup are classes of equivalent words. A natural way to solve the word problem is to select a…
We investigate the average-case complexity of decision problems for finitely generated groups, in particular the word and membership problems. Using our recent results on ``generic-case complexity'' we show that if a finitely generated…