Related papers: Sketchable infinity categories
The immense amount of daily generated and communicated data presents unique challenges in their processing. Clustering, the grouping of data without the presence of ground-truth labels, is an important tool for drawing inferences from data.…
In this paper, we justify and make precise an elementary approach that establishes the existence of (co)limits in $\mathbf{Cat}$. This approach, while conceptually evident, has not been made fully explicit or systematically described in the…
We present the first definition of strictly associative and unital $\infty$-category. Our proposal takes the form of a type theory whose terms describe the operations of such structures, and whose definitional equality relation enforces…
The simplex graph $S(G)$ of a graph $G$ is defined as the graph whose vertices are the cliques of $G$ (including the empty set), with two vertices being adjacent if, as cliques of $G$, they differ in exactly one vertex. Simplex graphs form…
We introduce the notion of weighted limit in an arbitrary quasi-category, suitably generalizing ordinary limits in a quasi-category, and classical weighted limits in an ordinary category. This is accomplished by generalizing Joyal's…
We define a notion of a connectivity structure on an $\infty$-category, analogous to a $t$-structure but applicable in unstable contexts -- such as spaces, or algebras over an operad. This allows us to generalize notions of n-skeleta,…
An outstanding open question posed by Guha and Indyk in 2006 asks to characterize metric spaces in which distances can be estimated using efficient sketches. Specifically, we say that a sketching algorithm is efficient if it achieves…
Sofic and hyperlinear groups are the countable discrete groups that can be approximated in a suitable sense by finite symmetric groups and groups of unitary matrices. These notions turned out to be very deep and fruitful, and stimulated in…
Constructing and manipulating homotopy types from categorical input data has been an important theme in algebraic topology for decades. Every category gives rise to a `classifying space', the geometric realization of the nerve. Up to weak…
There are many ways to present model categories, each with a different point of view. Here we'd like to treat model categories as a way to build and control resolutions. This an historical approach, as in his original and spectacular…
We show that the category of graphs has the structure of a 2-category with homotopy as the 2-cells. We then develop an explicit description of homotopies for finite graphs, in terms of what we call `spider moves'. We then create a category…
Sketching is a powerful tool for creating abstract images that are sparse but meaningful. Sketch understanding poses fundamental challenges for general-purpose vision algorithms because it requires robustness to the sparsity of sketches…
The data for many useful bidirectional constructions in applied category theory (optics, learners, games, quantum combs) can be expressed in terms of diagrams containing "holes" or "incomplete parts", sometimes known as comb diagrams. We…
A model category is called combinatorial if it is cofibrantly generated and its underlying category is locally presentable. As shown in recent years, homotopy categories of combinatorial model categories share useful properties, such as…
Limits of graphs were initiated recently in the two extreme contexts of dense and bounded degree graphs. This led to elegant limiting structures called graphons and graphings. These approach have been unified and generalized by authors in a…
A constraint satisfaction problem (CSP), $\textsf{Max-CSP}(\mathcal{F})$, is specified by a finite set of constraints $\mathcal{F} \subseteq \{[q]^k \to \{0,1\}\}$ for positive integers $q$ and $k$. An instance of the problem on $n$…
We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several…
Generalizing pseudospherical drawings, we introduce a new class of simple drawings, which we call separable drawings. In a separable drawing, every edge can be closed to a simple curve that intersects each other edge at most once. Curves of…
Sketching is a randomized dimensionality-reduction method that aims to preserve relevant information in large-scale datasets. Count sketch is a simple popular sketch which uses a randomized hash function to achieve compression. In this…
A certain amount of category theory is developed in an arbitrary finitely complete category with a factorization system on it, playing the role of the comprehensive factorization system on Cat. Those aspects related to the concepts of…