Explicit constructions of loops with commuting inner mappings
نویسندگان
چکیده
منابع مشابه
Explicit constructions of loops with commuting inner mappings
In 2004, Csörgő constructed a loop of nilpotency class three with abelian group of inner mappings. As of now, no other examples are known. We construct many such loops from groups of nilpotency class two by replacing the product xy with xyh in certain positions, where h is a central involution. The location of the replacements is ultimately governed by a symmetric trilinear alternating form. c ...
متن کاملMoufang Loops with Commuting Inner Mappings
We investigate the relation between the structure of a Moufang loop and its inner mapping group. Moufang loops of odd order with commuting inner mappings have nilpotency class at most two. 6-divisible Moufang loops with commuting inner mappings have nilpotency class at most two. There is a Moufang loop of order 2 with commuting inner mappings and of nilpotency class three.
متن کاملInner mappings of Bruck loops
K-loops have their origin in the theory of sharply 2-transitive groups. In this paper a proof is given that K-loops and Bruck loops are the same. For the proof it is necessary to show that in a (left) Bruck loop the left inner mappings L(b)L(a)L(ab)−" are automorphisms. This paper generalizes results of Glauberman[3], Kist[8] and Kreuzer[9].
متن کاملCommuting semigroups of holomorphic mappings
Let S1 = {Ft}t≥0 and S2 = {Gt}t≥0 be two continuous semigroups of holomorphic self-mappings of the unit disk ∆ = {z : |z| < 1} generated by f and g, respectively. We present conditions on the behavior of f (or g) in a neighborhood of a fixed point of S1 (or S2), under which the commutativity of two elements, say, F1 and G1 of the semigroups implies that the semigroups commute, i.e., Ft◦Gs = Gs◦...
متن کاملA Calculus of Constructions with Explicit Subtyping
The calculus of constructions can be extended with an infinite hierarchy of universes and cumulative subtyping. Subtyping is usually left implicit in the typing rules. We present an alternative version of the calculus of constructions where subtyping is explicit. We avoid problems related to coercions and dependent types by using the Tarski style of universes and by adding equations to reflect ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2008
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2007.10.001