The first post

I am interested in algorithmic problems in algebraic structures. Here is my most recent paper.

Abstract: We construct the first examples of finitely presented residually finite groups with arbitrarily complicated word problem and depth function. The groups are solvable of class 3. We also prove that the universal theory of finite solvable of class 3 groups is undecidable, and give an example of a finitely presented (solvable of class 3) group with NP-complete word problem.


One comment

  1. Congratulations, Mark, for joining the blogsphere.

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s

%d bloggers like this: