Related papers: Generic properties of Whitehead's Algorithm and is…
In this article we generalize a theorem of Benson for generalized quadrangles to strongly regular graphs and directed strongly regular graphs. The main result provides numerical restrictions on the number of fixed vertices and the number of…
We prove that no quantifier-free formula in the language of group theory can define the $\aleph_1$-half graph in a Polish group, thus generalising some results from [6]. We then pose some questions on the space of groups of automorphisms of…
We investigate subgroups of the group PLo(I) of piecewise-linear, orientation-preserving homeomorphisms of the unit interval with finitely many breaks in slope, under the operation of composition, and also subgroups of the generalized…
We give a simpler proof using automata theory of a recent result of Kapovich, Weidmann and Myasnikov according to which so-called benign graphs of groups preserve decidability of the generalized word problem. These include graphs of groups…
We investigate the relationship between various isomorphism invariants for finite groups. Specifically, we use the Weisfeiler-Leman dimension (WL) to characterize, compare and quantify the effectiveness and complexity of invariants for…
We show that the Word Problem in finitely generated subgroups of $\textsf{GL}_d(\mathbb{Z})$ can be solved in linear average-case complexity. This is done under the bit-complexity model, which accounts for the fact that large integers are…
Let $M$ be a compact, connected manifold of positive dimension and let $\mathcal G\leq\textrm{Homeo}(M)$ be \emph{locally approximating} in the sense that for all open $U\subseteq M$ compactly contained in a single Euclidean chart of $M$,…
This paper studies the rigidity properties of the abstract commensurator of the outer automorphism group of a universal Coxeter group of rank $n$, which is the free product $W_n$ of $n$ copies of $\mathbb{Z}/2\mathbb{Z}$. We prove that for…
We show that there is a dense set $\ourset\subseteq \mathbb{N}$ of group orders and a constant $c$ such that for every $n\in \ourset$ we can decide in time $O(n^2(\log n)^c)$ whether two $n\times n$ multiplication tables describe isomorphic…
We study fundamental groups of clique complexes associated to random graphs. We establish thresholds for their cohomological and geometric dimension and torsion. We also show that in certain regime any aspherical subcomplex of a random…
We study direct products of free-abelian and free groups with special emphasis on algorithmic problems. After giving natural extensions of standard notions into that family, we find an explicit expression for an arbitrary endomorphism of…
We prove that one-relator groups with negative immersions are hyperbolic and virtually special; this resolves a recent conjecture of Louder and Wilton. As a consequence, one-relator groups with negative immersions are residually finite,…
We estimate the number of graphical regular representations (GRRs) of a given group with large enough order. As a consequence, we show that almost all finite Cayley graphs have full automorphism groups 'as small as possible'. This confirms…
Examples of (strongly continuous) one-parameter groups of automorphisms of UHF C*-algebras are given. One example has the property that the infinitesimal generator does not have a union of finite-dimensional subalgebras as a core. (This…
Two groups are virtually isomorphic if they can be obtained one from the other via a finite number of steps, where each step consists in taking a finite extension or a finite index subgroup (or viceversa). Virtually isomorphic groups are…
We study the automorphism group of a unital, simple, $\mathcal{Z}$-stable $C^{*}$-algebra. In this paper, we generalize the results by the authors in \cite{pr_auto} to $\mathcal{Z}$-stable $C^{*}$-algebras $\mathfrak{A}$ such that…
The lattice of subgroups of a group is the subject of numerous results revolving around the central theme of decomposing the group into "chunks" (subquotients) that can then be compared to one another in various ways. Examples of results in…
We introduce the first provably efficient algorithm to check if a finitely generated subgroup of an almost simple semi-simple group over the rationals is Zariski-dense. We reduce this question to one of computing Galois groups, and to this…
We classify up to isomorphism the quantum generalized Weyl algebras and determine their automorphism groups in all cases in a uniform way, including those where the parameter q is a root of unity, thereby completing the results obtained by…
A graphs of rank n (homotopy equivalent to a wedge of n circles) without ``separating edges'' has a canonical n-dimensional compact C^1 manifold thickening. This implies that the canonical homomorphism f:Out(F_n)-> GL(n,Z) is trivial in…