output
20022009
most citedBlack holes as mirrors: quantum information in random subsystems

1.4k citations

Showing 2009 · math.GRShow all

5 papers · 2 filters

math.GR2009

Compressed words and automorphisms in fully residually free groups

Jeremy Macdonald

We show that the compressed word problem in a finitely-generated fully residually free group (F -group) is decidable in polynomial time, and use the result to show that the word pr…

math.GR2009

Generic complexity of the Conjugacy Problem in HNN-extensions and algorithmic stratification of Miller's groups

Alexandre V. Borovik, Alexei G. Myasnikov, Vladimir N. Remeslennikov

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,…

math.GR20092 cited

The Conjugacy Problem in Amalgamated Products I: Regular Elements and Black Holes

Alexandre V. Borovik, Alexei G. Myasnikov, Vladimir N. Remeslennikov

We discuss the time complexity of the word and conjugacy search problems for free products of groups and with amalgamation over a subgroup . We stratif…

math.GR2009

Groups Elementarily Equivalent to a Free 2-nilpotent Group of Finite Rank

Alexei G. Myasnikov, Mahmood Sohrabi

In this paper we find a characterization for groups elementarily equivalent to a free nilpotent group of class 2 and arbitrary finite rank.

math.GR20097 cited

On Systems of Equations over Free Products of Groups

Montserrat Casals-Ruiz, Ilya Kazachkov

Using an analogue of Makanin-Razborov diagrams, we give a description of the solution set of systems of equations over an equationally Noetherian free product of groups . Equiva…