Related papers: Fixed points of adjoint functors enriched in a qua…
Formal Concept Analysis (FCA) begins from a context, given as a binary relation between some objects and some attributes, and derives a lattice of concepts, where each concept is given as a set of objects and a set of attributes, such that…
Representation theorems relate seemingly complex objects to concrete, more tractable ones. In this paper, we take advantage of the abstraction power of category theory and provide a general representation theorem for a wide class of…
We prove a fixpoint theorem for contractions on Cauchy-complete quantale-enriched categories. It holds for any quantale whose underlying lattice is continuous, and applies to contractions whose control function is sequentially…
Formal Concept Analysis (FCA) is an approach to creating a conceptual hierarchy in which a \textit{concept lattice} is generated from a \textit{formal context}. That is, a triple consisting of a set of objects, $G$, a set of attributes,…
In this paper, we propose two-sorted modal logics for the representation and reasoning of concepts arising from rough set theory (RST) and formal concept analysis (FCA). These logics are interpreted in two-sorted bidirectional frames, which…
We show how the relatively initial or relatively terminal fixed points for a well-behaved functor $F$ form a pair of adjoint functors between $F$-coalgebras and $F$-algebras. We use the language of locally presentable categories to find…
Graduated locally finitely presentable categories are introduced, examples include categories of sets, vector spaces, posets, presheaves and Boolean algebras. A finitary functor between graduated locally finitely presentable categories is…
Fixed points of scalar field theories with quartic interactions in $d=4-\varepsilon$ dimensions are considered in full generality. For such theories it is known that there exists a scalar function $A$ of the couplings through which the…
We survey several notions of Mackey functors and biset functors found in the literature and prove some old and new theorems comparing them. While little here will surprise the experts, we draw a conceptual and unified picture by making…
We apply the notion of relative adjoint functor to generalise closed monoidal categories. We define representations in such categories and give their relation with left actions of monoids. The translation of these representations under lax…
We investigate correspondence functors, namely the functors from the category of finite sets and correspondences to the category of $k$-modules, where $k$ is a commutative ring.They have various specific properties which do not hold for…
It is shown that every two-variable adjunction in categories enriched in a commutative quantale serves as a base for constructing Isbell adjunctions between functor categories, and Kan adjunctions are precisely Isbell adjunctions…
We prove an existence and uniqueness theorem for fixed points of contraction maps in the framework of quantum metric spaces, where distinguishability is defined by the $L^2$ norm: $d_Q(\psi_1,\psi_2) = \|\psi_1 - \psi_2\|$. The result…
A representation embedding between cartesian theories can be defined to be a functor between respective categories of models that preserves finitely-generated projective models and that preserves and reflects certain epimorphisms. This…
Rough sets are approximations of concrete sets. The theory of rough sets has been used widely for data-mining. While it is well-known that adjunctions are underlying in rough approximations, such adjunctions are not enough for…
Formal concept analysis (FCA) is a useful mathematical tool for obtaining information from relational datasets. One of the most interesting research goals in FCA is the selection of the most representative variables of the dataset, which is…
We prove general adjoint functor theorems for weakly (co)complete $n$-categories. This class of $n$-categories includes the homotopy $n$-categories of (co)complete $\infty$-categories, so these $n$-categories do not admit all small…
We establish coupled fixed point theorems for contraction involving rational expressions in partially ordered metric spaces.
Formal Concept Analysis (FCA) is a mathematical framework for knowledge representation and discovery. It performs a hierarchical clustering over a set of objects described by attributes, resulting in conceptual structures in which objects…
We introduce several classes of set-valued maps with generalized convexity. We obtain minimax theorems for set-valued maps which satisfy the introduced properties and are not continuous, by using a fixed point theorem for weakly naturally…