Related papers: Betweenness relations in a categorical setting
In \cite[Rem. 3.4]{DNO} the authors asked the question if any \'etale subalgebra of an \'etale algebra in a braided fusion category is also \'etale. We give a positive answer to this question if the braided fusion category $\cc$ is…
The paper explores categorical interconnections between lattice-valued Relational systems and algebras of Fitting's lattice-valued modal logic. We define lattice-valued boolean systems, and then we study co-adjointness, adjointness of…
It is proved that MacLane's coherence results for monoidal and symmetric monoidal categories can be extended to some other categories with multiplication; namely, to relevant, affine and cartesian categories. All results are formulated in…
We obtain, via the formalism of tensor actions, a complete classification of the localizing subcategories of the stable derived category of any affine scheme with hypersurface singularities and of any local complete intersection over a…
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…
By homotopy linear algebra we mean the study of linear functors between slices of the $\infty$-category of $\infty$-groupoids, subject to certain finiteness conditions. After some standard definitions and results, we assemble said slices…
Intervals in binary or n-ary relations or other discrete structures generalize the concept of interval in a linearly ordered set. Join-irreducible partitions into intervals are characterized in the lattice of all interval decompositions of…
We develop the theory of exact completions of regular $\infty$-categories, and show that the $\infty$-categorical exact completion (resp. hypercompletion) of an abelian category recovers the connective half of its bounded (resp. unbounded)…
Skew lattices are non-commutative generalizations of lattices. The coset structure decomposition is an original approach to the study of these algebras describing the relation between its rectangular classes. In this paper we will look at…
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…
We extend the calculus of relations to embed a regular category A into a family of pseudo-abelian tensor categories T(A,d) depending on a degree function d. Under the condition that all objects of A have only finitely many subobjects, our…
We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations -- that is, as quotients of term algebras over decidable sets…
We categorify the notion of an infinitesimal braiding in a linear strict symmetric monoidal category, leading to the notion of a (strict) infinitesimal 2-braiding in a linear symmetric strict monoidal 2-category. We describe the associated…
We show that all balanced d-lattices must be complemented, answering a question of Chajda and Eigenthaler. (A bounded lattice is balanced if any two congruences agree on their 1-classes iff they agree on their 0-classes.) Our main tool is…
For a class C of finite lattices, the question arises whether any lattice in C can be embedded into some atomistic, biatomic lattice in C. We provide answers to the question above for C being, respectively, --The class of all finite…
We utilize the Bruns-Lakser completion to introduce Bruns-Lakser towers of a meet-semilattice. This machinery enables us to develop various hierarchies inside the class of bounded distributive lattices, which measure $\kappa$-degrees of…
A specialization semilattice is a semilattice together with a coarser preorder satisfying a compatibility condition. We show that the category of specialization semilattices is isomorphic to the category of semilattices with a congruence,…
When studying quantum field theories and lattice models, it is often useful to analytically continue the number of field or spin components from an integer to a real number. In spite of this, the precise meaning of such analytic…
While any infimum in a poset can also be computed as a supremum, and vice versa, categorical limits and colimits do not always approximate each other. If I approach a point from below, and you approach it from above, then we will surely…
We study the classification of submodules of module categories over monoidal categories, extending ideas of Coulembier on the classification of tensor ideals in monoidal categories. We develop a framework that applies to module categories…