English
Related papers

Related papers: Sketchable infinity categories

200 papers

In this paper we characterize those accessible $\mathcal V$-categories that have limits of a specified class. We do this by introducing the notion of companion $\mathfrak C$ for a class of weights $\Psi$, as a collection of special types of…

Category Theory · Mathematics 2023-06-23 Stephen Lack , Giacomo Tendas

Recently, sketches have been introduced as a general language for representing the subgoal structure of instances drawn from the same domain. Sketches are collections of rules of the form C -> E over a given set of features where C…

Artificial Intelligence · Computer Science 2022-03-29 Dominik Drexler , Jendrik Seipp , Hector Geffner

We use the terms "$\infty$-categories" and "$\infty$-functors" to mean the objects and morphisms in an "$\infty$-cosmos." Quasi-categories, Segal categories, complete Segal spaces, naturally marked simplicial sets, iterated complete Segal…

Category Theory · Mathematics 2019-09-23 Emily Riehl , Dominic Verity

One of the major advantages of $\infty$-category theory over classical $1$-category theory is its robust and homotopically meaningful framework for taking (co)limits of diagrams of $\infty$-categories. However, it is both subtle and crucial…

Category Theory · Mathematics 2026-01-15 David Barnes , Niall Taggart

Data constraints are fundamental for practical data modelling, and a verifiable conformance of a data instance to a safety-critical constraint (satisfaction relation) is a corner-stone of safety assurance. Diagrammatic constraints are…

Logic in Computer Science · Computer Science 2023-06-29 Zinovy Diskin

We introduce and study a purely syntactic notion of lax cones and $(\infty,\infty)$-limits on finite computads in \texttt{CaTT}, a type theory for $(\infty,\infty)$-categories due to Finster and Mimram. Conveniently, finite computads are…

Category Theory · Mathematics 2025-12-01 Thomas Jan Mikhail

We define for each $n \geq 1$ a symmetric monoidal $(\infty, n+1)$-category $n\mathrm{Pr}^L$ whose objects we call presentable $(\infty,n)$-categories, generalizing the usual theory of presentable $(\infty,1)$-categories. We show that each…

Algebraic Topology · Mathematics 2020-11-06 Germán Stefanich

We show that metric abstract elementary classes (mAECs) are, in the sense of [LR] (i.e. arXiv:1404.2528), coherent accessible categories with directed colimits, with concrete $\aleph_1$-directed colimits and concrete monomorphisms. More…

Logic · Mathematics 2017-03-30 Michael Lieberman , Jiri Rosicky

In this paper we give a summary of the comparisons between different definitions of so-called (\infty,1)-categories, which are considered to be models for \infty-categories whose n-morphisms are all invertible for n>1. They are also, from…

Algebraic Topology · Mathematics 2007-05-23 Julia E. Bergner

The integration of knowledge extracted from different models described by domain experts or from models generated by machine learning algorithms is strongly conditioned by the lack of an appropriated framework to specify and integrate…

Logic in Computer Science · Computer Science 2016-04-12 Carlos Leandro

For a diagram of simplicial combinatorial model categories, we show that the associated lax limit, endowed with the projective model structure, is a presentation of the lax limit of the underlying $\infty$-categories. Our approach can also…

Algebraic Topology · Mathematics 2019-02-14 Yonatan Harpaz

In this note we characterize, within the framework of the theory of finite set, those categories of graphs that are {\em algebraic universal} in the sense that every concrete category embeds in them. The proof of the characterization is…

Category Theory · Mathematics 2016-08-04 J. Nesetril , P. Ossona de Mendez

In this work we aim to develop a universal sketch grouper. That is, a grouper that can be applied to sketches of any category in any domain to group constituent strokes/segments into semantically meaningful object parts. The first obstacle…

Computer Vision and Pattern Recognition · Computer Science 2018-08-08 Ke Li , Kaiyue Pang , Jifei Song , Yi-Zhe Song , Tao Xiang , Timothy M. Hospedales , Honggang Zhang

Structured high-cardinality data arises in many domains, and poses a major challenge for both modeling and inference. Graphical models are a popular approach to modeling structured data but they are unsuitable for high-cardinality…

Data Structures and Algorithms · Computer Science 2016-07-19 Branislav Kveton , Hung Bui , Mohammad Ghavamzadeh , Georgios Theocharous , S. Muthukrishnan , Siqi Sun

Data sketches are approximate succinct summaries of long streams. They are widely used for processing massive amounts of data and answering statistical queries about it in real-time. Existing libraries producing sketches are very fast, but…

Data Structures and Algorithms · Computer Science 2019-12-06 Arik Rinberg , Alexander Spiegelman , Edward Bortnikov , Eshcar Hillel , Idit Keidar , Lee Rhodes , Hadar Serviansky

In previous work, we introduce an axiomatic framework within which to prove theorems about many varieties of infinite-dimensional categories simultaneously. In this paper, we establish criteria implying that an $\infty$-category - for…

Category Theory · Mathematics 2020-07-17 Emily Riehl , Dominic Verity

Sketches are highly expressive, inherently capturing subjective and fine-grained visual cues. The exploration of such innate properties of human sketches has, however, been limited to that of image retrieval. In this paper, for the first…

Computer Vision and Pattern Recognition · Computer Science 2023-10-31 Pinaki Nath Chowdhury , Ayan Kumar Bhunia , Aneeshan Sain , Subhadeep Koley , Tao Xiang , Yi-Zhe Song

For any commutative ring $R$, we show that the categories of $R$-coalgebras and cocommutative $R$-coalgebras are locally $\aleph_1$-presentable, while the categories of $R$-flat $R$-coalgebras are $\aleph_1$-accessible. Similarly, for any…

Rings and Algebras · Mathematics 2025-07-25 Leonid Positselski

Coalgebras for an endofunctor provide a category-theoretic framework for modeling a wide range of state-based systems of various types. We provide an iterative construction of the reachable part of a given pointed coalgebra that is inspired…

Category Theory · Mathematics 2020-01-15 Thorsten Wißmann , Stefan Milius , Shin-ya Katsumata , Jérémy Dubut

We introduce the notion of an accessible $\infty$-cosmos and prove that these include the basic examples of $\infty$-cosmoi and are stable under the main constructions. A consequence is that the vast majority of known examples of…

Category Theory · Mathematics 2022-12-14 John Bourke , Stephen Lack