Results 31 to 40 of about 986 (204)
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
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 +1 more source
Connections on trivial vector bundles over projective schemes
Comptes Rendus. MathématiqueOver 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
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 +3 more
wiley +1 more source
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 +1 more
doaj +1 more source
Computing Bonds Between Formal Contexts
Mathematical 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 comprehensive survey on formal concept analysis, its research trends and applications
International Journal of Applied Mathematics and Computer Science, 2016 In recent years, FCA has received significant attention from research communities of various fields. Further, the theory of FCA is being extended into different frontiers and augmented with other knowledge representation frameworks.
Singh Prem Kumar +2 more
doaj +1 more source
On the fixed‐point proportion of self‐similar groups
Bulletin of the London Mathematical Society, Volume 58, Issue 7, July 2026.Abstract We prove that super strongly fractal groups acting on regular rooted trees have null fixed‐point proportion. In particular, we show that the fixed‐point proportion of an infinite family of iterated monodromy groups of exceptional complex polynomials has the same property.
Jorge Fariña‐Asategui, Santiago Radi
wiley +1 more source
An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection. [PDF]
, 2011 The complexity of any optimisation problem depends critically on the form of the objective function. Valued constraint satisfaction problems are discrete optimisation problems where the function to be minimised is given as a sum of cost functions defined
Jeavons, PG +5 more
core +2 more sources
Quasi‐convex surface subgroups in some one‐relator groups with torsion
Bulletin of the London Mathematical Society, Volume 58, Issue 7, July 2026.Abstract We find surface subgroups in certain one‐relator groups with torsion and use this to deduce a profinite criterion for a word in the free group to be primitive.
Andrew Ng
wiley +1 more source