Related papers: A Note on Categories about Rough Sets
Rough set theory, a mathematical tool to deal with inexact or uncertain knowledge in information systems, has originally described the indiscernibility of elements by equivalence relations. Covering rough sets are a natural extension of…
In the present paper, we propose a new axiomatic approach to nonstandard analysis and its application to the general theory of spatial structures in terms of category theory. Our framework is based on the idea of internal set theory, while…
The purpose of this paper is to show that the dual notions of elements & distinctions are the basic analytical concepts needed to unpack and analyze morphisms, duality, and universal constructions in the Sets, the category of sets and…
Recent models of intensional type theory have been constructed in algebraic weak factorization systems (AWFSs). AWFSs give rise to comprehension categories that feature non-trivial morphisms between types; these morphisms are not used in…
We introduce a 3-dimensional categorical structure which we call intercategory. This is a kind of weak triple category with three kinds of arrows, three kinds of 2-dimensional cells and one kind of 3-dimensional cells. In one dimension, the…
In this paper, the categorial property of compactness of an object, i. e. commuting of the corresponding $\Hom$ functor with coproducts, is studied in categories of $S$-acts and the corresponding structural properties of compact $S$-acts…
We propose definitions of regular and exact (virtual) double categories, proving a number of results which parallel many basic results in the theory of regular and exact categories. We show that any regular virtual double category admits a…
We develop aspects of functional analysis in an abstract axiomatic setting, through monoidal and enriched category theory. We work in a given closed category, whose objects we call spaces, and we study R-module objects therein (or algebras…
We introduce and develop the notion of *displayed categories*. A displayed category over a category C is equivalent to "a category D and functor F : D --> C", but instead of having a single collection of "objects of D" with a map to the…
We investigate Riguet congruences and generalized congruences on a category, focusing on their interrelations from both lattice-theoretic and category-theoretic perspectives. We also characterize functors that are full and surjective on…
Using full images of accessible functors, we prove some results about combinatorial and accessible model categories. In particular, we give an example of a weak factorization system on a locally presentable category which is not accessible.
The unprecedented pace of machine learning research has lead to incredible advances, but also poses hard challenges. At present, the field lacks strong theoretical underpinnings, and many important achievements stem from ad hoc design…
We propose a computationally efficient and high-performance classification algorithm by incorporating class structural information in analysis dictionary learning. To achieve more consistent classification, we associate a class…
We construct embeddings G of the category of graphs into categories of R-modules over a commutative ring R which are almost full in the sense that the maps induced by the functoriality of G R[Hom_Graphs(X,Y)] --> Hom_R(GX,GY) are…
Mathematical morphology contributes many profitable tools to image processing area. Some of these methods considered to be basic but the most important fundamental of data processing in many various applications. In this paper, we modify…
In this paper we introduce a notion of $\mathbf{O}$-monoidal $\infty$-categories for a finite sequence $\mathbf{O}^{\otimes}$ of $\infty$-operads, which is a generalization of the notion of higher monoidal categories in the setting of…
Heterogeneous information network (HIN) embedding aims to embed multiple types of nodes into a low-dimensional space. Although most existing HIN embedding methods consider heterogeneous relations in HINs, they usually employ one single…
We study locally presentable categories equipped with a cofibrantly generated weak factorization system. Our main result is that these categories are closed under 2-limits, in particular under pseudopullbacks. We give applications to…
We revisit once again the connection between three notions of computation: monads, arrows and idioms (also called applicative functors). We employ monoidal categories of finitary functors and profunctors on finite sets as models of these…
We define strict and lax orthogonal factorization systems on double categories. These consist of an orthogonal factorization system on arrows and one on double cells that are compatible with each other. Our definitions are motivated by…