Results 41 to 50 of about 343 (169)

The Singular Value Decomposition over Completed Idempotent Semifields

open access: yesMathematics, 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

Galois connections for bilattices

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

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

A comprehensive survey on formal concept analysis, its research trends and applications

open access: yesInternational 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

Heights on ‘hybrid orbits’ in Shimura varieties

open access: yesProceedings of the London Mathematical Society, Volume 133, Issue 2, August 2026.
Abstract We prove the ‘hybrid conjecture’ which is a common generalisation of the André–Oort conjecture and the André–Pink–Zannier conjecture, in the case of Shimura varieties of abelian type.
Rodolphe Richard, Andrei Yafaev
wiley   +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

Fourier Expansion‐Based Approach to the Parameter Space of Classical Systems

open access: yesAnnalen der Physik, Volume 538, Issue 7, July 2026.
ABSTRACT We propose a new approach to compute the classical metric tensor (CMT) and the Hannay curvature using Fourier series expansions in action‐angle variables. This approach circumvents the need for complex time‐domain integrals or the construction of generating functions, replacing them with algebraic combinations of Fourier coefficients. We prove
Marcos J. Hernández   +3 more
wiley   +1 more source

FuzzyMind: A Web Platform for End‐to‐End Fuzzy Cognitive Map Modeling

open access: yesConcurrency and Computation: Practice and Experience, Volume 38, Issue 14, July 2026.
ABSTRACT Fuzzy cognitive maps (FCMs) are widely used for modeling complex causal systems under uncertainty. However, the FCM development lifecycle, encompassing data preprocessing, model construction, weight optimization, and scenario analysis, is typically fragmented across heterogeneous tools.
Theodoros Tziolas, Elpiniki Papageorgiou
wiley   +1 more source

On the fixed‐point proportion of self‐similar groups

open access: yesBulletin 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

Galois Connections for Recursive Types

open access: yes, 2020
Building a static analyser for a real language involves modeling of large domains capturing the many available data types. To scale domain design and support efficient development of project-specific analyzers, it is desirable to be able to build, extend, and change abstractions in a systematic and modular fashion.
Ahmad Salim Al-Sibahi   +3 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy