Related papers: Frucht's Theorem without Choice

We study the automorphisms \phi of a finitely generated free group F. Building on the train-track technology of Bestvina, Feighn and Handel, we provide a topological representative f:G\to G of a power of \phi that behaves very much like the…

The theory ZFC implies the scheme that for every cardinal $\delta$ we can make $\delta$ many dependent choices over any definable relation without terminal nodes. Friedman, the first author, and Kanovei constructed a model of ZFC$^-$ (ZFC…

We prove that every simplicial automorphism of the free splitting graph of a free group of at least rank 3 is induced by an outer automorphism of the free group.

We give a short proof of a theorem of Handel and Mosher stating that any finitely generated subgroup of $\text{Out}(F_N)$ either contains a fully irreducible automorphism, or virtually fixes the conjugacy class of a proper free factor of…

Let $p$ be a prime number. A longstanding conjecture asserts that every finite non-abelian $p$-group has a non-inner automorphism of order $p$. In this paper, we prove that if $G$ is an odd order finite non-abelian monolithic $p$-group such…

We answer a question of Bartholdi, Siegenthaler and Zalesskii, showing that the congruence subgroup problem for branch groups is independent of the branch action on a tree. We prove that the congruence topology of a branch group is…

We show that the theory ZFC-, consisting of the usual axioms of ZFC but with the power set axiom removed-specifically axiomatized by extensionality, foundation, pairing, union, infinity, separation, replacement and the assertion that every…

A detailed proof is given of a theorem describing the centraliser of a transitive permutation group, with applications to automorphism groups of objects in various categories of maps, hypermaps, dessins, polytopes and covering spaces, where…

We prove that the isomorphism problem for finitely generated fully residually free groups is decidable. We also show that each finitely generated fully residually free group G has a decomposition that is invariant under automorphisms of G,…

In this article, we give an elementary combinatorial proof of a conjecture about the determination of automorphism group of the power graph of finite cyclic groups, proposed by Doostabadi, Erfanian and Jafarzadeh in 2013.

By using a notion of a geometric Dehn twist in $\sharp_k(S^2 \times S^1)$, we prove that when projections of two $\mathbb{Z}$-splittings to the free factor complex are far enough from each other in the free factor complex, Dehn twist…

This paper studies automorphisms and monomorphisms of direct products $\Gamma=\Gamma_1\times\cdots\times\Gamma_r$ of finitely generated virtually solvable minimax groups, a class containing all virtually polycyclic groups. Under an…

The classical de Finetti theorem in probability theory relates symmetry under the permutation group with the independence of random variables. This result has application in quantum information. Here we study states that are invariant with…

We study the automorphism group $\operatorname{Aut}(X)$ of a non-trivial strongly irreducible subshift $X$ on an arbitrary infinite group $G$ and generalize classical results of Ryan, Kim and Roush. We generalize Ryan's theorem by showing…

For every positive integer $n$, we construct, using algebraic groups, an infinite family of irreducible algebraic varieties $X$,whose automorphism group ${\rm Aut}(X)$ contains the automorphism group ${\rm Aut}(F_n)$ of a free group $F_n$…

The notion of the quantum automorphism group of a graph was introduced by J. Bichon in 2003 and T. Banica in 2005 respectively. This article explores primarily the quantum automorphism group of a graph $\Gamma$, denoted by…

We show that it is consistent with ZFC that every compact group has a non-Haar-measurable subgroup. In addition, we demonstrate a natural construction, and we conjecture that this construction always produces a non-measurable subgroup of a…

The goal of this paper is twofold. In addition to the results stated in the next paragraph, we present some classical results on absoluteness relevant to functional analysis that are well known to logicians but not nearly as well advertised…

This paper proves a conjecture generated by the artificial intelligence conjecturing program called \emph{TxGraffiti}. More specifically, we show that if $G$ is a connected, cubic, and claw-free graph, then $Z(G) \le \gamma(G) + 2$, where…

We prove that the set of subgroups of the automorphism group of a two-sided full shift is closed under countable graph products. We introduce the notion of a group action without $A$-cancellation (for an abelian group $A$), and show that…