Zobrazeno 1 - 10
of 34
pro vyhledávání: '"M. J. Dunwoody"'
Autor:
B. Krön, M. J. Dunwoody
Publikováno v:
Journal of Graph Theory. 80:136-171
Given a connected graph, in many cases it is possible to construct a structure tree that provides information about the ends of the graph or its connectivity. For example Stallings' theorem on the structure of groups with more than one end can be pro
Autor:
M. J. Dunwoody
Publikováno v:
Bulletin of the London Mathematical Society. 34:756-768
Autor:
Eric Swenson, M. J. Dunwoody
Publikováno v:
Inventiones Mathematicae. 140:605-637
A structure theorem is proved for a finitely generated group with a finitely generated virtually polycyclic codimension one subgroup.
Autor:
M. J. Dunwoody, Jennifer Jones
Publikováno v:
Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics. 67:185-190
An example is given of a finitely generated group G for which G ≅ G*cG, where C is infinite cyclic.
Autor:
Warren Dicks, M. J. Dunwoody
Publikováno v:
Journal of Algebra. 216:20-39
Let G and M be groups, and a , b : G → G ∗ M group-theoretic sections of the natural projection G ∗ M → G . We use the Almost Stability Theorem, pro-trees, and new folding sequence techniques to show that if G is finitely generated, then the
Autor:
M. J. Dunwoody, M. E. Sageev
Publikováno v:
Inventiones Mathematicae. 135:25-44
We generalize the JSJ-splitting of Rips and Sela to give decompositions of finitely presented groups which capture splittings over certain classes of small subgroups. Such classes include the class of all 2-ended groups and the class of all virtually
Autor:
M. J. Dunwoody
Publikováno v:
Journal of the London Mathematical Society. 56:125-136
A group is accessible if there is a G -tree T such that every edge stabilizer is finite and every vertex stabilizer has at most one end. A group is inaccessible if it is not accessible. In [ 6 ] I began the study of group actions on protrees. These a
Autor:
M. J. Dunwoody
Publikováno v:
Groups-Korea 94: Proceedings of the International Conference held at Pusan National University, Pusan, Korea, August 18-25, 1994
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2ee380ff6f8f2e43ad398fb06157eedf
https://doi.org/10.1515/9783110908978.47
https://doi.org/10.1515/9783110908978.47
Autor:
M. J. Dunwoody
Publikováno v:
Random Walks, Boundaries and Spectra ISBN: 9783034602433
An inaccessible, vertex transitive, locally finite graph is described. This graph is not quasi-isometric to a Cayley graph.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::48609471f9f9ae9f9073f38713744598
https://doi.org/10.1007/978-3-0346-0244-0_1
https://doi.org/10.1007/978-3-0346-0244-0_1
Autor:
M. J. Dunwoody, M. A. Roller
Publikováno v:
Bulletin of the London Mathematical Society. 25:29-36