Related papers: A Note on Categories about Rough Sets

We consider the problem of category-level 6D pose estimation from a single RGB image. Our approach represents an object category as a cuboid mesh and learns a generative model of the neural feature activations at each mesh vertex to perform…

An orthoset is a non-empty set together with a symmetric and irreflexive binary relation $\perp$, called the orthogonality relation. An orthoset with 0 is an orthoset augmented with an additional element 0, called falsity, which is…

We give a self-contained introduction to accessible categories and how they shed light on both model- and set-theoretic questions. We survey for example recent developments on the study of presentability ranks, a notion of cardinality…

This paper considers the difficulty in the set-system approach to generalizing graph theory. These difficulties arise categorically as the category of set-system hypergraphs is shown not to be cartesian closed and lacks enough projective…

We introduce a version of skein categories of surfaces which depends on a tensor ideal in a linear ribbon category, thereby extending the existing theory to the setting of non-semisimple TQFTs. We obtain modified notions of skein algebras…

The concept of relative sectional category expands upon classical sectional category theory by incorporating the pullback of a fibration along a map. Our paper aims not only to explore this extension but also to thoroughly investigate its…

For a category $\mathbb{C}$, a small category $\mathbb{I}$, and a pre-cover relation $\sqsubset$ on $\mathbb C$ we prove, under certain completeness assumptions on $\mathbb C$, that a morphism $g: B\to C$ in the functor category $\mathbb…

A $\mathcal{C}$-set is a functor from the category $\mathcal{C}$ to the category of finite sets and functions. The category of $\mathcal{C}$-sets, $\mathcal{C} - \operatorname*{set}$, is defined as the category whose objects are…

Theories of rough sets and soft sets are powerful mathematical tools for modelling various types of vagueness. Hybrid model combining a rough set with a soft set which is called soft rough set proposed by Feng et al. [3] in 2010. In this…

In this paper, we plan to build upon significant results by Amnon Neeman regarding the homotopy category of flat modules to study ${\mathbb{K}}({S\rm{SF}}\mbox{-}R)$, the homotopy category of $S$-strongly flat modules, where $S$ is a…

We call a function $f$ in $C(X)$ to be hard-bounded if $f$ is bounded on every hard subset, a special kind of closed subset, of $X$. We call a subset $T$ of $X$ to be $S$-embedded if every hard-bounded continuous function of $T$ can be…

I discuss possible definitions of categories of vector spaces enriched with a notion of formal infinite linear combination in the likes of the formal infinite linear combinations one has in the context of generalized power series, I call…

For a nice-enough category $\mathcal{C}$, we construct both the morphism category ${\rm H}(\mathcal{C})$ of $\mathcal{C}$ and the category ${\rm mod}\mbox{-}\mathcal{C}$ of all finitely presented contravariant additive functors over…

A near-group category is an additively semisimple category with a product such that all but one of the simple objects is invertible. We classify braided structures on near-group categories, and give explicit numerical formulas for their…

Algebraically, entropy can be defined for abelian groups and their endomorphisms, and was latter extended to consider objects in a Flow category derived from abelian categories, such as $R\textit{-}Mod$ with $R$ a ring. Preradicals are…

Let $\mathcal{X}$ be a resolving and contravariantly finite subcategory of $\rm{mod}\mbox{-}\Lambda$, the category of finitely generated right $\Lambda$-modules. We associate to $\mathcal{X}$ the subcategory…

We show that a functor category whose domain is a colored category is a topos.The topos structure enables us to introduce cohomology of colored categories including quasi-schemoids. If the given colored category arises from an association…

Domain generalization asks for models trained over a set of training environments to generalize well in unseen test environments. Recently, a series of algorithms such as Invariant Risk Minimization (IRM) have been proposed for domain…

In this paper we study the strict refinement property for connected partial ordersalso known as Hashimoto's Theorem. This property implies that any isomorphismbetween products of irreducible structures is determined is uniquely determinedas…

There are two widely held characterizations of human semantic category systems: (1) they form convex partitions of conceptual spaces, and (2) they are efficient for communication. While prior work observed that convexity and efficiency…