No description available.

No description available.

No description available.

The thesis analyzes some aspects of the theory of distributive lattices, particularly two representation theorems: Birkhoff's representation theorem for finite distributive lattices and Stone's representation theorem for infinite distributive lattices.

Let L/F be a finite separable extension. L* = L\{0}, and T(L*/F*) be the torsion subgroup of L*/F*. We explicitly determined T(L*/F*) when L/F is an abelian extension. This information is used to study the structure of T(L*/F*). In particular T(F(α)*/F*) when αᵐ = a ∈ F is explicitly determined. Let Xᵐ - a be irreducible over F with char F χ m and let α be a root of Xᵐ - a. We study the lattice of subfields of F(α)/F and to this end C(F(α)/F,k) is defined to be the number of subfields of F(α) of degree k over F. C(f(α)/F,pⁿ) is explicitly determined for p a prime and the following structure theorem for the lattice of subfields is proved. Let N be the maximal normal subfield of F(α) and set n = [N:F], then C(F(α)/F,k) = C(F(α)/F,(k,n)) = C(N/F,(k,n)). The irreducible binomials X⁸ - b, X⁸ - c are said be equivalent if there exist roots β⁸ = b, γ⁸ = c that F(β) = F(γ). All the mutually inequivalent binomials which have roots in F(α) are determined. These results are applied the study of normal binomials and those irreducible binomials X²ᵉ - a which are normal over F(charF ≠ 2) together their Galois groups are characterized. We finished by considering the radical extension F(α)/F, αᵐ ∈ F, where the binominal Xᵐ - αᵐ is not necessarily irreducible. We see that in the case not every subfield of F(α)/F is the compositum of subfields of prime power order. We determine some conditions such that if F ⊆ H ⊆ F(α) with [H:F] = pᵘq, p a prime, (p,q) = 1, then there exists a subfield F ⊆ R ⊆ H where [R:F] = pᵘ.

In this thesis we are concerned with arithmetic in a certain partially ordered, commutative semigroup D. The first chapter investigates the class of countable Boolean algebras from which this semigroup arises. The elements of D correspond to the isomorphism classes of the Boolean algebras under consideration. In Chapter 2 we begin the study of the semigroup structure of D. D is axiomatically described by three groups of axioms. It is proved that these axioms are categorical. The ordering of D is used to investigate the multiplication. The set of T of torsion elements of D (elements with only finite many distinct powers), form a subsemigroup whose structure is studied. There is a natural torsion free quotient D/T whose structure is also investigated. In Chapter 3, the axioms are used to characterize elements s of T in terms of the arithmetic in the subsemigroup generated by the elements that are smaller than s. The characterization is used to determine elements of T that cover a single element. In the last part of Chapter 3, we obtain some sufficient, purely combinatorial conditions for an element to have infinite order.

No description available.

A lattice L is said to be dually semimodular if for all elements a and b in L, a ∨ b covers b implies that a covers a ∧ b. L is consistent if for every join-irreducible j and every element x in L, the element x ∨ j is a join-irreducible in the upper interval [x,l]. In this paper, finite dually semimodular consistent lattices are investigated. Examples of these lattices are the lattices of subnormal subgroups of a finite group. In 1954, R. P. Dilworth proved that in a finite modular lattice, the number of elements covering exactly k elements is equal to the number of elements covered by exactly k elements. Here, it is established that if a finite dually semimodular consistent lattice has the same number of join-irreducibles as meet-irreducibles, then it is modular. Hence, a converse of Dilworth's theorem, in the case when k equals 1, is obtained for finite dually semimodular consistent lattices. Several combinatorial results are shown for finite consistent lattices similar to those already established for finite geometric lattices. The reach of an element x in a lattice L is the difference between the rank of x*, the join of x and all the elements covering x, and the rank of x; the maximum reach of all elements in L is the reach of L. Sharp lower bounds for the total number of elements and the number of elements of a given reach in a semimodular consistent lattice given the rank, the reach, and the number of join-irreducibles are found. Extremal lattices attaining these bounds are described. Similar results are then obtained for finite dually semimodular consistent lattices.

No description available.

Thesis (Ph. D.)--State University of New York at Binghamton, Mathematical Sciences Department, 2006. / Includes bibliographical references.