Related papers: Girth Alternative for HNN Extensions
We undertake a study of extensions of unirational algebraic groups. We prove that extensions of unirational groups are also unirational over fields of degree of imperfection $1$, but that this fails over every field of higher degree of…
We show that an HNN-extension with finitely generated abelian base group is Z-linear if and only if it is residually finite.
We prove an accessibility result for finitely generated groups that combines Sela's acylindrical accessibility with Linell accessibility.
An Artin HNN-extension is an HNN-extension of an Artin group in which the stable letter conjugates a pair of suitably chosen subsets of the standard generating set. We show that some finite index subgroup of an Artin HNN-extension embeds in…
We define the Homomorphism Extension (HomExt) problem: given a group $G$, a subgroup $M \leq G$ and a homomorphism $\varphi: M \to H$, decide whether or not there exists a homomorphism $\widetilde{\varphi}: G\to H$ extending $\varphi$,…
We introduce the notion of a probabilistic identity of a residually finite group. We prove that a finitely generated linear group satisfies a probabilistic identity if and only if it is virtually solvable. As an application, we prove a…
Semistability at infinity is an asymptotic property of finitely presented groups that is needed in order to effectively define the fundamental group at infinity for a 1-ended group. It is an open problem whether or not all finitely…
We prove that the group property of being $\mathcal{H}-$ and $\mathcal{AH}-$accessible is preserved under finite extensions.
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…
In this paper, we deal with reversing and extended symmetries of shifts generated by bijective substitutions. We provide equivalent conditions for a permutation on the alphabet to generate a reversing/extended symmetry, and algorithms how…
A geometric argument is given to prove that the Seifert genus of a positive knot equals its slice genus. A combinatorial invariant, giving a lower bound for the slice genus, is formulated for arbitrary knots. Properties and applications of…
We prove that a dense subgroup of $\mathrm{Homeo}_{+}(I)$ is not elementary amenable. We also show that the topological group $\mathrm{Homeo}_{+}(I)$ does not satisfy the Stability of the Generators Property, moreover, any finitely…
We study on finite unramified extensions of global function fields (function fields of one valuable over a finite field). We show two results. One is an extension of Perret's result about the ideal class group problem. Another is a…
We present an algorithm that decides whether a finitely generated linear group over an infinite field is solvable-by-finite: a computationally effective version of the Tits alternative. We also give algorithms to decide whether the group is…
The following refinement of the Higman embedding theorem is proved: A finitely generated group $R$ is recursively presented if and only if there exists a quasi-isometric malnormal embedding of $R$ into a finitely presented group $H$ such…
We construct a finitely generated group which is an extension of two finitely generated groups coarsely embeddable into Hilbert space but which itself does not coarsely embed into Hilbert space. Our construction also provides a new infinite…
Hilbert's 14th problem studies the finite generation property of the intersection of an integral algebra of finite type with a subfield of the field of fractions of the algebra. It has a negative answer due to the counterexample of Nagata.…
We study and compare different Graph Neural Network extensions that increase the expressive power of GNNs beyond the Weisfeiler-Leman test. We focus on (i) GNNs based on higher order WL methods, (ii) GNNs that preprocess small substructures…
In this article we show how Gr\"un's results in group theory can be used for studying the structure of class groups in normal extensions.
We prove necessary and sufficient conditions on a family of (generalised) gridding matrices to determine when the corresponding permutation classes are partially well-ordered. One direction requires an application of Higman's Theorem and…