AUTOMORPHISMS O F THE LATTICE OF RECURSIVELY ENUMERABLE VECTOR SPACES by IRAJ KALANTARI in Macomb, Illinois (U.S.A. ) l ) I ) This paper forms a part of the author's dissertation. We would like to acknowledge valuable discussions with GEORGE METAKIDES, ANU NERODE, ALLEN RETZLAFF and RICHARD SHORE. R
The lattice automorphisms of the dominance ordering
β Scribed by Rodica Simion
- Publisher
- Elsevier Science
- Year
- 1984
- Tongue
- English
- Weight
- 180 KB
- Volume
- 49
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
In this paper it is shown that the lattice/_~ of partitions of n under the dominance ordering is totally asymmetric, except for the cases n = 6 and 7 where the automorphism group is Z2XZ 2. As a consequence, partition conjugation is the only antiautomorphism of/_~ if n ~ 6, 7.
L 6 and L 7 the automorphism group is isomorphic to 7/2 x 7/2, while for all other n, /_~ is totally asymmetric, i.e., Aut(/_~)= {1}.
π SIMILAR VOLUMES
Let R be a unital lattice-ordered algebra over a totally ordered field F and F n be the n Γ n n β₯ 2 matrix algebra over F. It is shown that under certain conditions R contains a lattice-ordered subalgebra which is isomorphic to (F n F + n . In particular, let (F n P) be a lattice-ordered algebra ove
The weight lattice of a crystallographic root system is partially ordered by the rule that \*>+ if \*&+ is a nonnegative integer linear combination of positive roots. In this paper, we study the subposet formed by the dominant weights. In particular, we prove that \* covers + in this partial order
97α108 proved a much stronger result, the strong independence of the automorphism group and the congruence lattice in the finite case. In this paper, we provide a full affirmative solution of the above problem. In fact, we prove much stronger results, verifying strong independence for general lattic