SearcharxivSearch

arXiv subjects

Monika Kudlinska

Publications and source records attributed to Monika Kudlinska.

12 recordsLinked to original sources

Thurston norm, polytopes and splitting complexity

Let $G$ be a finitely generated torsion-free group satisfying the Strong Atiyah Conjecture. Assuming that $b_1^{(2)}(G)=0$, we associate to each surjective integral character $\phi$ the quantity $b_1^{(2)}(\ker \phi)$. We prove that the resulting function extends to a seminorm on $H^1(G;\mathbb{R})$ and is the thickness function of a polytope in $H_1(G;\mathbb{R})$. More generally, assuming that $G$ is of type $\mathrm{FP}_k(\mathbb{Q})$ and has $b_k^{(2)}(G)=0$, we prove that the function assigning $b_k^{(2)}(\ker \phi)$ to each surjective integral character $\phi$ is likewise the thickness function of a polytope. This confirms a conjecture of Friedl, L\"uck, and Tillmann. For torsion-free virtually (finitely generated free)-by-cyclic groups, we relate the resulting invariant to the $L^2$-Betti complexity of a character, thereby confirming a conjecture of Gardam and Kielak. As an application, we establish the existence of an algorithm for computing the Bieri--Neumann--Strebel invariant of free-by-cyclic groups and discuss connections with the isomorphism problem for such groups.

math.GR

Largest acylindrical actions of free-by-cyclic groups

We show that every finitely generated free-by-cyclic group $G$ admits a largest acylindrical action on a hyperbolic space $X$ obtained by coning off maximal product subgroups of $G$. We characterise Morse geodesics of $G$ as those that project to quasigeodesics in $X$, thus showing that all finitely generated free-by-cyclic groups are Morse local-to-global. We also characterise the stable and strongly quasiconvex subgroups of $G$. Finally, we compute the Morse boundary for \{finitely generated free\}-by-cyclic groups with unipotent and polynomially growing monodromy.

math.GR

Free-by-cyclic groups are conjugacy separable

We show that all finitely generated free-by-cyclic groups are conjugacy separable: if a finitely generated group $G$ surjects onto $\mathbb{Z}$ with free kernel, then for every pair of non-conjugate elements $g,h\in G$, there exists a finite quotient $\alpha:G\twoheadrightarrow Q$ such that $\alpha(g)$ is not conjugate to $\alpha(h)$. This resolves Question 19.41 of the Kourovka Notebook. We apply this to prove that the outer automorphism group of a finitely generated free-by-cyclic group is residually finite. Along the way we prove that if the monodromy of a {finitely generated free}-by-cyclic group is polynomially growing, then the double cosets of a cyclic subgroup are separable. Our approach combines vertex fillings in graph-of-groups decompositions, and Dehn fillings in relatively hyperbolic groups, according to the different geometric regimes in free-by-cyclic groups.

math.GR

Thurston norm for coherent right-angled Artin groups via $L^2$-invariants

We define a new notion of splitting complexity for a group $G$ along a non-trivial integral character $\phi \in H^1(G; \mathbb{Z})$. If $G$ is a one-ended coherent right-angled Artin group, we show that the splitting complexity along an epimorphism $\phi \colon G \to \mathbb{Z}$ equals the $L^2$-Euler characteristic of the kernel of $\phi$. This allows us to define a Thurston-type semi-norm $\| \cdot \|_T \colon H^1(G ; \mathbb{R}) \to \mathbb{R}$ that measures the splitting complexity of integral characters. Our main tool is Friedl--L\"{u}ck's $L^2$-polytope.

math.GR

Free-by-cyclic groups are equationally Noetherian

A group $G$ is said to be equationally Noetherian if every system of equations in $G$ is equivalent to a finite subsystem. We show that all free-by-cyclic groups are equationally Noetherian. As a corollary, we deduce that the set of exponential growth rates of a free-by-cyclic group is well ordered. Along the way, we prove that free-by-cyclic groups with polynomially growing monodromies of infinite order admit non-elementary 4-acylindrical actions on trees. We show that the splittings arising from the improved relative train track machinery of Bestvina-Feighn-Handel are 2-acylindrical when the growth is at least quadratic.

math.GR

An infinite family of exotic subgroups of hyperbolic groups

We construct the first known infinite family of quasi-isometry classes of subgroups of hyperbolic groups which are not hyperbolic and are of type $\mathrm{FP}(\mathbb{Q})$. We give a simple criterion for producing many non-hyperbolic subgroups of hyperbolic groups with strong finiteness properties. We also observe that local hyperbolicity and algebraic fibring are mutually exclusive in higher dimensions.

math.GR

On subgroup separability of free-by-cyclic and deficiency 1 groups

We show that a free-by-cyclic group with a polynomially growing monodromy is subgroup separable exactly when it is virtually $F_n \times \mathbb{Z}$. We also prove that random deficiency 1 groups are not subgroup separable with positive asymptotic probability.

math.GR

Stallings's Fibring Theorem and $\mathrm{PD}^3$-pairs

We give a relatively self-contained proof that if a group $G$ fibres algebraically and is part of a $\mathrm{PD}^3$-pair, then $G$ is the fundamental group of a fibred compact aspherical 3-manifold. This yields a homological proof of a classical theorem of Stallings: if $G = \pi_1(M^3)$ is the fundamental group of a compact irreducible 3-manifold $M^3$ and $\phi \colon G \to \mathbb{Z}$ is a surjective homomorphism with finitely generated kernel, then $\phi$ is induced by a topological fibration of $M^3$ over the circle.

math.GT

Homology growth of polynomially growing mapping tori

We prove that residually finite mapping tori of polynomially growing automorphisms of hyperbolic groups, groups hyperbolic relative to finitely many virtually polycyclic groups, right-angled Artin groups (when the automorphism is untwisted), and right-angled Coxeter groups have the cheap rebuilding property of Abert, Bergeron, Fraczyk, and Gaboriau. In particular, their torsion homology growth vanishes for every Farber sequence in every degree.

math.GR

On profinite rigidity amongst free-by-cyclic groups I: the generic case

We prove that amongst the class of free-by-cyclic groups, Gromov hyperbolicity is an invariant of the profinite completion. We show that whenever $G$ is a free-by-cyclic group with first Betti number equal to one, and $H$ is a free-by-cyclic group which is profinitely isomorphic to $G$, the ranks of the fibres and the characteristic polynomials associated to the monodromies of $G$ and $H$ are equal. We further show that for hyperbolic free-by-cyclic groups with first Betti number equal to one, the stretch factors of the associated monodromy and its inverse is an invariant of the profinite completion. We deduce that irreducible free-by-cyclic groups with first Betti number equal to one are almost profinitely rigid amongst irreducible free-by-cyclic groups. We use this to prove that generic free-by-cyclic groups are almost profinitely rigid amongst free-by-cyclic groups. We also show a similar results for {universal Coxeter}-by-cyclic groups.

math.GR

Torsion homology growth of polynomially growing free-by-cyclic groups

We show that the homology torsion growth of a free-by-cyclic group with polynomially growing monodromy vanishes in every dimension independently of the choice of Farber chain. It follows that the integral torsion $\rho^\mathbb{Z}$ equals the $\ell^2$-torsion $\rho^{(2)}$ verifying a conjecture of L\"uck for these groups.

math.GR

Algorithm for filling curves on surfaces

Let $Σ$ be a compact, orientable surface of negative Euler characteristic, and let $h$ be a complete hyperbolic metric on $Σ$. A geodesic curve $γ$ in $Σ$ is filling, if it cuts the surface into topological disks and annuli. We propose an efficient algorithm for deciding whether a geodesic curve, represented as a word in some generators of $π_1(Σ)$, is filling. In the process, we find an explicit bound for the combinatorial length of a curve given by its Dehn-Thurston coordinate, in terms of the hyperbolic length. This gives us an efficient method for producing a collection which is guaranteed to contain all words corresponding to simple geodesics of bounded hyperbolic length.

math.GT