Related papers: A Pansiot-type subword complexity theorem for auto…

Let $X$ be a variety of dimension $n$, and let $\mathrm{Aut}(X)$ be its automorphism group. When $X$ is quasi-affine, we prove that a solvable subgroup of $\mathrm{Aut}(X)$ that is generated by an irreducible family of automorphisms…

To each one-dimensional subshift $X$, we may associate a winning shift $W(X)$ which arises from a combinatorial game played on the language of $X$. Previously it has been studied what properties of $X$ does $W(X)$ inherit. For example, $X$…

We prove that for any automorphism $\alpha$ of a free group F of finite rank, one can efficiently compute a basis of the fixed point subgroup Fix(\alpha).

For a free group automorphism, we prove that its poset of attracting lamination orbits is a canonical invariant of the associated mapping torus. That is, if a free-by-cyclic group splits as a mapping torus in two different ways, then the…

Consider a compact metric space $X$, and let $\mathcal{F}=\{f_1,\,f_2,\ldots,\, f_k\}$ be a set of contracting and continuous self maps on $X$. Let $\Sigma$ be a sub-shift on $k$ symbols, and let $\Sigma_k$ be the full shift. Define…

We give conditions of an extension of a free group to be hyperbolic and relatively hyperbolic using the dynamics of the action of $\out$ on the complex of free factors combined with the weak attraction theory. We work with subgroups of…

We give a simple algorithm to solve the subgroup membership problem for virtually free groups. For a fixed virtually free group with a fixed generating set $X$, the subgroup membership problem is uniformly solvable in time $O(n\log^*(n))$…

We show that in the free group of rank 3, given an arbitrary number of automorphisms, the intersection of their fixed subgroups is equal to the fixed subgroup of some other single automorphism.

We note a parallel between some ideas of stable model theory and certain topics in finite combinatorics related to the sum-product phenomenon. For a simple linear group G, we show that a finite subset X with |X X \^{-1} X |/ |X| bounded is…

Let $F=\{\mathbf{p}_0,\ldots,\mathbf{p}_n\}$ be a collection of points in $\mathbb{R}^d.$ The set $F$ naturally gives rise to a family of iterated function systems consisting of contractions of the form $$S_i(\mathbf{x})=\lambda \mathbf{x}…

It was shown by Lubotzky in 2014 that automorphism invariant subsets of finite simple groups which contain identity are always word images. In this article, we study word maps on finite nilpotent groups and show that for arbitrary finite…

We investigate the intersection problem for finite semigroups, which asks for a given set of regular languages, represented by recognizing morphisms to finite semigroups, whether there exists a word contained in their intersection. We…

In this paper we define a quantity called the rank of an outer automorphism of a free group which is the same as the index introduced in [D. Gaboriau, A. Jaeger, G. Levitt and M. Lustig, `An index for counting fixed points for automorphisms…

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 membership problems in HNN extensions of free groups and then apply these results to solve the word problem in certain families of one-relator inverse monoids. In more detail, we consider HNN extensions where the defining…

In recent work, Rosenbaum and Wagner showed that isomorphism of explicitly listed $p$-groups of order $n$ could be tested in $n^{\frac{1}{2}\log_p n + O(p)}$ time, roughly a square root of the classical bound. The $O(p)$ term is entirely…

We derive a formula connecting the orders of the automorphism groups of a finite group and of its covering groups.

We introduce a recursive method to deconstruct the automorphism group of an ordered set. By connecting this method with deep results for permutation groups, we prove the Automorphism Conjecture for ordered sets of width less than or equal…

Grothendieck proved that any finite epimorphism of noetherian schemes factors into a finite sequence of effective epimorphisms. We define the complexity of a flat groupoid $R\rightrightarrows X$ with finite stabilizer to be the length of…

We show that the membership problem in a finitely generated submonoid of a graph group (also called a right-angled Artin group or a free partially commutative group) is decidable if and only if the independence graph (commutation graph) is…