相关论文: Updown Categories

The interleaving distance, although originally developed for persistent homology, has been generalized to measure the distance between functors modeled on many posets or even small categories. Existing theories require that such a poset…

We develop category theory within Univalent Foundations, which is a foundational system for mathematics based on a homotopical interpretation of dependent type theory. In this system, we propose a definition of "category" for which equality…

In this paper, we introduce the notion of the containment graph of a family of sets and containment classes of graphs and posets. Let $Z$ be a family of nonempty sets. We call a (simple, finite) graph G = (V, E) a $Z$-containment graph…

Given a family $\F$ of posets closed under disjoint unions and the operation of taking convex subposets, we construct a category $\C_{\F}$ called the \emph{incidence category of $\F$}. This category is "nearly abelian" in the sense that all…

Let A, B, S be categories, let F:A-->S and G:B-->S be functors. We assume that for "many" objects a in A, there exists an object b in B such that F(a) is isomorphic to G(b). We establish a general framework under which it is possible to…

We introduce relative homological and weakly homological categories, where ``relative'' refers to a distinguished class of normal epimorphisms. It is a generalization of homological categories, but also protomodular categories can be…

Morphisms between (formal) contexts are certain pairs of maps, one between objects and one between attributes of the contexts in question. We study several classes of such morphisms and the connections between them. Among other things, we…

A cocycle category H(X,Y) is defined for objects X and Y in a model category, and it is shown that the set of morphisms [X,Y] is isomorphic to the set of path components of H(X,Y) provided the ambient model category is right proper and…

Orbits of automorphism groups of partially ordered sets are not necessarily congruence classes, i.e. images of an order homomorphism. Based on so-called orbit categories a framework of factorisations and unfoldings is developed that…

Adhesive categories are categories which have pushouts with one leg a monomorphism, all pullbacks, and certain exactness conditions relating these pushouts and pullbacks. We give a new proof of the fact that every topos is adhesive. We also…

Comparability graphs are graphs which have transitive orientations. The dimension of a poset is the least number of linear orders whose intersection gives this poset. The dimension ${\rm dim}(X)$ of a comparability graph $X$ is the…

We define biprops as a generalization of coloured props and of symmetric weak multicategories. These are bicategories whose objects form a free monoid. They are equipped with some structure resembling a symmetric strict tensor product. We…

An unlabeled poset is said to be (2+2)-free if it does not contain an induced subposet that is isomorphic to 2+2, the union of two disjoint 2-element chains. Let $p_n$ denote the number of (2+2)-free posets of size $n$. In a recent paper,…

Given a monoidal $\infty$-category $C$ equipped with a monoidal recollement, we give a simple criterion for an object in $C$ to be dualizable in terms of the dualizability of each of its factors and a projection formula relating them.…

This paper first gives a necessary and sufficient condition that a lattice $L$ can be represented as the collection of all up-sets of a poset. Applying the condition, it obtains a necessary and sufficient condition that a lattice can be…

Apportionment refers to the well-studied problem of allocating legislative seats among parties or groups with different entitlements. We present a multi-level generalization of apportionment where the groups form a hierarchical structure,…

Soft set theory can deal uncertainties in nature by parametrization process. In this paper, we explore the objects and morphisms of category of soft sets, Sset(U) in detail. Also, gives characterizations of monomorphisms and epimorphisms in…

A causal set is a countably infinite poset in which every element is above finitely many others; causal sets are exactly the posets that have a linear extension with the order-type of the natural numbers -- we call such a linear extension a…

A groupoid is a small category in which all morphisms are isomorphisms. An inductive groupoid is a specialised groupoid whose object set is a regular biordered set and the morphisms admit a partial order. A normal category is a specialised…

It is sometimes desirable in choiceless constructions of set theory that one iteratively extends some ground model without adding new sets of ordinals after the first extension. Pushing this further, one may wish to have models $V \subseteq…