Results 31 to 40 of about 781 (187)

On Constructivity of Galois Connections [PDF]

open access: yes, 2017
Abstract interpretation-based static analyses rely on abstract domains of program properties, such as intervals or congruences for integer variables. Galois connections (GCs) between posets provide the most widespread and useful formal tool for mathematically specifying abstract domains.
openaire   +1 more source

ESSENTIAL AND RETRACTABLE GALOIS CONNECTIONS [PDF]

open access: yesJournal of Algebra and Its Applications, 2013
For bounded lattices, we introduce certain Galois connections, called (cyclically) essential, retractable and UC Galois connections, which behave well with respect to concepts of module-theoretic nature involving essentiality. We show that essential retractable Galois connections preserve uniform dimension, whereas essential retractable UC Galois ...
openaire   +2 more sources

Hilbert Algebras with Hilbert-Galois Connections II

open access: yesBulletin of the Section of Logic
Hilbert algebra with a Hilbert-Galois connection, or HilGC-algebra, is a triple \(\left(A,f,g\right)\) where \(A\) is a Hilbert algebra, and \(f\) and \(g\) are unary maps on \(A\) such that \(f(a)\leq b\) iff \(a\leq g(b)\), and \(g(a\rightarrow b)\leq ...
Sergio A. Celani, Daniela Montagie
doaj   +1 more source

Galois connections between sets of paths and closure operators in simple graphs

open access: yesOpen Mathematics, 2018
For every positive integer n,we introduce and discuss an isotone Galois connection between the sets of paths of lengths n in a simple graph and the closure operators on the (vertex set of the) graph.
Šlapal Josef
doaj   +1 more source

A curious example involving ordered compactifications

open access: yesApplied General Topology, 2002
For a certain product X x Y where X is compact, connected, totally ordered space, we find that the semilattice K0 (X x Y) of ordered compactifications of X x Y is isomorphic to a collection of Galois connections and to a collection of functions F which ...
Thomas A. Richmond
doaj   +1 more source

On the additive image of zeroth persistent homology

open access: yesTransactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.
Abstract For a category X$X$ and a finite field F$F$, we study the additive image of the functor H0(−;F)∗:rep(X,Top)→rep(X,VectF)$\operatorname{H}_0(-;F)_* \colon \operatorname{rep}(X, \mathbf {Top}) \rightarrow \operatorname{rep}(X, \mathbf {Vect}_F)$, or equivalently, of the free functor rep(X,Set)→rep(X,VectF)$\operatorname{rep}(X, \mathbf {Set ...
Ulrich Bauer   +3 more
wiley   +1 more source

Connections on trivial vector bundles over projective schemes

open access: yesComptes Rendus. Mathématique
Over a smooth and proper complex scheme, the differential Galois group of an integrable connection may be obtained as the closure of the transcendental monodromy representation.
Biswas, Indranil   +2 more
doaj   +1 more source

Computing Bonds Between Formal Contexts

open access: yesMathematical Methods in the Applied Sciences, Volume 49, Issue 11, Page 11661-11677, 30 July 2026.
ABSTRACT The notion of bond was introduced as a technique to aggregate information from multiple datasets without modifying the information already present in each of the datasets. This notion has been extended to several fuzzy frameworks, including the residuated lattice setting, which we also consider in this paper.
Roberto G. Aragón   +2 more
wiley   +1 more source

A characterization of adjunction in a many-valued modal system

open access: yesCQD Revista Eletrônica Paulista de Matemática
Galois connections are pairs of functions, defined over ordered sets, that preserve some particular aspects. They are studied in the context of algebraic structures.
Hércules de Araújo Feitosa   +1 more
doaj   +1 more source

Invariance groups of finite functions and orbit equivalence of permutation groups

open access: yesOpen Mathematics, 2015
Which subgroups of the symmetric group Sn arise as invariance groups of n-variable functions defined on a k-element domain? It appears that the higher the difference n-k, the more difficult it is to answer this question.
Horváth Eszter K.   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy