نتایج جستجو برای: amalgamated
تعداد نتایج: 964 فیلتر نتایج به سال:
It is known that every group which acts transitively on the ordered edges of the cubic tree Y3, with finite vertex stabilizer, is isomorphic to one of seven finitely presented subgroups of the full automorphism group of r3-one of which is the modular group. In this paper a complete answer is given for the question (raised by Djokovic and Miller) as to whether two such subgroups which intersect ...
We obtain a criterion for quasiconvexity of a subgroup of an amalgamated free product of two word hyperbolic groups along a virtually cyclic subgroup. The result provides a method of constructing new word hyperbolic group in class (Q), that is such that all their finitely generated subgroups are quasiconvex. It is known that free groups, hyperbolic surface groups and most 3-dimensional Kleinian...
The most useful constructions in Combinatorial Group Theory are amalgamated free products and HNN-extensions, and they are the two basic examples in the theory of graphs of groups due to Bass and Serre (see [9]). We recall that given a group G and a subgroup H 6 G together with monomorphisms (respectively homomorphisms) ψ, φ : H −→ G, the group determined by the presentation 〈 G, t; t−1ψ(h)t = ...
Let $f: Arightarrow B$ be a ring homomorphism and let $J$ be an ideal of $B$. In this paper, we investigate the transfer of the property of coherence to the amalgamation $Abowtie^{f}J$. We provide necessary and sufficient conditions for $Abowtie^{f}J$ to be a coherent ring.
The link of a vertex v in a graph G is the subgraph induced by all vertices adjacent to v. If all the links in G are isomorphic to the same graph L, then L is called the link graph of G. We consider the operation of an amalgamation of graphs. Using the construction of the free product of groups with amalgamated subgroups, we give a sufficient condition for a class of link graphs of Cayley graph...
We study inverse semigroup amalgams [S1, S2;U ], where S1 and S2 are finitely presented inverse semigroups with decidable word problem and U is an inverse semigroup with decidable membership problem in S1 and S2. We use a modified version of Bennett’s work on the structure of Schützenberger graphs of the R-classes of S1 ∗U S2 to state sufficient conditions for the amalgamated free products S1 ∗...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید