✦ LIBER ✦

A note on the automorphisms of maximal orders

✍ Scribed by M.-A Knus; M Ojanguren

Publisher: Elsevier Science
Year: 1972
Tongue: English
Weight: 283 KB
Volume: 22
Category: Article
ISSN: 0021-8693
DOI: 10.1016/0021-8693(72)90168-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on “automorphism groups of partia

A note on “automorphism groups of partial orders”

✍ M.G. Stone 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 235 KB

We refer to articles by Bird [I] and Bird et al. [2] on automorphisms ol' posets. Let P, Q de-ote posets; P x Q is the Cartesian product with the lexicographic order and R&Q that same product with the "reverse" lexicographic order, viz. (p, -1) < (a', 9') iff 4 < q' or q = 4' and p \*f p'. r(P) deno

A Note on I-Automorphisms

✍ J.C. Beidleman; H. Heineken 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 113 KB

dedicated to professor helmut wielandt on the occasion of his 90th birthday ## 1. INTRODUCTORY REMARKS Let G be a group and denote by PAut G the group of power automorphisms of G (see [4]). An automorphism of G is called an I-automorphism of G if it maps every infinite subgroup of G onto itself. T

A note on algebraic automorphisms

✍ Mowaffaq Hajja; Reyadh Khazal 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 257 KB

A note on monomial automorphisms

✍ Mowaffaq Hajja 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 496 KB

A note on perfect orders

✍ C.T. Hoáng; N.V.R. Mahadev 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 852 KB

Perfectly orderable graphs were introduced by Chvfital in 1984. Since then, several classes of perfectly orderable graphs have been identified. In this paper, we establish three new results on perfectly orderable graphs. First, we prove that every graph with Dilworth number at most three has a simpl

A Note on Maximal Hierarchies

✍ Sebastian Böcker; Andreas W.M. Dress 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 134 KB

Given a (finite or infinite) set X, a collection C P(X ) of subsets of X is called a hierarchy if it satisfies the condition ` '' In this note, we characterize maximal hierarchies as set systems that contain the empty set, the full set, and all one-element sets, and in addition satisfy either one of