Related papers: Isometric Embeddings in Bounded Cohomology

We introduce the co-surface graph $\mathcal{CS}$ of a finitely generated free group $\mathbb{F}$ and use it to study the geometry of hyperbolic group extensions of $\mathbb{F}$. Among other things, we show that the Gromov boundary of the…

We compare the first Hochschild cohomology groups of finite dimensional monomial algebras under gluing two idempotents. We also compare the fundamental groups and the Hochschild cohomology groups in other degrees. In particular, we will…

Extended admissible groups belong to a particular class of graphs of groups that admit a decomposition generalizing those of non-geometric 3-manifold groups and Croke-Kleiner admissible groups. In this paper, we study several…

Taking the l^1-completion and the topological dual of the singular chain complex gives rise to l^1-homology and bounded cohomology respectively. In contrast to l^1-homology, major structural properties of bounded cohomology are well…

We show that for topological groups and loop contractible coefficients the cohomology groups of continuous group cochains and of group cochains that are continuous on some identity neighbourhood are isomorphic. Moreover, we show a similar…

A simple surface amalgam is the union of a finite collection of surfaces with precisely one boundary component each and which have their boundary curves identified. We prove if two fundamental groups of simple surface amalgams act properly…

The concept of graph flattenability, initially formalized by Belk and Connelly and later expanded by Sitharam and Willoughby, extends the question of embedding finite metric spaces into a given normed space. A finite simple graph $G=(V,E)$…

This paper considers *-graphs in which all vertices have degree 4 or 6, and studies the question of calculating the genus of orientable 2-surfaces into which such graphs may be embedded. A *-graph is a graph endowed with a formal adjacency…

A (possibly denerate) drawing of a graph $G$ in the plane is approximable by an embedding if it can be turned into an embedding by an arbitrarily small perturbation. We show that testing, whether a straight-line drawing of a planar graph…

We say that a metric graph is uniformly bounded if the degrees of all vertices are uniformly bounded and the lengths of edges are pinched between two positive constants; a metric space is approximable by a uniform graph if there is one…

We use category-theoretic techniques to provide two proofs showing that for a higher-rank graph $\Lambda$, its cubical (co-)homology and categorical (co-)homology groups are isomorphic in all degrees, thus answering a question of Kumjian,…

A connected subgraph of a graph is isometric if it preserves distances. In this short note, we provide counterexamples to several variants of the following general question: When a graph $G$ is edge covered by connected isometric subgraphs…

This paper introduces gluing diagrams a combinatorial tool to construct homomorphisms between the shift pseudogroups of directed graphs and thus also their full groups of shifts. We will establish which of these diagrams produce…

We describe a natural isomorphism between the set of equivalence classes of pseudocycles and the integral homology groups of a smooth manifold. Our arguments generalize to settings well-suited for applications in enumerative algebraic…

Coboundary expansion (with $\mathbb{F}_2$ coefficients), and variations on it, have been the focus of intensive research in the last two decades. It was used to study random complexes, property testing, and above all Gromov's topological…

The {\em topological symmetry group} of an embedding $\Gamma$ of an abstract graph $\gamma$ in $S^3$ is the group of automorphisms of $\gamma$ which can be realized by homeomorphisms of the pair $(S^3, \Gamma)$. These groups are motivated…

An arbitrary homomorphism between groups is nonincreasing for stable commutator length, and there are infinitely many (injective) homomorphisms between free groups which strictly decrease the stable commutator length of some elements.…

A digraph is connected-homogeneous if any isomorphism between finite connected induced subdigraphs extends to an automorphism of the digraph. We consider locally-finite connected-homogeneous digraphs with more than one end. In the case that…

Khovanov homology of a link and chromatic graph homology are known to be isomorphic in a range of homological gradings that depend on the girth of a graph. We discuss patterns shared by these two homology theories. In particular, we improve…

Using a probabilistic argument we show that the second bounded cohomology of an acylindrically hyperbolic group $G$ (e.g., a non-elementary hyperbolic or relatively hyperbolic group, non-exceptional mapping class group, ${\rm Out}(F_n)$,…