Related papers: Immersed cycles and the JSJ decomposition

A seminal result in geometric group theory is that a 1-ended hyperbolic group has a locally connected visual boundary. As a consequence, a 1-ended hyperbolic group also has a path connected visual boundary. In this paper, we study when this…

We prove that the fundamental group of a finite graph of convergence groups with parabolic edge groups is a convergence group. Using this result, under some mild assumptions, we prove a combination theorem for a graph of convergence groups…

Functional graphs (FGs) model the graph structures used to analyse the behaviour of functions from a discrete set to itself. In turn, such functions are used to study real complex phenomena evolving in time. As the systems involved can be…

We algebraically characterize free by cyclic groups that have coarse medians, and prove that this is equivalent to the a priori stronger properties of being colourable hierarchically hyperbolic groups and being quasi-isometric to CAT(0)…

Let $F$ be a finitely generated free group. We present an algorithm such that, given a subgroup $H\leqslant F$, decides whether $H$ is the fixed subgroup of some family of automorphisms, or family of endomorphisms of $F$ and, in the…

We provide a polynomial time algorithm to determine a cubic bipartite graph has a hamilton cycle or not.

Let $G$ be a finite solvable group, given through a refined consistent polycyclic presentation, and $\alpha$ an automorphism of $G$, given through its images of the generators of $G$. In this paper, we discuss algorithms for computing the…

Inspired by the study of loose cycles in hypergraphs, we define the \emph{loose core} in hypergraphs as a structure which mirrors the close relationship between cycles and $2$-cores in graphs. We prove that in the $r$-uniform binomial…

We give an example of two JSJ decompositions of a group that are not related by conjugation, conjugation of edge-inclusions, and slide moves. This answers the question of Rips and Sela stated in "Cyclic splittings of finitely presented…

Let $V$ be a finite graph and let $\phi:V\rightarrow V$ be an irreducible train track map whose mapping torus has word-hyperbolic fundamental group $G$. Then $G$ acts freely and cocompactly on a CAT(0) cube complex.

We call a graph $k$-geodetic, for some $k\geq 1$, if it is connected and between any two vertices there are at most $k$ geodesics. It is shown that any hyperbolic group with a $k$-geodetic Cayley graph is virtually-free. Furthermore, in…

We recall several known results about minimally 2-connected graphs, and show that they all follow from a decomposition theorem. Starting from an analogy with critically 2-connected graphs, we give structural characterizations of the classes…

Using graph of groups decompositions of finitely generated groups, we define Euler characteristic type invariants which are non-zero in many interesting classes of finitely presented, hyperbolic, limit and CSA groups, including elementarily…

We study the design of robust subexponential algorithms for classical connectivity problems on intersection graphs of similarly sized fat objects in $\mathbb{R}^d$. In this setting, each vertex corresponds to a geometric object, and two…

Hierarchical clustering is a fundamental machine-learning technique for grouping data points into dendrograms. However, existing hierarchical clustering methods encounter two primary challenges: 1) Most methods specify dendrograms without a…

A mixture of joint generalized hyperbolic distributions (MJGHD) is introduced for asymmetric clustering for high-dimensional data. The MJGHD approach takes into account the cluster-specific subspace, thereby limiting the number of…

A Hamiltonian decomposition of a regular graph is a partition of its edge set into Hamiltonian cycles. The problem of finding edge-disjoint Hamiltonian cycles in a given regular graph has many applications in combinatorial optimization and…

A new method is given for computing generators of the homology groups with integer coefficients for any finite $T_0$-space. An important role in this method is played by irreducible cycles which are defined here and give rise to continuous…

We present an algorithm for the following problem: given a context-free grammar for the word problem of a virtually free group $G$, compute a finite graph of groups $\mathcal{G}$ with finite vertex groups and fundamental group $G$. Our…

A well known question of Gromov asks whether every one-ended hyperbolic group $\Gamma$ has a surface subgroup. We give a positive answer when $\Gamma$ is the fundamental group of a graph of free groups with cyclic edge groups. As a result,…