نتایج جستجو برای: 20e05 20e36
تعداد نتایج: 49 فیلتر نتایج به سال:
A generalised tetrahedron group is the colimit of a triangle of groups whose vertex groups are generalised triangle groups and whose edge groups are finite cyclic. We prove an improved Spelling Theorem for generalised triangle groups which enables us to compute the precise Gersten-Stallings angles of this triangle of groups, and hence obtain a classification of generalised tetrahedron groups ac...
Let w be a non-trivial word in two variables. We prove that the probability that two randomly chosen elements x, y of a nonabelian finite simple group S satisfy w(x, y) = 1 tends to 0 as |S| → ∞. As a consequence, we obtain a new short proof of a well-known conjecture of Magnus concerning free groups, as well as some applications to profinite groups. Research partially supported by NSERC grant ...
A self-map, either single-valued or multi-valued, is multiply fixed if every map homotopic to it has at least two fixed points. Let p : X̃ → X be a finite covering space, of degree n, of a connected finite polyhedron, and let f : X → X be a map. We lift f to an n-valued map φp,f : X̃ ( X̃ and prove that it is multiply fixed if the Nielsen number of f is greater than or equal to two. We obtain a fo...
We give a presentation by generators and relations of a certain monoid generating a subgroup of index two in the group Aut(F2) of automorphisms of the rank two free group F2 and show that it can be realized as a monoid in the group B4 of braids on four strings. In the second part we use Christoffel words to construct an explicit basis of F2 lifting any given basis of the free abelian group Z . ...
We prove that if F is a finitely generated free group and φ is an automorphism of F then F oφ Z satisfies a quadratic isoperimetric inequality. Our proof of this theorem rests on a direct study of the geometry of van Kampen diagrams over the natural presentations of free-by-cylic groups. The main focus of this study is on the dynamics of the time flow of t-corridors, where t is the generator of...
This article surveys many standard results about the braid group, with emphasis on simplifying the usual algebraic proofs. We use van der Waerden’s trick to illuminate the Artin-Magnus proof of the classic presentation of the braid group considered as the algebraic mapping-class group of a disc with punctures. We give a simple, new proof of the σ1-trichotomy for the braid group, and, hence, rec...
We show that the following problems are decidable in a rank 2 free group F2: does a given finitely generated subgroupH contain primitive elements? and does H meet the orbit of a given word u under the action of G, the group of automorphisms of F2? Moreover, decidability subsists even if we restrict G to be a rational subset of the set of invertible substitutions (a.k.a. positive automorphisms)....
The well-known difficulties arising in a classification which is not set-theoretically trivial—involving what is sometimes called a nonsmooth quotient—have been overcome in a striking way in the theory of operator algebras by the use of what might be called a classification functor—the very existence of which is already a surprise. Here the notion of such a functor is developed abstractly, and ...
A group homomorphism η : A → H is called a localization of A if every homomorphism φ : A→ H can be ‘extended uniquely’ to a homomorphism Φ : H → H in the sense that Φη = φ. This categorical concept, obviously not depending on the notion of groups, extends classical localizations as known for rings and modules. Moreover this setting has interesting applications in homotopy theory, see the introd...
A group homomorphism η : A → H is called a localization of A if every homomorphism φ : A → H can be ‘extended uniquely’ to a homomorphism Φ : H → H in the sense that Φη = φ. This categorical concepts, obviously not depending on the notion of groups, extends classical localizations as known for rings and modules. Moreover this setting has interesting applications in homotopy theory, see the intr...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید