Results 21 to 30 of about 348 (168)

The Order of Hypersubstitutions of Type (2,1)

International Journal of Mathematics and Mathematical Sciences, 2011
Hypersubstitutions are mappings which map operation symbols to terms of the corresponding arities. They were introduced as a way of making precise the concept of a hyperidentity and generalizations to 𝑀-hyperidentities.
Tawhat Changphas, Wonlop Hemvong
doaj   +1 more source

The minimal closed monoids for the Galois connection ${\rm End}$-${\rm Con}$ [PDF]

Mathematica Bohemica
The minimal nontrivial endomorphism monoids $M={\rm End}{\rm Con} (A,F)$ of congruence lattices of algebras $(A,F)$ defined on a finite set $A$ are described.
Danica Jakubíková-Studenovská, Reinhard Pöschel, Sándor Radeleczki   +2 more
doaj   +1 more source

ESSENTIAL AND RETRACTABLE GALOIS CONNECTIONS [PDF]

Journal 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

Involutions on Relational Program Calculi [PDF]

Scientific Annals of Computer Science, 2008
The standard Galois connection between the relational and predicate-transformer models of sequential programming (defined in terms of weakest precondition) confers a certain similarity between them.
I.M. Rewitzky, J.W. Sanders
doaj  

Connections on trivial vector bundles over projective schemes

Comptes 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, Hô Hai, Phùng, dos Santos, Joao Pedro   +2 more
doaj   +1 more source

Rough sets based on Galois connections

International Journal of Applied Mathematics and Computer Science, 2020
Rough set theory is an important tool to extract knowledge from relational databases. The original definitions of approximation operators are based on an indiscernibility relation, which is an equivalence one.
Madrid Nicolás, Medina Jesús, Ramírez-Poussa Eloísa   +2 more
doaj   +1 more source

On the additive image of zeroth persistent homology

Transactions 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, Magnus B. Botnan, Steffen Oppermann, Johan Steen   +3 more
wiley   +1 more source

On Constructivity of Galois Connections [PDF]

, 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   +2 more sources

Galois connections for bilattices

Algebra universalis, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Koutras, C.D., Pitsiladis, G.V.
openaire   +3 more sources

The Singular Value Decomposition over Completed Idempotent Semifields

Mathematics, 2020
In this paper, we provide a basic technique for Lattice Computing: an analogue of the Singular Value Decomposition for rectangular matrices over complete idempotent semifields (i-SVD).
Francisco J. Valverde-Albacete, Carmen Peláez-Moreno   +1 more
doaj   +1 more source