𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Automorphism Tower Problem Revisited

✍ Scribed by Winfried Just; Saharon Shelah; Simon Thomas

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
236 KB
Volume
148
Category
Article
ISSN
0001-8708

No coin nor oath required. For personal study only.

✦ Synopsis

It is well known that the automorphism towers of infinite centreless groups of cardinality } terminate in less than (2 } ) + steps. But an easy counting argument shows that (2 } ) + is not the best possible bound. However, in this paper, we will show that it is impossible to find an explicit better bound using ZFC.

πŸ“œ SIMILAR VOLUMES

The eponym problem revisited
The eponym problem revisited
✍ Claude H. Organ Jr. πŸ“‚ Article πŸ“… 1991 πŸ› John Wiley and Sons 🌐 English βš– 54 KB
The Optimal Alphabetic Tree Problem Revi
The Optimal Alphabetic Tree Problem Revisited
✍ Lawrence L Larmore; Teresa M Przytycka πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 202 KB

The Optimal Alphabetic Binary Tree OABT problem is equivalent to the Optimal Binary Search Tree problem where the weights are associated only with Ε½ . the leaves. The problem can be solved in O n log n time, while the best known Ε½ . lower bound is ⍀ n . In this paper we relate the complexity of the