Results 31 to 40 of about 1,175,834 (208)
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 +2 more
doaj +1 more source
On the notion of indiscernibility in the light of Galois-Grothendieck Theory [PDF]
, 2013 We analyze the notion of indiscernibility in the light of the Galois theory of field extensions and the generalization to K-algebras proposed by Grothendieck.
Catren, Gabriel, Page, Julien
core
Galois structure of Zariski cohomology for weakly ramified covers of curves
, 2004 We compute equivariant Euler characteristics of locally free sheaves on curves, thereby generalizing several results of Kani and Nakajima. For instance, we extend Kani's computation of the Galois module structure of the space of global meromorphic ...
Koeck, Bernhard
core +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
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
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
Global Solvably Closed Anabelian Geometry [PDF]
, 2006 In this paper, we study the pro-Σ anabelian geometry of hyperbolic curves, where Σ is a nonempty set of prime numbers, over Galois groups of “solvably closed extensions” of number fields — i.e., infinite extensions of number fields which have ...
Mochizuki, Shinichi
core +1 more source
Universal properties of Delannoy categories
Journal of the London Mathematical Society, Volume 114, Issue 4, October 2026.Abstract Recently, Harman and Snowden introduced a new symmetric tensor category Perm̲(G,μ)$\operatorname{\underline{Perm}}(G, \mu)$ associated with an oligomorphic group G$G$ with a measure μ$\mu$. When G$G$ is the group of order‐preserving self‐bijections of the real line there are four such measures, and the resulting tensor categories are called ...
Kevin Coulembier +2 more
wiley +1 more source
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
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