相关论文: The conjugacy problem for UPG elements of $Out(F_n…

The formal class of a germ of diffeomorphism $\phi$ is embeddable in a flow if $\phi$ is formally conjugated to the exponential of a germ of vector field. We prove that there are complex analytic unipotent germs of diffeomorphisms at…

Let $G$ be a finite group admitting a coprime automorphism $\alpha$ of order $e$. Denote by $I_G(\alpha)$ the set of commutators $g^{-1}g^\alpha$, where $g\in G$, and by $[G,\alpha]$ the subgroup generated by $I_G(\alpha)$. We study the…

The conjugator length function of a finitely generated group $\Gamma$ gives the optimal upper bound on the length of a shortest conjugator for any pair of conjugate elements in the ball of radius $n$ in the Cayley graph of $\Gamma$. We…

Let $\phi:G\to G$ be an automorphism of a group which is a free-product of finitely many groups each of which is freely indecomposable and two of the factors contain proper finite index characteristic subgroups. We show that $G$ has…

In various occasions the conjugacy problem in finitely generated amalgamated products and HNN extensions can be decided efficiently for elements which cannot be conjugated into the base groups. This observation asks for a bound on how many…

A word in a free group is called ``potentially positive'' if it is automorphic to an element which is written with only positive exponents. We will develop automata to analyze properties of potentially positive words. We will use these to…

This is the second in a series of four papers (with research announcement posted on this arXiv) that together develop a decomposition theory for subgroups of Out(F_n). In this paper we relativize the "Kolchin-type theorem" from the work of…

We study the existence of homomorphisms between Out(F_n) and Out(F_m) for n > 5 and m < n(n-1)/2, and conclude that if m is not equal to n then each such homomorphism factors through the finite group of order 2. In particular this provides…

In this article, we solve the twisted conjugacy problem with respect to endomorphisms for solvable Baumslag--Solitar groups $BS(1,n)$, i.e., we propose an algorithm which, given two elements $u,v \in BS(1,n)$ and an endomorphism $\psi \in…

For simple algebraic groups defined over algebraically closed fields of good characteristic, we give upper bounds on the covering numbers of unipotent conjugacy classes in terms of their (co)ranks and in terms of their dimensions.

Let $\phi \in \mbox{Out}(F_n)$ be a free group outer automorphism that can be represented by an expanding, irreducible train-track map. The automorphism $\phi$ determines a free-by-cyclic group $\Gamma=F_n \rtimes_\phi \mathbb Z,$ and a…

Suppose, $G$ is a residually finite group of finite upper rank admitting an automorphism $\varphi$ with finite Reidemeister number $R(\varphi)$ (the number of $\varphi$-twisted conjugacy classes). We prove that such $G$ is soluble-by-finite…

Let $G$ be a connected reductive algebraic group defined over the finite field $\FF_q$, where $q$ is a power of a good prime for $G$. We write $F$ for the Frobenius morphism of $G$ corresponding to the $\FF_q$-structure, so that $G^F$ is a…

Given two conjugate mapping classes f and g, we produce a conjugating element w such that |w| < K(|f|+|g|), where |.| denotes the word metric with respect to a fixed generating set, and K is a constant depending only on the generating set.…

Let $F$ be a free group of finite rank. We say that the monomorphism problem in $F$ is decidable if for any two elements $u$ and $v$ in $F$, there is an algorithm that determines whether there exists a monomorphism of $F$ that sends $u$ to…

Given a short exact sequence of groups with certain conditions, $1\to F\to G\to H\to 1$, we prove that $G$ has solvable conjugacy problem if and only if the corresponding action subgroup $A\leqslant Aut(F)$ is orbit decidable. From this, we…

Let $G$ be a classical group defined over a finite field. We consider the following fundamental problems concerning conjugacy in $G$: 1. List a representative for each conjugacy class of $G$. 2. Given $x \in G$, describe the centralizer of…

The first-order (FO) model checking problem asks, given an FO sentence $\phi$ and a graph $G$, whether $G$ is a model of $\phi$. This problem is known to be $\mathsf{AW[*]}$-hard when parameterized by the quantifier rank of the formula. A…

Let $q$ be a prime power and $\phi$ a rational function with coefficients in a finite field $\mathbb{F}_q$. For $n \geq 1$, each element of $\mathbb{P}^1(\F_{q^n})$ is either periodic or strictly preperiodic under iteration of $\phi$.…

If $f(p, n)$ is the number of pairwise nonisomorphic groups of order $p^n$, and $g(p,n)$ is the number of groups of order $p^n$ whose automorphism group is a $p$-group, then, for $n \leq 7$, we prove that the ratio $g(p,n)/f (p,n)$ is…