Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 21 for “"Distributive lattice"”.
-
ON THE LATTICE OF SUBLATTICES OF A FINITE DISTRIBUTIVE LATTICE
… of this thesis is to study the structure of the lattice S(L) of sublattices of a finite distributive lattice L and the interdependence between the lattices Land S(L). This thesis consists of four chapters. Chapter 1 gives the basic terms and notations that are needed throughout the thesis. It …
-
Problems in functional analysis
… analysis. A major part is devoted to problems in distributive lattice theory. Motivated by the Priestley representation theorem for a distributive lattice L we obtain information about the lattices of ideals, filters and congruence relations of L. Using purely lattice-theoretic means we give …
-
Efficient Representation and Encoding of Distributive Lattices
This thesis presents two new representations of distributive lattices with an eye towards efficiency in both time and space. Distributive lattices are a well-known class of partially-ordered sets having two natural operations called meet and join. Improving on all previous results, we develop an …
-
Thresholds In Modular Lattices
… threshold phenomena in infinite modular lattices, extending classical threshold theory beyond Boolean and distributive lattice settings. Specifically, let\(P\) be a finite graded modular lattice with a finite graded modular lattice with rank function \(r: P \rightarrow \mathbb {N}\). By …
-
ON THE AXIOMATISABILITY OF THE DUAL OF COMPACT ORDERED SPACES
… asserts that the category of unital commutative distributive lattice-ordered monoids is equivalent to the category of what we call MV-monoidal algebras. Our proof is independent of Mundici's theorem.
-
EPR & the Foundations of Quantum Mechanics
… by a structural conflict between the classical, distributive logic tacitly built into locality arguments and the non-distributive lattice that governs quantum propositions. It develops the Tractarian-Stone picture of classical logical space, and sets it against the Hilbert-space framework. …
-
The role of true finiteness in the admissible recursively enumerable degrees
… into the recursively enumerable degrees, and non-distributive lattice embeddings into these degrees. We show that if an admissible ordinal alpha is effectively close to omega (where this closeness can be measured by size or by cofinality) then such constructions may be performed in the alpha-r.e. …
-
An algebraic approach to multivariate approximation
… by Gordon [8], employs the properties of a distributive lattice ψ M generated by a set of linear projection operators {P<sub>m}<sup>M</sup><sub>m=1</sub>. ψ has a maximal element <i>M</i> and a minimal element <i>L</i>. The maximal projector <i>M</i> combines all the approximation properties …
-
L-fuzzy compactness and related concepts
… to arbitrary L-fuzzy sets where L is a fuzzy lattice, i.e., a completely distributive lattice with an order reversing involution. It is shown that with our compactness we can build up a satisfactory theory. The different definitions of compactness in L-fuzzy topological spaces are stated and …
-
Topology posets and an unramified symmetric model for set theory
… poset iff P is isomorphic to the open-set lattice of some T[subscript] i-topology. We state necessary and sufficient conditions that a finite poset P must satisfy to be a T[subscript] O, T[subscript] F, T[subscript] Y, T[subscript] DD, T[subscript] FF, or T[subscript]1 topology poset. We …
-
A generalised semi-Markov reliability model.
… Dedekind in 1897 on the cardinality of the free distributive lattice. Some numerical enumerations are evaluated, and several recursive bounds are derived. In the special case of the usual dichotomic reliability model, a new upper bound is shown to be superior to the best explicit and …
-
Diagrams in Involutive Residuated Lattices
First, we show that every distributive lattice-ordered pregroup can be embedded into a functional algebra over an integral chain, thereby improving the existing Cayley/Holland style embedding theorem. Using this result, we demonstrate that the variety of all dis tributive lattice-ordered pregroups …
-
Interstructure Lattices and Types of Peano Arithmetic
… substructures of a model of PA forms a lattice, and is referred to as the substructure lattice of the model. In this thesis, we study substructure and interstructure lattices of models of PA. We apply techniques used in studying these lattices to other problems in the model theory of PA. …
-
The lattice of normal subgroups of an infinite group
… ≤ λa. Let <mathematical symbol="">(∧) be the distributive lattice of semi-ideals of ∧. Then there exists a group G with the following properties:</mathematical></mathematical></mathematical></p> (<p>1) |G| ≤ max(<mathematical symbol=""> of |<mathematical …
-
2-sided and multi-sided stable matchings: structures, algorithms, and applications
… that the set of chain stable networks forms a distributive lattice. Furthermore, the notion of contract-rotations is defined and a series of specialized algorithms are proposed.
-
Distributive lattices, stable matchings, and robust solutions
The stable matching problem, first presented by mathematical economists Gale and Shapley, has been studied extensively since its introduction. As a result, a remarkably rich literature on the problem has accumulated in both theory and practice. In this thesis we further extend our understanding on …
-
Structure and complexity of the student-project allocation problem
… prove that the set of stable matchings forms a distributive lattice under a natural dominance relation, in which the student-optimal and lecturer-optimal matchings correspond to the maximum and minimum elements, respectively. In the second characterisation, we extend the notion of rotations, …
-
Μελέτη της θεωρίας διαστάσεων στην περιοχή των τοπολογικών χώρων και των δικτυωτών
… we study the covering dimension of finite lattices using matrices. We study the notions of minimal covers and their order using order-matrices and incidence matrices. We give an algorithm which finds the set of all minimal covers of an arbitrary finite lattice and based on this study we …
-
The Student-Project Allocation Problem: structure and algorithms
… of stable matchings in an instance of SPA-S is a distributive lattice with respect to a natural dominance relation. Next, we study a variant of SPA - S where the preferences may involve ties — the Student- Project Allocation problem with Lecturer preferences over Students with Ties (SPA-ST). The …
-
Theory and algorithms for matching problems under preferences
… matchings in the super-stable matching lattice. The second algorithm takes O(mn) time, where m denotes the number of edges and n denotes the number of vertices and gives an explicit rotation poset that can be used to construct all super-stable matchings. In the second part, we present a …
Page 1 of 2