<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns="http://purl.org/rss/1.0/" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel rdf:about="https://www.um.edu.mt/library/oar/handle/123456789/404">
    <title>OAR@UM Community:</title>
    <link>https://www.um.edu.mt/library/oar/handle/123456789/404</link>
    <description />
    <items>
      <rdf:Seq>
        <rdf:li rdf:resource="https://www.um.edu.mt/library/oar/handle/123456789/145690" />
        <rdf:li rdf:resource="https://www.um.edu.mt/library/oar/handle/123456789/144070" />
        <rdf:li rdf:resource="https://www.um.edu.mt/library/oar/handle/123456789/143413" />
        <rdf:li rdf:resource="https://www.um.edu.mt/library/oar/handle/123456789/142588" />
      </rdf:Seq>
    </items>
    <dc:date>2026-04-23T16:53:16Z</dc:date>
  </channel>
  <item rdf:about="https://www.um.edu.mt/library/oar/handle/123456789/145690">
    <title>Non-commutative probability : from classical to quantum probability</title>
    <link>https://www.um.edu.mt/library/oar/handle/123456789/145690</link>
    <description>Title: Non-commutative probability : from classical to quantum probability
Abstract: In classical probability theory, it is implicitly assumed that random variables&#xD;
commute. However, this assumption does not necessarily hold in all mathemat&#xD;
ical frameworks, such as those involving matrices. In this thesis, we will explore&#xD;
quantum probability, a non-commutative extension of classical probability. The&#xD;
main aim of this thesis shall be to examine how key concepts from classical&#xD;
probability can be generalized in the quantum setting.
Description: M.Sc.(Melit.)</description>
    <dc:date>2025-01-01T00:00:00Z</dc:date>
  </item>
  <item rdf:about="https://www.um.edu.mt/library/oar/handle/123456789/144070">
    <title>Intrinsic topologies on ordered structures : applications</title>
    <link>https://www.um.edu.mt/library/oar/handle/123456789/144070</link>
    <description>Title: Intrinsic topologies on ordered structures : applications
Abstract: This thesis is divided into two main parts. The first three chapters&#xD;
focus on the study of order and unbounded order convergence.                                                                             We examine various well-established definitions of order convergence, that&#xD;
have emerged over time, each associated with a corresponding                                                                         topology. These notions are compared in detail, with particular attention&#xD;
to the conditions under which they coincide or differ. Furthermore, in&#xD;
the context of a semi-finite measure space, we investigate the relationship                                                    between the topologies on L∞ arising from the duality (L∞, L1),&#xD;
and we compare these to the order topology. Notably, we establish&#xD;
a condition under which the Mackey topology is strictly weaker than&#xD;
the order topology.&#xD;
Compared to order convergence, unbounded order convergence is&#xD;
relatively new and is generally studied on Riesz spaces. In this thesis,                                                                   we explore it in the broader context of lattices. Our results show&#xD;
that, similar to the order topology, the unbounded order topology is&#xD;
independent of the definition of order convergence. In addition, we&#xD;
extend key properties known to hold in Riesz spaces to lattices. We&#xD;
prove that order continuity of unbounded order convergence is                                                                       equivalent to the lattice being infinitely distributive. Moreover, we show&#xD;
that the O-closure and uO-closure of a sublattice coincide and form a&#xD;
sublattice. Furthermore, we show that the uO-adherence of an ideal&#xD;
is an O-closed ideal. We also examine the MacNeille completion of a&#xD;
sublattice Y relative to that of a lattice L, identifying two conditions&#xD;
under which the completion of Y embeds regularly in that of L.&#xD;
The last chapter is dedicated to the study of lattice uniformities. It&#xD;
is known that for a locally solid Riesz space (X, τ ) there exists a locally&#xD;
solid linear topology uτ on X such that unbounded τ -convergence&#xD;
coincides with uτ -convergence. This topology is the weakest locally&#xD;
solid linear topology that agrees with τ on all order bounded subsets.&#xD;
Thus, for a uniform lattice (L, U), we introduce the weakest lattice&#xD;
uniformity U∗ on L that coincides with U on each order bounded&#xD;
subset of L. We see that if U is the uniformity induced by the topology&#xD;
of a locally solid Riesz space (X, τ ), then the U∗ -topology coincides&#xD;
with uτ . We also provide answers to several questions posed in [44, 37].
Description: Ph.D.(Melit.)</description>
    <dc:date>2026-01-01T00:00:00Z</dc:date>
  </item>
  <item rdf:about="https://www.um.edu.mt/library/oar/handle/123456789/143413">
    <title>Saved by the rook : a case of matchings and Hamiltonian cycles</title>
    <link>https://www.um.edu.mt/library/oar/handle/123456789/143413</link>
    <description>Title: Saved by the rook : a case of matchings and Hamiltonian cycles
Authors: Abreu, Marién; Gauci, John Baptist; Zerafa, Jean Paul
Abstract: The rook graph is a graph whose edges represent all the&#xD;
possible legal moves of the rook chess piece on a chessboard. The problem&#xD;
we consider is the following. Given any set M containing pairs of&#xD;
cells such that each cell of the m1×m2 chessboard is in exactly one pair,&#xD;
we determine the values of the positive integers m1 and m2 for which&#xD;
it is possible to construct a closed tour of all the cells of the chessboard&#xD;
which uses all the pairs of cells in M and some edges of the rook graph.&#xD;
This is an alternative formulation of a graph-theoretical problem presented&#xD;
in [1] involving the Cartesian product G of two complete graphs&#xD;
Km1 and Km2 , which is, in fact, isomorphic to the m1×m2 rook graph.&#xD;
The problem revolves around determining the values of the parameters&#xD;
m1 and m2 that would allow any perfect matching of the complete graph&#xD;
on the same vertex set of G to be extended to a Hamiltonian cycle by&#xD;
using only edges in G.</description>
    <dc:date>2025-01-01T00:00:00Z</dc:date>
  </item>
  <item rdf:about="https://www.um.edu.mt/library/oar/handle/123456789/142588">
    <title>Analytical solutions to the Laplace equation on a hemispherical domain</title>
    <link>https://www.um.edu.mt/library/oar/handle/123456789/142588</link>
    <description>Title: Analytical solutions to the Laplace equation on a hemispherical domain
Authors: Sebu, Cristiana; Amaira, Andrei; Pidcock, Michael
Abstract: In this paper, we derive analytical solutions to the Laplace equation in a&#xD;
hemispherical domain subject to two different idealized Neumann boundary conditions.&#xD;
The solutions are given as infinite series, and their convergence is analysed.&#xD;
The theoretical results have been validated by comparing them with numerical results&#xD;
obtained using EIDORS.</description>
    <dc:date>2025-01-01T00:00:00Z</dc:date>
  </item>
</rdf:RDF>

