Related papers: Sketchable infinity categories
We consider an action of a countable amenable group on a compact metric space, focusing on the set of generic points with respect to a fixed F{\o}lner sequence. For a given characteristic class, we prove that the set of points that are…
In this short paper, using category theory, we argue that logical rules can be seen as fractions and logics as limit sketches.
Sketches, probabilistic structures for estimating item frequencies in infinite data streams with limited space, are widely used across various domains. Recent studies have shifted the focus from handcrafted sketches to neural sketches,…
Sketch drawings capture the salient information of visual concepts. Previous work has shown that neural networks are capable of producing sketches of natural objects drawn from a small number of classes. While earlier approaches focus on…
We present a sketch-based CAD modeling system, where users create objects incrementally by sketching the desired shape edits, which our system automatically translates to CAD operations. Our approach is motivated by the close similarities…
Given a database, computing the fraction of rows that contain a query itemset or determining whether this fraction is above some threshold are fundamental operations in data mining. A uniform sample of rows is a good sketch of the database…
This article introduces Hilbert $*$-categories: an abstraction of categories with similar algebraic and analytic properties to the categories of real, complex, and quaternionic Hilbert spaces and bounded linear maps. Other examples include…
Topologists are sometimes interested in space-valued diagrams over a given index category, but it is tricky to say what such a diagram even is if we look for a notion that is stable under equivalence. The same happens in (homotopy) type…
Sketches have shown high accuracy in multi-way join cardinality estimation, a critical problem in cost-based query optimization. Accurately estimating the cardinality of a join operation -- analogous to its computational cost -- allows the…
Restriction categories were introduced to provide an axiomatic setting for the study of partially defined mappings; they are categories equipped with an operation called restriction which assigns to every morphism an endomorphism of its…
We identify a connection between the approximability of CSPs in two models: (i) sublinear space streaming algorithms, and (ii) the basic LP relaxation. We show that whenever the basic LP admits an integrality gap, there is an…
This paper is the first in a series of two papers, $\mathbf{Z}$-Categories I and $\mathbf{Z}$-Categories II, which develop the notion of $\mathbf{Z}$-category, the natural bi-infinite analog to strict $\omega$-categories, and show that the…
We define and study the $(\infty,2)$-category $\mathbf{Cat}_{\infty}(\mathcal{C})$ of $(\infty,1)$-categories internal to a general $(\infty,1)$-category $\mathcal{C}$ via an associated externalization construction. In the first part, we…
Homotopy limits and colimits are homotopical replacements for the usual limits and colimits of category theory, which can be approached either using classical explicit constructions or the modern abstract machinery of derived functors. Our…
We introduce shortcut graphs and groups. Shortcut graphs are graphs in which cycles cannot embed without metric distortion. Shortcut groups are groups which act properly and cocompactly on shortcut graphs. These notions unify a surprisingly…
We prove that a connected, locally finite, quasi-transitive graph which is quasi-isometric to a planar graph is necessarily accessible. This leads to a complete classification of the finitely generated groups which are quasi-isometric to…
We study homotopy theory of the category of spectral sequences with respect to the class of weak equivalences given by maps which are quasi-isomorphisms on a fixed page. We introduce the category of extended spectral sequences and show that…
We show that the category of pastures has arbitrary limits and colimits of diagrams indexed by a small category.
In the standard Category of Graphs, the graphs allow only one edge to be incident to any two vertices, not necessarily distinct, and the graph morphisms must map edges to edges and vertices to vertices while preserving incidence. We refer…
A new approach is suggested to the problem of quantising causal sets, or topologies, or other such models for space-time (or space). The starting point is the observation that entities of this type can be regarded as objects in a category…