Galois connections are a particular kind of correspondence between ordered sets that preserve some but not all structure. In this thesis we explore examples and properties of Galois connections on preordered sets, and results such as the adjoint functor theorem.
openaire +1 more source
A duality between utility transforms and probability distortions. [PDF]
Chambers CP, Liu P, Wang R.
europepmc +1 more source
"In Mathematical Language": On Mathematical Foundations of Quantum Foundations. [PDF]
Plotnitsky A.
europepmc +1 more source
CryptoShield-multilayered cryptographic framework for enhanced security and robust communication systems. [PDF]
Altaf M +4 more
europepmc +1 more source
Opening Note: The Golden Jubilee of the Institute of Mathematics and Statistics of the University of São Paulo. [PDF]
Barrera J +4 more
europepmc +1 more source
A comparison framework for interleaved persistence modules. [PDF]
Harker S +3 more
europepmc +1 more source
Automorphic Bloch theorems for hyperbolic lattices. [PDF]
Maciejko J, Rayan S.
europepmc +1 more source
Canonicalizing Zeta Generators: Genus Zero and Genus One. [PDF]
Dorigoni D +7 more
europepmc +1 more source
On the Application of a Hybrid Incomplete Exponential Sum to Aperiodic Hamming Correlation of Some Frequency-Hopping Sequences. [PDF]
Li P, Han H.
europepmc +1 more source
Advanced Applications of Polymer Hydrogels in Electronics and Signal Processing. [PDF]
Suleimenov I +5 more
europepmc +1 more source

