𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The complexity of central series in nilpotent computable groups

✍ Scribed by Barbara F. Csima; Reed Solomon

Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
283 KB
Volume
162
Category
Article
ISSN
0168-0072

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Component Groups of Centralizers of Nilp
Component Groups of Centralizers of Nilpotents in Complex Symmetric Spaces
✍ Donald R King; Alfred G Noel πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 256 KB

Let G be the adjoint group of a simple Lie algebra , and let K C β†’ Aut C be the complexified isotropy representation at the identity coset of the corresponding symmetric space. If e ∈ C is nilpotent, we consider the centralizer of e in K C . We show that the conjugacy classes of the component group

Nilpotency in Groups with the Minimal Co
Nilpotency in Groups with the Minimal Condition on Centralizers
✍ Frank O Wagner πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 110 KB

The Sylow-2-subgroups of a periodic group with minimal condition on centralizers are locally finite and conjugate. The same holds for the Sylow-p-subgroups for any prime p, provided the subgroups generated by any two p-elements of the group are finite. In the non-periodic context, the bounded left E

On the complexity of categoricity in com
On the complexity of categoricity in computable structures
✍ Walker M. White πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 192 KB

## Abstract We investigate the computational complexity the class of Γ‐categorical computable structures. We show that hyperarithmetic categoricity is Ξ ^1^~1~‐complete, while computable categoricity is Ξ ^0^~4~‐hard. (Β© 2003 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)