Related papers: Internalizing decorated bicategories: The globular…
A bilateralist take on proof-theoretic semantics can be understood as demanding of a proof system to display not only rules giving the connectives' provability conditions but also their refutability conditions. On such a view, then, a…
This paper introduces and studies split two-sided 2-fibrations and locally discrete split two-sided 2-fibrations, using a formal categorical approach. We generalise Street's notion of split two-sided fibration internal to a 2-category to…
In this paper we discuss the existence of solutions to vectorial differential inclusions. We investigate sufficient conditions for existence, more flexible than those available in the literature, so that important applications can be fitted…
Categories, n-categories, double categories, and multicategories (among others) all have similar definitions as collections of cells with composition operations. We give an explicit description of the information required to define any…
In this article, we introduce the concepts of graded $s$-prime submodules which is a generalization of graded prime submodules. We study the behavior of this notion with respect to graded homomorphisms, localization of graded modules,…
We construct an iterative method for factorising small strict n-categories into a unique (up to isomorphism) collection of small 1- categories. Following this we develop the theory to include a large class of $\infty$-categories. We use…
A ring with an Auslander dualizing complex is a generalization of an Auslander-Gorenstein ring. We show that many results which hold for Auslander-Gorenstein rings also hold in the more general setting. On the other hand we give criteria…
For a collection of subcategories satisfying a fixed set of conditions, for example thick subcategories of a triangulated category, we define a topological space called classifying space of subcategories. We show that this space classifies…
Indexed symmetric monoidal categories are an important refinement of bicategories -- this structure underlies several familiar bicategories, including the homotopy bicategory of parametrized spectra, and its equivariant and fiberwise…
We give criteria for subcategories of a compactly generated algebraic triangulated category to be precovering or preenveloping. These criteria are formulated in terms of closure conditions involving products, coproducts, directed homotopy…
The representation theory for categorical groups is constructed. Each categorical group determines a monoidal bicategory of representations. Typically, these categories contain representations which are indecomposable but not irreducible. A…
Bilinear maps and their classifying tensor products are well-known in the theory of linear algebra, and their generalization to algebras of commutative monads is a classical result of monad theory. Motivated by constructions needed in…
We define admissible and weakly admissible subcategories in exact categories and prove that the former induce semi-orthogonal decompositions on the derived categories. We develop the theory of thin exact categories, an exact-category…
In a general triangulated category, the finiteness of the finitistic dimension serves as a prerequisite for a categorical obstruction, via the singularity category, to the existence of bounded $t$-structures. In this paper, we investigate…
The set of factorizations of permutations in to $m$ transpositions of some symmetric group $\mathcal{S}_n$ is naturally in bijection with the set of graphs of order $n$ and size $m$ with both edges and vertices labeled. We define a notion…
Classification is a fundamental problem in machine learning and data mining. During the past decades, numerous classification methods have been presented based on different principles. However, most existing classifiers cast the…
We prove that every dualizable Grothendieck category whose dual is again a Grothendieck category satisfies Grothendieck's conditions Ab6 and Ab4*, by taking a module-theoretic approach based on the Gabriel-Popescu embedding. Combining this…
This presentation is the sequel of a paper published in GETCO'00 proceedings where a research program to construct an appropriate algebraic setting for the study of deformations of higher dimensional automata was sketched. This paper…
We consider the convex bilevel optimization problem, also known as simple bilevel programming. There are two challenges in solving convex bilevel optimization problems. Firstly, strong duality is not guaranteed due to the lack of Slater…
We study the parameterized complexity of the problems of finding a maximum common (induced) subgraph of two given graphs. Since these problems generalize several NP-complete problems, they are intractable even when parameterized by strongly…