相关论文: The Maximality of Cartesian Categories

We introduce a reducibility on classes of structures, essentially a uniform enumeration reducibility. This reducibility is inspired by the Friedman-Stanley paper on using Borel reductions to compare classes of countable structures. This…

Several important types of categories have been shown to be both exact and coexact (in the sense of Barr). The first type consists of abelian categories, which due to their self-dual definition, can be seen to be both exact and coexact by…

We show that in the category of preordered sets, there is a natural notion of pretorsion theory, in which the partially ordered sets are the torsion-free objects and the sets endowed with an equivalence relation are the torsion objects.…

Many types of categorical structure obey the following principle: the natural notion of equivalence is generated, as an equivalence relation, by identifying $A$ with $B$ when there exists a strictly structure-preserving map $A \to B$ that…

Compact categories have lately seen renewed interest via applications to quantum physics. Being essentially finite-dimensional, they cannot accomodate (co)limit-based constructions. For example, they cannot capture protocols such as quantum…

Berge's maximum theorem gives conditions ensuring the continuity of an optimised function as a parameter changes. In this paper we state and prove the maximum theorem in terms of the theory of monoidal topology and the theory of double…

We study and relate categories of modules, comodules and contramodules over a representation of a small category taking values in (co)algebras, in a manner similar to modules over a ringed space. As a result, we obtain a categorical…

The feasibility of a classification-by-rank program for modular categories follows from the Rank-Finiteness Theorem. We develop arithmetic, representation theoretic and algebraic methods for classifying modular categories by rank. As an…

The problem of determining when a (classical) crossed product $T=S^f*G$ of a finite group $G$ over a discrete valuation ring $S$ is a maximal order, was answered in the 1960's for the case where $S$ is tamely ramified over the subring of…

This work creates two categories of "array-weighted sets" for the purposes of constructing universal matrix-normed spaces and algebras. These universal objects have the analogous universal property to the free vector space, lifting maps…

Necessary conditions for high-order optimality in smooth nonlinear constrained optimization are explored and their inherent intricacy discussed. A two-phase minimization algorithm is proposed which can achieve approximate first-, second-…

Maps (left adjoint arrows) between Frobenius objects in a cartesian bicategory B are precisely comonoid homomorphisms and, for A Frobenius and any T in B, map(B)(T,A) is a groupoid.

In this paper we generalise the notion of linearity (in the sense of Lawvere) to a category C equipped with a compatible sum structure and product structure. In this context, any morphism f from an n-fold sum to an n-fold product has a…

We firstly prove the completeness of the category of crossed modules in a modified category of interest. Afterwards, we define pullback crossed modules and pullback cat$^1$-objects that are both obtained by pullback diagrams with extra…

In this paper we study prime, maximal and two--class congruences from the point of view of the relationships between them in various kinds of universal algebras, as well as their direct and inverse images through morphisms. This research…

Category theory unifies mathematical concepts, aiding comparisons across structures by incorporating objects and morphisms, which capture their interactions. It has influenced areas of computer science such as automata theory, functional…

In flowchart languages, predicates play an interesting double role. In the textual representation, they are often presented as conditions, i.e., expressions which are easily combined with other conditions (often via Boolean combinators) to…

A variety is a category of ordered (finitary) algebras presented by inequations between terms. We characterize categories enriched over the category of posets which are equivalent to a variety. This is quite analogous to Lawvere's classical…

It was proved that for any finite set of elements of a free product of residually finite groups such that no two of them belong to conjugate cyclic subgroups and each of them do not belong to a subgroup which is conjugate a to free factor…

In fair division of indivisible goods, using sequences of sincere choices (or picking sequences) is a natural way to allocate the objects. The idea is the following: at each stage, a designated agent picks one object among those that…