Related papers: Algorithmic problems for free-abelian times free g…
We like to build Abelian groups (or R-modules) which on the one hand are quite free, say $\aleph_{\omega + 1}$-free, and on the other hand, are complicated in suitable sense. We choose as our test problem having no non-trivial homomorphism…
We adapt the Ping-Pong Lemma, which historically was used to study free products of groups, to the setting of the homeomorphism group of the unit interval. As a consequence, we isolate a large class of generating sets for subgroups of…
We prove new separability results about free groups. Namely, if $H_1, \ldots , H_k$ are infinite index, finitely generated subgroups of a non-abelian free group $F$, then there exists a homomorphism onto some alternating group $f:F…
We give a description of elementary subgroups (in the sense of first-order logic) of finitely generated virtually free groups. In particular, we recover the fact that elementary subgroups of finitely generated free groups are free factors.…
We consider homogeneous varieties of linear algebras over an associative-commutative ring K with 1, i.e., the varieties in which free algebras are graded. Let F be a free algebra of some variety A of linear algebras over K freely generated…
We consider semigroup algorithmic problems in finitely generated metabelian groups. Our paper focuses on three decision problems introduced by Choffrut and Karhum\"{a}ki (2005): the Identity Problem (does a semigroup contain a neutral…
In this article we overview those aspects of the theory of affine semigroups and their algebras that have been relevant for our own research, and pose several open problems. Answers to these problems would contribute substantially to the…
The worst-case complexity of group-theoretic algorithms has been studied for a long time. Generic-case complexity, or complexity on random inputs, was introduced and studied relatively recently. In this paper, we address the average-case…
The theory of bounded cohomology of groups has many applications. A key open problem is to compute the full bounded cohomology $H_b^n(F, R)$ of a non-abelian free group $F$ with trivial real coefficients. It is known that $H_b^n(F,R)$ is…
We give a complete description of the embeddings of direct products of nonabelian free groups into ${{\rm{Aut}}}(F_N)$ and ${{\rm{Out}}}(F_N)$ when the number of direct factors is maximal. To achieve this, we prove that the image of each…
This paper is a discussion of relations between some free-boundary problems and infinite dimensional Lie groups; particularly a version of Nahm's equations for the group of Hamiltonian diffeomorphisms in two dimensions.
We present a family of non-abelian groups for which the hidden subgroup problem can be solved efficiently on a quantum computer.
We revisit the problem of deciding whether a finitely generated subgroup H is a free factor of a given free group F. Known algorithms solve this problem in time polynomial in the sum of the lengths of the generators of H and exponential in…
We classify abelian subgroups of Out(F_n) up to finite index in an algorithmic and computationally friendly way. A process called disintegration is used to canonically decompose a single rotationless element \phi into a composition of…
Replacing finite groups by linear algebraic groups, we study an algebraic-geometric counterpart of the theory of free profinite groups. In particular, we introduce free proalgebraic groups and characterize them in terms of embedding…
In this paper we begin the systematic study of group equations with abelian predicates in the main classes of groups where solving equations is possible. We extend the line of work on word equations with length constraints, and more…
In analogy with the free factors of a free group we define special factors of Generalized Baumslag-Solitar (GBS) groups as non-cyclic subgroups which appear in splittings over infinite cyclic groups. We give an algorithm which, given a GBS…
Motivated by a theorem of Groves and Wilton, we propose the study of the lattice of numberings of isomorphism classes of marked groups as a rigorous and comprehensive framework to study global decision problems for finitely generated…
The group isomorphism problem in computational complexity asks whether two finite groups given by their Cayley tables are isomorphic or not. Although polynomial-time isomorphism tests exist for many specific types of groups, no general…
We prove that Whitehead's algorithm for solving the automorphism problem in a fixed free group $F_k$ has strongly linear time generic-case complexity. This is done by showing that the ``hard'' part of the algorithm terminates in linear time…