Related papers: Immersed cycles and the JSJ decomposition

We establish a combination theorem for parafree groups. These groups were introduced by Baumslag in the sixties. One of the current motivations for a better understanding of their structure is that they show up naturally in connection with…

We find estimates for the restriction of automorphic forms on hyperbolic manifolds to compact geodesic cycles. The geodesic cycles we study are themselves hyperbolic manifolds of lower dimension. The restriction of an automorphic form to…

This paper deals with left invertibility problem of implicit hyperbolic systems with delays in infinite dimensional Hilbert spaces. From a decomposition procedure, invertibility for this class of systems is shown to be equivalent to the…

We show that if a group is not virtually cyclic and is hyperbolic relative to a family of proper subgroups, then it has a hyperbolically embedded subgroup which contains a finitely generated non-abelian free group as a finite index…

We show that $k$-uniform hypergraphs on $n$ vertices whose codegree is at least $(2/3 + o(1))n$ can be decomposed into tight cycles, subject to the trivial divisibility conditions. As a corollary, we show those graphs contain tight Euler…

We suggest a new approach to the study of relatively hyperbolic groups based on relative isoperimetric inequalities. Various geometric, algebraic, and algorithmic properties are discussed.

The framework of joint typical periodic optimization, in which both the dynamical system and the potential function are allowed to vary simultaneously, was introduced in [HHJL25], in a direction motivated by the work of Yang, Hunt & Ott…

De Berg et al. in [SICOMP 2020] gave an algorithmic framework for subexponential algorithms on geometric graphs with tight (up to ETH) running times. This framework is based on dynamic programming on graphs of weighted treewidth resulting…

We explicitly construct new subgroups of the mapping class groups of an uncountable collection of infinite-type surfaces, including, but not limited to, free groups, Baumslag-Solitar groups, mapping class groups of other surfaces, and a…

Let G be a word-hyperbolic group, obtained as a graph of free groups amalgamated along cyclic subgroups. If H_2(G;Q) is nonzero, then G contains a closed hyperbolic surface subgroup. Moreover, the unit ball of the Gromov-Thurston norm on…

We give algorithms with running time $2^{O({\sqrt{k}\log{k}})} \cdot n^{O(1)}$ for the following problems. Given an $n$-vertex unit disk graph $G$ and an integer $k$, decide whether $G$ contains (1) a path on exactly/at least $k$ vertices,…

We propose a modular, data-driven framework for jointly learning unknown functional mappings and discovering the underlying one-parameter symmetry subgroup governing the data. Unlike conventional geometric deep learning methods that assume…

In this paper, we consider the Cycle Packing problem on unit disk graphs defined as follows. Given a unit disk graph G with n vertices and an integer k, the goal is to find a set of $k$ vertex-disjoint cycles of G if it exists. Our…

We consider splittings of groups over finite and two-ended subgroups. We study the combinatorics of such splittings using generalisations of Whitehead graphs. In the case of hyperbolic groups, we relate this to the topology of the boundary.…

An algorithm for irreducible decomposition of representations of finite groups over fields of characteristic zero is described. The algorithm uses the fact that the decomposition induces a partition of the invariant inner product into a…

Obtaining continuous representations of structural data such as directed acyclic graphs (DAGs) has gained attention in machine learning and artificial intelligence. However, embedding complex DAGs in which both ancestors and descendants of…

Let $ \text{Mod}(S_g)$ denote the mapping class group of the closed orientable surface $S_g$ of genus $g\geq 2$, and let $f\in \text{Mod}(S_g)$ be of finite order. We give an inductive procedure to construct an explicit hyperbolic structure…

We give a sufficient condition under which the fundamental group of a reglued graph of surfaces is hyperbolic. A reglued graph of surfaces is constructed by cutting a fixed graph of surfaces along the edge surfaces, then regluing by…

Motivated by the study of the conjugacy problem for outer automorphism of free groups, we develop the algorithmic theory of the free-by-cyclic group produced by unipotent linearly growing automorphisms of f.g. free groups. We compute…

The goal of this paper is to exhibit and analyze an algorithm that takes a given closed orientable hyperbolic surface and outputs an explicit Dirichlet domain. The input is a fundamental polygon with side pairings. While grounded in…