lattices of subgroups
Recently Published Documents


TOTAL DOCUMENTS

18
(FIVE YEARS 0)

H-INDEX

3
(FIVE YEARS 0)

2014 ◽  
Vol 60 (2) ◽  
pp. 261-277
Author(s):  
Andrei Alexandru ◽  
Gabriel Ciobanu

Abstract Lattices of subgroups are presented as algebraic domains. Given an arbitrary group, we define the Scott topology over the subgroups lattice of that group. A basis for this topology is expressed in terms of finitely generated subgroups. Several properties of the continuous functions with respect the Scott topology are obtained; they provide new order properties of groups. Finally there are expressed several properties of the group of permutations of atoms in a permutative model of set theory. We provide new properties of the extended interchange function by presenting some topological properties of its domain. Several order and topological properties of the sets in the Fraenkel-Mostowski model remains also valid in the Extended Fraenkel-Mostowski model, even one axiom in the axiomatic description of the Extended Fraenkel-Mostowski model is weaker than its homologue in the axiomatic description of the Fraenkel-Mostowski model.


2014 ◽  
Vol 8 ◽  
pp. 6699-6707
Author(s):  
Maria Rosaria Celentani ◽  
Antonella Leone

2008 ◽  
Vol 52 (3) ◽  
pp. 887-900 ◽  
Author(s):  
Czesław Bagiński ◽  
Agnieszka Stocka

2006 ◽  
Vol 13 (04) ◽  
pp. 607-616 ◽  
Author(s):  
Mark L. Lewis

In this paper, we study lattices of subgroups that can be used to obtain lifts of π-partial characters. In particular, we find a condition on the lattices so that the associated lifts will be well-behaved regarding induction and restriction on normal subgroups. We show that the lattices obtained from all subnormal subgroups have this property, but the lattices obtained from all normal subgroups do not.


2006 ◽  
Vol 80 (1) ◽  
pp. 45-64
Author(s):  
Cheryl E. Praeger

AbstractVarious lattices of subgroups of a finite transitive permutation group G can be used to define a set of ‘basic’ permutation groups associated with G that are analogues of composition factors for abstract finite groups. In particular G can be embedded in an iterated wreath product of a chain of its associated basic permutation groups. The basic permutation groups corresponding to the lattice L of all subgroups of G containing a given point stabiliser are a set of primitive permutation groups. We introduce two new subgroup lattices contained in L, called the seminormal subgroup lattice and the subnormal subgroup lattice. For these lattices the basic permutation groups are quasiprimitive and innately transitive groups, respectively.


Sign in / Sign up

Export Citation Format

Share Document