Related papers: Algorithmic detectability of iwip automorphisms

We prove that given a finite rank free group $\mathbb{F}$ of rank $\geq 3$ and two exponentially growing outer automorphisms $\psi$ and $\phi$ with dual lamination pairs $\Lambda^\pm_\psi$ and $\Lambda^\pm_\phi$ associated to them, and…

We prove that computing a single pair of vertices that are mapped onto each other by an isomorphism $\phi$ between two isomorphic graphs is as hard as computing $\phi$ itself. This result optimally improves upon a result of G\'{a}l et al.…

Let $\mathcal{P}$ be a property of function $\mathbb{F}_p^n \to \{0,1\}$ for a fixed prime $p$. An algorithm is called a tester for $\mathcal{P}$ if, given a query access to the input function $f$, with high probability, it accepts when $f$…

We prove that, although it is undecidable if a subgroup fixed by an automorphism intersects nontrivially an arbitrary subgroup of $F_n\times F_m$, there is an algorithm that, taking as input a monomorphism and an endomorphism of $F_n\times…

An automorphism of a graph $G=(V,E)$ is a bijective map $\phi$ from $V$ to itself such that $\phi(v_i)\phi(v_j)\in E$ $\Leftrightarrow$ $v_i v_j\in E$ for any two vertices $v_i$ and $v_j$. Denote by $\mathfrak{G}$ the group consisting of…

We prove that the conjugacy problem in Out(Fm) is solvable for the class of outer automorphisms whose restrictions to their polynomial subgroups are of finite order. To do this, we first investigate the structure of suspensions of free…

For fixed subgroups $Fix(\phi)$ of automorphisms $\phi$ on hyperbolic 3-manifold groups $\pi_{1}(M)$, we observed that $\text{rk}(Fix(\phi))<2\text{rk}(\pi_{1}(M))$ and the constant 2 in the inequality is sharp; we also classify all…

We prove that for any prime number $p$, every finite non-abelian $p$-group $G$ of class 2 has a noninner automorphism of order $p$ leaving either the Frattini subgroup $\Phi(G)$ or $\Omega_1(Z(G))$ elementwise fixed.

For a finite group G of Lie type and a prime p, we compare the automorphism groups of the fusion and linking systems of G at p with the automorphism group of G itself. When p is the defining characteristic of G, they are all isomorphic,…

We study the interaction between two structures on the group of polynomial automorphisms of the affine plane: its structure as an amalgamated free product and as an infinite-dimensional algebraic variety. We introduce a new conjecture, and…

We present a new algorithm to compute all the chiral polytopes that have a given group $G$ as full automorphism group. This algorithm uses a new set of generators that characterize the group, all of them except one being involutions. It…

We study those fully irreducible outer automorphisms phi of a finite rank free group F_r which are ``parageometric'', meaning that the attracting fixed point of phi in the boundary of outer space is a geometric R-tree with respect to the…

The goal of this paper is to understand the set $\mathrm{End}(W)$ of endomorphisms of an irreducible spherical reflection group $W$. We do this in two ways: numerically, by deriving an explicit formula for $|\mathrm{End}(W)|$; and…

We consider the class non-surjective irreducible endomorphisms of the free group $F_n$. We show that such an endomorphism $\phi$ is topologically represented by a simplicial immersion $f:G \rightarrow G$ of a marked graph $G$; along the way…

Form an $n \times n$ matrix by drawing entries independently from $\{\pm1\}$ (or another fixed nontrivial finitely supported distribution in $\mathbf{Z}$) and let $\phi$ be the characteristic polynomial. Conditionally on the extended…

In 1981, Lubiw proved that the fixed point free automorphism problem (FPFAut) is NP-complete: given a graph G, determine whether there exists an automorphism that maps no vertex of G to itself. We revisit this problem and prove that FPFAut…

Many complex questions in biology, physics, and mathematics can be mapped to the graph isomorphism problem and the closely related graph automorphism problem. In particular, these problems appear in the context of network visualization,…

Automorphisms of handlebodies arise naturally in the a classification of automorphisms of three-manifolds. Among automorphisms of handlebodies, there are certain automorphisms called irreducible (or generic), which are analogues of…

We consider the problem of designing a machine learning-based model of an unknown dynamical system from a finite number of (state-input)-successor state data points, such that the model obtained is also suitable for optimal control design.…

Let \phi be an endomorphism of a finitely generated free group F, and let H be a finite-index subgroup of F that is invariant under \phi. The nonzero eigenvalues of \phi are contained in the eigenvalues of \phi restricted to H.