On notions of genericity and mutual genericity

2007 ◽  
Vol 72 (3) ◽  
pp. 755-766 ◽  
Author(s):  
J. K. Truss
Keyword(s):  
Automorphism Group ◽  
Partial Order ◽  
Random Graph ◽  
Ordered Set ◽  
Homogeneous Structures ◽  
Circular Order

AbstractGeneric automorphisms of certain homogeneous structures are considered, for instance, the rationals as an ordered set, the countable universal homogeneous partial order, and the random graph. Two of these cases were discussed in [7], where it was shown that there is a generic automorphism of the second in the sense introduced in [10], In this paper, I study various possible definitions of ‘generic’ and ‘mutually generic’, and discuss the existence of mutually generic automorphisms in some cases. In addition, generics in the automorphism group of the rational circular order are considered.

scholarly journals Homomorphisms and congruences on ωα-bisimple semigroups

1973 ◽  
Vol 15 (4) ◽  
pp. 441-460 ◽  
Author(s):  
J. W. Hogan
Keyword(s):  
Partial Order ◽  
Ordered Set ◽  
Order Relation ◽  
Natural Partial Order ◽  
Partial Order Relation

Let S be a bisimple semigroup, let Es denote the set of idempotents of S, and let ≦ denote the natural partial order relation on Es. Let ≤ * denote the inverse of ≦. The idempotents of S are said to be well-ordered if (Es, ≦ *) is a well-ordered set.

scholarly journals Primitive idempotent measures on compact semitopological semigroups

1972 ◽  
Vol 13 (4) ◽  
pp. 451-455 ◽  
Author(s):  
Stephen T. L. Choy
Keyword(s):  
Partial Order ◽  
Partially Ordered Set ◽  
Ordered Set ◽  
Zero Element ◽  
Primitive Idempotent ◽  
Natural Partial Order ◽  
Partially Ordered

For a semigroup S let I(S) be the set of idempotents in S. A natural partial order of I(S) is defined by e ≦ f if ef = fe = e. An element e in I(S) is called a primitive idempotent if e is a minimal non-zero element of the partially ordered set (I(S), ≦). It is easy to see that an idempotent e in S is primitive if and only if, for any idempotent f in S, f = ef = fe implies f = e or f is the zero element of S. One may also easily verify that an idempotent e is primitive if and only if the only idempotents in eSe are e and the zero element. We let П(S) denote the set of primitive idempotent in S.

Automorphism groups of models of Peano arithmetic

2002 ◽  
Vol 67 (4) ◽  
pp. 1249-1264 ◽  
Author(s):  
James H. Schmerl
Keyword(s):  
Topological Group ◽  
Automorphism Group ◽  
Closed Subgroup ◽  
Automorphism Groups ◽  
Ordered Set ◽  
Peano Arithmetic ◽  
Ordered Sets ◽  
Torsion Free ◽  
Linearly Ordered Set

Which groups are isomorphic to automorphism groups of models of Peano Arithmetic? It will be shown here that any group that has half a chance of being isomorphic to the automorphism group of some model of Peano Arithmetic actually is.For any structure , let Aut() be its automorphism group. There are groups which are not isomorphic to any model = (N, +, ·, 0, 1, ≤) of PA. For example, it is clear that Aut(N), being a subgroup of Aut((, <)), must be torsion-free. However, as will be proved in this paper, if (A, <) is a linearly ordered set and G is a subgroup of Aut((A, <)), then there are models of PA such that Aut() ≅ G.If is a structure, then its automorphism group can be considered as a topological group by letting the stabilizers of finite subsets of A be the basic open subgroups. If ′ is an expansion of , then Aut(′) is a closed subgroup of Aut(). Conversely, for any closed subgroup G ≤ Aut() there is an expansion ′ of such that Aut(′) = G. Thus, if is a model of PA, then Aut() is not only a subgroup of Aut((N, <)), but it is even a closed subgroup of Aut((N, ′)).There is a characterization, due to Cohn [2] and to Conrad [3], of those groups G which are isomorphic to closed subgroups of automorphism groups of linearly ordered sets.

scholarly journals Commutators in groups of order-preserving permutations

1991 ◽  
Vol 33 (1) ◽  
pp. 55-59 ◽  
Author(s):  
Manfred Droste ◽  
R. M. Shortt
Keyword(s):  
Automorphism Group ◽  
Normal Subgroup ◽  
Partially Ordered Set ◽  
Ordered Set ◽  
Sufficient Conditions ◽  
Homogeneous Tree ◽  
Common Generalization ◽  
Partially Ordered ◽  
Bounded Support ◽  
Locally Linear

Let (S, ≤) be a poset (partially ordered set), A(S) = Aut(S, ≤) its automorphism group and G ⊆ A(S) a subgroup. In the literature, various authors have studied sufficient conditions on G and the structure of (S, ≤) which imply that G is simple or perfect. Let us call (S, ≤) doubly homogeneous if each isomorphism between two 2-subsets of 5 extends to an isomorphism of (S, ≤). Higman [8] proved that if (S, ≤) is a doubly homogeneous chain then B(S), the group of all automorphisms of (S, ≤) with bounded support, is simple, and each element of B(S) is a commutator in B(S). Droste, Holland and Macpherson [5] showed that if (S, ≤) is a doubly homogeneous tree then its automorphism group again contains a unique simple normal subgroup in which each element is a commutator. Dlab [3] established similar results for various groups of locally linear automorphisms of the reals. Further results in this direction are contained in Glass [7]. It is the aim of this note to establish a common generalization and sharpening of the previously mentioned results.

scholarly journals Partial order on a family of k-subsets of a linearly ordered set

2006 ◽  
Vol 306 (4) ◽  
pp. 413-419 ◽  
Author(s):  
Severino V. Gervacio ◽  
Hiroshi Maehara
Keyword(s):  
Partial Order ◽  
Ordered Set ◽  
Linearly Ordered Set

The forth part of the back and forth map in countable homogeneous structures

1997 ◽  
Vol 62 (3) ◽  
pp. 873-890
Author(s):  
S. J. McLeish
Keyword(s):  
Automorphism Group ◽  
Linear Orderings ◽  
Homogeneous Structures ◽  
Stable Structures

AbstractThe model theoretic ‘back and forth’ construction of isomorphisms and automorphisms is based on the proof by Cantor that the theory of dense linear orderings without endpoints is ℵ0-categorical. However, Cantor's method is slightly different and for many other structures it yields an injection which is not surjective. The purpose here is to examine Cantor's method (here called ‘going forth’) and to determine when it works and when it fails. Partial answers to this question are found, extending those earlier given by Cameron. We also give fuller characterisations of when forth suffices for model theoretic classes such as structures containing Jordan sets for the automorphism group, and ℵ0-categorical ω-stable structures. The work is based on the author's Ph.D. thesis.

Sign in / Sign up

Export Citation Format

Share Document