Related papers: Generic properties of Whitehead's Algorithm and is…

Let $\Gamma<\mathrm{PSL}_2(\mathbb{C})\simeq \mathrm{Isom}^+(\mathbb{H}^3)$ be a finitely generated non-Fuchsian Kleinian group whose ordinary set $\Omega=\mathbb{S}^2-\Lambda$ has at least two components. Let $\rho : \Gamma \to…

We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations -- that is, as quotients of term algebras over decidable sets…

The weak regular coherence is a coarse property of a finitely generated group $\Gamma$. It was introduced by G. Carlsson and this author to play the role of a weakening of Waldhausen's regular coherence as part of computation of the…

We study presentations, defined by Sidki, resulting in groups $y(m,n)$ that are conjectured to be finite orthogonal groups of dimension $m+1$ in characteristic two. This conjecture, if true, shows an interesting pattern, possibly connected…

We prove that generic elements of braid groups are pseudo-Anosov, in the following sense: in the Cayley graph of the braid group with n $\ge$ 3 strands, with respect to Garside's generating set, we prove that the proportion of pseudo-Anosov…

Autostackability for finitely generated groups is defined via a topological property of the associated Cayley graph which can be encoded in a finite state automaton. Autostackable groups have solvable word problem and an effective inductive…

In this paper we consider some classical varieties of linear algebras over the field which has characteristic 0. For every considered variety we take a category of the finite generated free algebras of this variety. And for every this…

By a map we mean a $2$-cell decomposition of a closed compact surface, i.e., an embedding of a graph such that every face is homeomorphic to an open disc. Automorphism of a map can be thought of as a permutation of the vertices which…

We investigate fixed point properties for isometric actions of topological groups on a wide class of metric spaces, with a particular emphasis on Hilbert spaces. Instead of requiring the action to be continuous, we assume that it is…

We give a uniform construction that, on input of a recursive presentation $P$ of a group, outputs a recursive presentation of a torsion-free group, isomorphic to $P$ whenever $P$ is itself torsion-free. We use this to re-obtain a known…

Let u be a cyclic word in a free group F_n of finite rank n that has the minimum length over all cyclic words in its automorphic orbit, and let N(u) be the cardinality of the set {v: |v|=|u| and v= \phi(u) for some \phi \in \text {Aut}F_n}.…

In this paper we prove the following rigidity theorem: a generic analytic polyhedron with non-compact automorphism group is biholomorphic to the product of a complex manifold with compact automorphism group and a polydisk. Moreover, this…

We study the complexity of isomorphism problems for d-way arrays, or tensors, under natural actions by classical groups such as orthogonal, unitary, and symplectic groups. Such problems arise naturally in statistical data analysis and…

The main result of this paper is a complete classification of the outer automorphism groups of two-generator, one-relator groups with torsion. To this classification we apply recent algorithmic results of Dahmani--Guirardel, which yields an…

It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…

We show that the automorphism groups of countably categorical linear orders are extremely amenable. Using methods of Kechris, Pestov, and Todorcevic, we use this fact to derive a structural Ramsey theorem for certain families of finite…

Frick and Grohe [J. ACM 48 (2006), 1184-1206] introduced a notion of graph classes with locally bounded tree-width and established that every first order logic property can be decided in almost linear time in such a graph class. Here, we…

We pursue the study of $\mathrm L^1$ full groups of graphings and of the closures of their derived groups, which we call derived $\mathrm L^1$ full groups. Our main result shows that aperiodic probability measure-preserving actions of…

This research was motivated by universal algebraic geometry. One of the central questions of universal algebraic geometry is: when two algebras have the same algebraic geometry? For answer of this question (see [Pl],[Ts]) we must consider…

We prove that the unitriangular automorphism group of a free group of rank $n$ has a faithful representation by matrices over a field, or in other words, it is a linear group, if and only if $n \leq 3.$ Thus, we have completed a description…