Related papers: Algorithmic detectability of iwip automorphisms

Let $K$ be a field and $f:\mathbb{P}^N \to \mathbb{P}^N$ a morphism. There is a natural conjugation action on the space of such morphisms by elements of the projective linear group $\text{PGL}_{N+1}$. The group of automorphisms, or…

We study the decidability of the topological properties of some objects coming from fractal geometry. We prove that having empty interior is undecidable for the sets defined by two-dimensional graph-directed iterated function systems. These…

We show that a finite group $G$ admitting an automorphism $\alpha$ such that the function $G\rightarrow G$, $g\mapsto g\alpha(g)$, is bijective is necessarily solvable.

We consider the feasibility problem of integer linear programming (ILP). We show that solutions of any ILP instance can be naturally represented by an FO-definable class of graphs. For each solution there may be many graphs representing it.…

Computer algebra systems are really good at factoring polynomials, i.e. writing f as a product of irreducible factors. It is relatively easy to verify that we have a factorisation, but verifying that these factors are irreducible is a much…

Let X be a flexible variety of F be an isomorphism of closed one-dimensional subschemes of $X$. We develop criteria which guarantee that F extends to au automorphism of X.

If F is a finitely generated free group and \phi is an automorphism of F then the mapping torus of \phi admits a quadratic isoperimetric inequality. This is the third and final paper in a series proving this theorem. The first two were…

An automorphism of a graph $G$ with $n$ vertices is a bijective map $\phi$ from $V(G)$ to itself such that $\phi(v_i)\phi(v_j)\in E(G)$ $\Leftrightarrow$ $v_i v_j\in E(G)$ for any two vertices $v_i$ and $v_j$ of $G$. Denote by…

For every atoroidal iwip automorphism $\phi$ of $F_N$ (i.e. the analogue of a pseudo-Anosov mapping class) it is shown that the algebraic lamination dual to the forward limit tree $T_+(\phi)$ is obtained as "diagonal closure" of the support…

The main theorem of this document emulates, in the context of Out(F_r) theory, a mapping class group theorem (by H. Masur and J. Smillie) that determines precisely which index lists arise from pseudo-Anosov mapping classes. Since the ideal…

Let $G$ and $H$ be two simple graphs. A bijection $\phi:V(G)\rightarrow V(H)$ is called an isomorphism between $G$ and $H$ if $(\phi v_i)(\phi v_j)\in E(H)$ $\Leftrightarrow$ $v_i v_j\in E(G)$, $\forall v_i,v_j \in V(G)$. In the case that…

If $F$ is a finitely generated free group and $\phi$ is a positive automorphism of $F$ then $F\rtimes_\phi Z$ satisfies a quadratic isoperimetric inequality.

We study proper holomorphic maps between type-$\mathrm{I}$ irreducible bounded symmetric domains. In particular, we obtain rigidity results for such maps under certain assumptions. More precisely, let $f:D^{\mathrm{I}}_{p,q}\to…

In functional analysis, approximative properties of an object become precise in its ultrapower. We discuss this idea and its consequences for automorphisms of II_1 factors. Here are some sample results: (1) an automorphism is approximately…

We relate the McMullen polynomial of a free-by-cyclic group to its Alexander polynomial. To do so, we introduce the notion of an orientable fully irreducible outer automorphism $\varphi$ and use it to characterize when the homological…

The monography examines the problem of constructing a group of automorphisms of a graph. A graph automorphism is a mapping of a set of vertices onto itself that preserves adjacency. The set of such automorphisms forms a vertex group of a…

If F is a finitely generated free group and \phi is an automorphism of F then F \rtimes_\phi Z satisfties a quadratic isoperimetric inequality.

We prove that one cannot algorithmically decide whether a finitely presented $\mathbb{Z}$-extension admits a finitely generated base group, and we use this fact to prove the undecidability of the BNS invariant. Furthermore, we show the…

We compute explicitly the automorphism and outer automorphism group of all large-type free-of-infinity Artin groups. Our strategy involves reconstructing the associated Deligne complexes in a purely algebraic manner, i.e. in a way that is…

An element $\phi$ of the outer automorphism group $\Out(\f)$ of the rank $n$ free group $F_n$ is {\it polynomially growing} if the word lengths of conjugacy classes in $\f$ grow at most polynomially under iteration by $\phi$. It is {\it…