arXiv subjects
Publications and source records attributed to Dario Ascari.
The isomorphism problem for generalized Baumslag-Solitar (GBS) groups is a long-standing open problem. We prove that, in the random model considered here, a GBS graph with many edges is flexible with high probability. Since the isomorphism problem is decidable for flexible GBS graphs, this gives a high-probability decidability result for random GBS groups in this regime.
Let $G$ be a hyperbolic group that splits as a graph of free groups with cyclic edge groups, and which is not isomorphic to a free product of free and surface groups. We show that $G$ admits an exhausting, nested sequence of finite-index non-normal subgroups $G\ge G_1 \ge G_2 \ge \cdots$ with exponential homological torsion growth. More specifically, we prove that simultaneously for every prime $p$, $\liminf_{n\rightarrow \infty} \frac{\log \vert \mathrm{Tor}_p(G_n^{\mathrm{ab}})\vert}{[G:G_n]} >0$ (where $\mathrm{Tor}_p(G_n^{\mathrm{ab}}) = \{g \in G_n^{\mathrm{ab}} \;\vert\; g \text{ has order a power of } p\}$).
We introduce a new isomorphism invariant for generalized Baumslag-Solitar (GBS) groups, which we call the limit angle. Unlike previously known invariants, which are primarily algebraic, the limit angle admits a dynamical interpretation, arising exclusively in the case of two interacting edges. This invariant captures subtle geometric behavior that does not manifest in configurations with more interacting edges. As an application, we use the limit angle to obtain a classification of GBS groups with one vertex and two edges.
We prove that the isomorphism problem is decidable for generalized Baumslag-Solitar (GBS) groups with one quasi-conjugacy class and full support gaps. In order to do so we introduce a family of invariants that fully characterize the isomorphism within this class of GBSs.
We introduce two new moves on graphs of groups with cyclic edge groups that preserve the fundamental group. These moves allow us to address the isomorphism problem without the use of expansions, therefore keeping the number of vertices and edges constant along sequences of moves witnessing an isomorphism between two groups. We further show that the isomorphism problem for a large family of cyclic JSJ decompositions reduces to the case of generalized Baumslag-Solitar groups (GBS), and that among GBSs, it suffices to consider one-vertex graphs. As an application of the methods, we solve the isomorphism problem for a broad class of flexible GBSs. Finally, we discuss potential further applications of our techniques.
We describe the outer automorphism group of a one-ended fundamental group of a graph of groups, when edge groups are cyclic, and vertex groups are torsion-free with cyclic centralizers. We show that in this case the outer automorphism group is virtually built from the outer automorphisms of the vertex groups (fixing some elements), the outer automorphisms of some associated generalized Baumslag-Solitar groups, and generalized twists - partial conjugations by elements in the centralizers of some elliptic elements in the group.
Let $G$ be a hyperbolic group that splits as a graph of free groups with cyclic edge groups. We prove that, unless $G$ is isomorphic to a free product of free and surface groups, every finite abelian group $M$ appears as a direct summand in the abelianization of some finite-index subgroup $G'\le G$. As an application, we deduce that free products of free and surface groups are profinitely rigid among hyperbolic graphs of free groups with cyclic edge groups. We also conclude that partial surface words in a free group are determined by the word measures they induce on finite groups.
We prove that the Bridson-Dison group has quartic Dehn function, thereby providing the first precise computation of the Dehn function of a subgroup of a direct product of free groups with super-quadratic Dehn function. We also prove that coabelian subgroups of direct products of $n$ free groups of finiteness type $\mathcal{F}_{n-1}$ and of corank $r\leq n-2$ have quadratic Dehn functions.
Subgroups of direct products of finitely many finitely generated free groups form a natural class that plays an important role in geometric group theory. Its members include fundamental examples, such as the Stallings-Bieri groups. This raises the problem of understanding their geometric invariants. We prove that finitely presented subgroups of direct products of three free groups, as well as subgroups of finiteness type $\mathcal{F}_{n-1}$ in a direct product of $n$ free groups, have Dehn function bounded above by $N^9$. This gives a positive answer to a question of Dison within these important subclasses and provides new insights in the context of Bridson's conjecture stating that finitely presented subgroups of direct products of free groups have polynomially bounded Dehn function. To prove our results we generalise techniques for "pushing fillings" into normal subgroups.
We exhibit a finitely presented group whose second cohomology contains a weakly bounded, but not bounded, class. As an application, we disprove a long-standing conjecture of Gromov about bounded primitives of differential forms on universal covers of closed manifolds.
Let $F$ be a finitely generated free group, and let $H\le F$ be a finitely generated subgroup. An equation for an element $g\in F$ with coefficients in $H$ is an element $w(x)\in H*\langle x \rangle$ such that $w(g)=1$ in $F$; the degree of the equation is the number of occurrences of $x$ and $x^{-1}$ in the cyclic reduction of $w(x)$. Given an element $g\in F$, we consider the ideal $\mathfrak{I}_g\subseteq H*\langle x \rangle$ of equations for $g$ with coefficients in $H$; we study the structure of $\mathfrak{I}_g$ using context-free languages. We describe a new algorithm that determines whether $\mathfrak{I}_g$ is trivial or not; the algorithm runs in polynomial time. We also describe a polynomial-time algorithm that, given $d\in\mathbb{N}$, decides whether or not the subset $\mathfrak{I}_{g,d}\subseteq\mathfrak{I}_g$ of all degree-$d$ equations is empty. We provide a polynomial-time algorithm that computes the minimum degree $d_{\min}$ of a non-trivial equation in $\mathfrak{I}_g$. We provide a sharp upper bound on $d_{\min}$. Finally, we study the growth of the number of (cyclically reduced) equations in $\mathfrak{I}_g$ and in $\mathfrak{I}_{g,d}$ as a function of their length. We prove that this growth is either polynomial or exponential, and we provide a polynomial-time algorithm that computes the type of growth (including the degree of the growth if it's polynomial).
We provide an algorithm that, given a finite set of generators for a subgroup $H$ of a finitely generated free group $F$, determines whether $H$ is echelon or not and, in case of affirmative answer, also computes a basis with respect to which $H$ is in echelon form. This answers to a question of A. Rosenmann. We also prove, by means of a counterexample, that intersection of two echelon subgroups needs not to be echelon, answering to another question of A. Rosenmann.
Let $F$ be a finitely generated free group and let $H\le F$ be a finitely generated subgroup. Given an element $g\in F$, we study the ideal $\mathfrak{I}_g$ of equations for $g$ with coefficients in $H$, i.e. the elements $w(x)\in H*\langle x\rangle$ such that $w(g)=1$ in $F$. The ideal $\mathfrak{I}_g$ is a normal subgroup of $H*\langle x\rangle$, and we provide an algorithm, based on Stallings folding operations, to compute a finite set of generators for $\mathfrak{I}_g$ as a normal subgroup. We provide an algorithm to find an equation in $\mathfrak{I}_g$ with minimum degree, i.e. an equation $w(x)$ such that its cyclic reduction contains the minimum possible number of occurrences of $x$ and $x^{-1}$; this answers a question of A. Rosenmann and E. Ventura. More generally, we provide an algorithm that, given $d\in\mathbb{N}$, determines whether $\mathfrak{I}_g$ contains equations of degree $d$ or not, and we give a characterization of the set of all the equations of that specific degree. We define the set $D_g$ of all integers $d$ such that $\mathfrak{I}_g$ contains equations of degree $d$; we show that $D_g$ coincides, up to a finite set, either with the set of non-negative even numbers or with the set of natural numbers. Finally, we provide examples to illustrate the techniques introduces in this paper. We discuss the case where $\text{rank}(H)=1$. We prove that both kinds of sets $D_g$ can actually occur. The examples also show that the equations of minimum possible degree aren't in general enough to generate the whole ideal $\mathfrak{I}_g$ as a normal subgroup.
We develop a refinement of Whitehead's algorithm for primitive words in a free group. We generalize to subgroups, establishing a strengthened version of Whitehead's algorithm for free factors. We make use of these refinements in proving new results about primitive elements and free factors in a free group. These include a relative version of Whitehead's algorithm, and a criterion that tests whether a subgroup is a free factor just by looking at its primitive elements. We develop an algorithm to determine whether or not two vertices in the free factor complex have distance $d$ for $d=1,2,3$, as well as $d=4$ in a special case.