Related papers: Algorithmic detectability of iwip automorphisms

We prove that for a suitably nice class of random substitutions, their corresponding subshifts have automorphism groups that contain an infinite simple subgroup and a copy of the automorphism group of a full shift. Hence, they are…

We reveal an algorithm for determining the complete prefix code irreducibility (CPC-irreducibility) of dyadic trees labeled by a finite alphabet. By introducing an extended directed graph representation of tree shift of finite type (TSFT),…

We consider the task of learning Ising models when the signs of different random variables are flipped independently with possibly unequal, unknown probabilities. In this paper, we focus on the problem of robust estimation of…

We investigate the possible structures imposed on a finite group by its possession of an automorphism sending a large fraction of the group elements to their cubes, the philosophy being that this should force the group to be, in some sense,…

We prove that if F is a finitely generated free group and f:F -> F is an automorphism with polynomial growth of degree d, then there exists a characteristic subgroup S < F of finite index such that the induced automorphism of the…

If an outer (multilinear) commutator identity holds in a large subgroup of a group, then it holds also in a large characteristic subgroup. Similar assertions are valid for algebras and their ideals or subspaces. Varying the meaning of the…

We confirm a conjecture of Friedland and Milnor: if two polynomial automorphisms f and g in Aut(C^2) with dynamical degree >1 are conjugate by some holomorphic diffeomorphism \phi of C^2, then \phi is a polynomial automorphism; thus, f and…

It is shown that if G is a finite p-group of coclass 2 with p > 2, then G has a noninner automorphism of order p.

A polynomial algorithm for graphs' isomorphism testing is constructed in assumption that there exists a corresponding polynomial algorithm for graphs with trivial automorphism group.

We develop an algorithm for recognizing whether a character belongs to $\Sigma^m$. In order to apply it we just need to know that the ambient group is of type $\mathrm{FP}_m$ or of type $\mathrm{F}_2$ and that the word problem is solvable…

We analyze the structure of the \emph{frequency space} $Q(F)$ of a nonabelian free group $F=F(a_1,...,a_k)$ consisting of all shift-invariant Borel probability measures on $\partial F$ and construct a natural action of $Out(F)$ on $Q(F)$.…

We explicitly determine the automorphism groups of all self-similar trees (a.k.a. trees with finitely many cone types). We show that any such automorphism group is a direct limit of certain finite products of finite symmetric groups, which…

We prove that if $G_\phi=\langle F, t| t x t^{-1} =\phi(x), x\in F\rangle$ is the mapping torus group of an injective endomorphism $\phi: F\to F$ of a free group $F$ (of possibly infinite rank), then every two-generator subgroup $H$ of…

We will describe some results regarding the algorithmic nature of homeomorphism problems for manifolds; in particular, the following theorem. Theorem 1: Every PL or smooth simply connected manifold M^n of dimension n at least 5 can be…

For any atoroidal iwip $\phi \in Out(F_N)$ the mapping torus group $G_\phi=F_N\rtimes_\phi <t>e$ is hyperbolic, and the embedding $\iota: F_N \overset{\lhd}{\longrightarrow} G_\phi$ induces a continuous, $F_N$-equivariant and surjective…

The mapping torus induced by an automorphism $\phi$ of the free abelian group $\mathbb{Z}^n$ is a semi-direct product $G=\mathbb{Z}^n\rtimes_\phi \mathbb{Z}$. We show that whether the rank of $G$ is equal to $n+1$ is decidable. As a…

We present a coarse convexity result for the dynamics of free group automorphisms: Given an automorphism $\phi$ of a finitely generated free group $F$, we show that for all $x\in F$ and $0\leq i\leq N$, the length of $\phi^i(x)$ is bounded…

Let $F=(F_1,F_2):C^2 ---> C^2 be a polynomial automorphism. It is well know that deg F_1 | deg F_2 or deg F_2 | deg F_1. On the other hand, if (d_1,d_2) \in (N\{0})^2 is such that d_1 | d_2 or d_2 | d_1, then one can construct a polynomial…

We prove that there is an algorithm to determine if a given finite graph is an induced subgraph of a given curve graph.

This paper introduces the $f$-EI$(\phi)$ algorithm, a novel iterative algorithm which operates on measures and performs $f$-divergence minimisation in a Bayesian framework. We prove that for a rich family of values of $(f,\phi)$ this…