✦ LIBER ✦

Separability criterion for graph-manifold groups

✍ Scribed by Saburo Matsumoto

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 196 KB
Volume: 93
Category: Article
ISSN: 0166-8641
DOI: 10.1016/s0166-8641(97)00260-5

No coin nor oath required. For personal study only.

✦ Synopsis

Some recent work in the theory of 3-manifolds and immersed surfaces indicates that the class of graph manifolds contains a large number of compact 3-manifolds whose fundamental groups are not subgroup separable (LERF). Rubinstein and Wang have given a criterion to determine whether or not a given horizontal surface in a graph manifold is separable (i.e., lifts to an embedded surface in some finite cover of the manifold). This paper extends the criterion to include some nonhorizontal surfaces in graph manifolds.

📜 SIMILAR VOLUMES

A Criterion for the Conjugacy Separabili

A Criterion for the Conjugacy Separability of Certain HNN Extensions of Groups

✍ Goansu Kim; C.Y. Tang 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 204 KB

We first prove the double coset separability of certain HNN extensions with cyclic associated subgroups. Using this we prove a criterion for the conjugacy separability of HNN extensions of conjugacy separable groups with cyclic associated subgroups. Applying this result we show that certain HNN exte

A Criterion for the Conjugacy Separabili

A Criterion for the Conjugacy Separability of Amalgamated Free Products of Conjugacy Separable Groups

✍ Goansu Kim; C.Y. Tang 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 293 KB

We first prove a criterion for the conjugacy separability of generalized free products of two conjugacy separable groups amalgamating a cyclic subgroup. Applying this result, we show that tree products of a finite number of conjugacy separable, residually finitely generated torsion-free nilpotent gr

Graph groups, coherence, and three-manif

Graph groups, coherence, and three-manifolds

✍ Carl Droms 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 299 KB

Isomorphism criterion for monomial graph

Isomorphism criterion for monomial graphs

✍ Vasyl Dmytrenko; Felix Lazebnik; Raymond Viglione 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 88 KB

## Abstract Let __q__ be a prime power, 𝔽~__q__~ be the field of __q__ elements, and __k__, __m__ be positive integers. A bipartite graph __G__ = __G~q~__(__k__, __m__) is defined as follows. The vertex set of __G__ is a union of two copies __P__ and __L__ of two‐dimensional vector spaces over 𝔽~__

Graphs and Separability Properties of Gr

Graphs and Separability Properties of Groups

✍ Rita Gitik 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 207 KB

A group G is LERF locally extended residually finite if for any finitely generated subgroup S of G and for any g f S there exists a finite index subgroup S of G which contains S but not g. Using graph-theoretical methods we give 0 algorithms for constructing finite index subgroups in amalgamated fre

A reduction criterion for supereulerian

A reduction criterion for supereulerian graphs

✍ Catlin, Paul A. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 162 KB 👁 2 views

Let G be a graph, and let H be a connected subgraph of G. When it is known that the graph G/H (obtained from G by contracting H to a vertex) has a spanning eulerian subgraph, under what conditions can it be inferred that G itself has a spanning eulerian subgraph? 0 1996 John Wiley & Sons, Inc.