Searcharxiv⌕ Search

arXiv subjects

Annette Karrer

Publications and source records attributed to Annette Karrer.

10 recordsLinked to original sources
arXiv2025

RAAGedy right-angled Coxeter groups

We give criteria for deciding whether or not a triangle-free simple graph is the presentation graph of a right-angled Coxeter group that is quasiisometric to some right-angled Artin group, and, if so, producing a presentation graph for such a right-angled Artin group. We introduce two new graph modification operations, cloning and unfolding, to go along with an existing operation called link doubling. These operations change the presentation graph but not the quasiisometry type of the resulting group. We give criteria on the graph that imply it can be transformed by these operations into a graph that is recognizable as presenting a right-angled Coxeter group commensurable to a right-angled Artin group. In the converse direction we derive coarse geometric obstructions to being quasiisometric to a right-angled Artin group, first by specializing existing results from the literature to this setting, then by developing new approaches using configurations of maximal product regions. In all cases we give sufficient graphical conditions that imply these geometric obstructions. We implemented our criteria on a computer and applied them to an enumeration of small graphs. Our methods completely answer the motiving question when the graph has at most 10 vertices.

math.GR↗
arXiv2024

Subgroups arising from connected components in the Morse boundary

We study connected components of the Morse boundary and their stabilisers. We introduce the notion of point-convergence and show that if the set of non-singleton connected components of the Morse boundary of a finitely generated group $G$ is point-convergent, then every non-singleton connected component is the (relative) Morse boundary of its stabiliser. The above property only depends on the topology of the Morse boundary and hence is invariant under quasi-isometry. This shows that the topology of the Morse boundary not only carries algebraic information but can be used to detect certain subgroups which in some sense are invariant under quasi-isometry.

math.GR↗
arXiv2023

On the \v{C}ech cohomology of Morse boundaries

We consider cusped hyperbolic $n-$manifolds, and compute \v{C}ech cohomology groups of the Morse boundaries of their fundamental groups. In particular, we show that the reduced \v{C}ech cohomology with real coefficients vanishes in dimension at most $n-3$ and does not vanish in dimension $n-2$. A similar result holds for relatively hyperbolic groups with virtually nilpotent peripherals and Bowditch boundary homeomorphic to a sphere; these include all non-uniform lattices in rank$-1$ simple Lie groups.

math.GR↗
arXiv2023

The boundary rigidity of lattices in products of trees

We show that every group acting freely and vertex-transitively by isometries on a product of two regular trees of finite valence is boundary rigid. That means that every CAT(0) space that admits a geometric action of any such group has the visual boundary homeomorphic to a join of two copies of the Cantor set.

math.GR↗
arXiv2022

Connected components of Morse boundaries of graphs of groups

Let a finitely generated group $G$ split as a graph of groups. If edge groups are undistorted and do not contribute to the Morse boundary $\partial_MG$, we show that every connected component of $\partial_MG$ with at least two points originates from the Morse boundary of a vertex group. Under stronger assumptions on the edge groups (such as wideness in the sense of Druţu-Sapir), we show that Morse boundaries of vertex groups are topologically embedded in $\partial_MG$.

math.GR↗
arXiv2021

Right-angled Coxeter groups with totally disconnected Morse boundaries

This paper introduces a new class of right-angled Coxeter groups with totally disconnected Morse boundaries. We construct this class recursively by examining how the Morse boundary of a right-angled Coxeter group changes if we glue a graph to its defining graph. More generally, we present a method to construct amalgamated free products of CAT(0) groups with totally disconnected Morse boundaries that act geometrically on CAT(0) spaces that have a treelike block decomposition.

math.GT↗
arXiv2020

The triangle groups (2,4,5) and (2,5,5) are not systolic

In this paper we provide new examples of hyperbolic but nonsystolic groups by showing that the triangle groups $(2,4,5)$ and $(2,5,5)$ are not systolic. Along the way we prove some results about subsets of systolic complexes stable under involutions.

math.GR↗
arXiv2016

High girth hypergraphs with unavoidable monochromatic or rainbow edges

A classical result of Erdős and Hajnal claims that for any integers $k, r, g \geq 2$ there is an $r$-uniform hypergraph of girth at least $g$ with chromatic number at least $k$. This implies that there are sparse hypergraphs such that in any coloring of their vertices with at most $k-1$ colors there is a monochromatic hyperedge. We show that for any integers $r, g\geq 2$ there is an $r$-uniform hypergraph of girth at least $g$ such that in any coloring of its vertices there is either a monochromatic or a rainbow (totally multicolored) edge. We give a probabilistic and a deterministic proof of this result.

math.CO↗
arXiv2015

Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices

A simultaneous embedding (with fixed edges) of two graphs $G^1$ and $G^2$ with common graph $G=G^1 \cap G^2$ is a pair of planar drawings of $G^1$ and $G^2$ that coincide on $G$. It is an open question whether there is a polynomial-time algorithm that decides whether two graphs admit a simultaneous embedding (problem SEFE). In this paper, we present two results. First, a set of three linear-time preprocessing algorithms that remove certain substructures from a given SEFE instance, producing a set of equivalent SEFE instances without such substructures. The structures we can remove are (1) cutvertices of the union graph $G^\cup = G^1 \cup G^2$, (2) most separating pairs of $G^\cup$, and (3) connected components of $G$ that are biconnected but not a cycle. Second, we give an $O(n^3)$-time algorithm solving SEFE for instances with the following restriction. Let $u$ be a pole of a P-node $μ$ in the SPQR-tree of a block of $G^1$ or $G^2$. Then at most three virtual edges of $μ$ may contain common edges incident to $u$. All algorithms extend to the sunflower case, i.e., to the case of more than three graphs pairwise intersecting in the same common graph.

cs.DS↗