Related papers: Metagories
The notion of bounded ideals is introduced for quasi-metric spaces. Such ideals give rise to a monad, the bounded ideal monad, on the category of quasi-metric spaces and non-expansive maps. Algebras of this monad are metric version of local…
We characterize injective objects, injective hulls and essential embeddings in the category of symmetric categories enriched in a small, integral and involutive quantaloid. In particular, injective partial metric spaces are precisely…
We define a mapping space for Gray-enriched categories adapted to higher gauge theory. Our construction differs significantly from the canonical mapping space of enriched categories in that it is much less rigid. The two essential…
Roughly speaking, let us say that a map between metric spaces is large scale conformal if it maps packings by large balls to large quasi-balls with limited overlaps. This quasi-isometry invariant notion makes sense for finitely generated…
Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces.…
A mixed graph can be seen as a type of digraph containing some edges (two opposite arcs). Here we introduce the concept of sequence mixed graphs, which is a generalization of both sequence graphs and iterated line digraphs. These structures…
It is known that monoidal categories have a finite definition, whereas multicategories have an infinite (albeit finitary) definition. Since monoidal categories correspond to representable multicategories, it goes without saying that…
A geometric graph is a combinatorial graph, endowed with a geometry that is inherited from its embedding in a Euclidean space. Formulation of a meaningful measure of (dis-)similarity in both the combinatorial and geometric structures of two…
While many methods for learning vector space embeddings have been proposed in the field of Natural Language Processing, these methods typically do not distinguish between categories and individuals. Intuitively, if individuals are…
Category theory provides a powerful tool to organize mathematics. A sample of this descriptive power is given by the categorical analysis of the practice of "classes as shorthands" in ZF set theory. In this case category theory provides a…
Graphs are a useful abstraction of image content. Not only can graphs represent details about individual objects in a scene but they can capture the interactions between pairs of objects. We present a method for training a convolutional…
A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that "any graph is close to being the disjoint union of expanders". Our goal in this paper…
A duality between the category of convex spaces and measurable spaces arises from the existence of the unit interval, which is an object in both these categories. The full subcategory of the category of convex spaces, consisting of just the…
We develop a transitional geometry, that is, a family of geometries of constant curvatures which makes a continuous connec-tion between the hyperbolic, Euclidean and spherical geometries. In this transitional setting, several geometric…
In a metric space $M=(X,d)$, we say that $v$ is between $u$ and $w$ if $d(u,w)=d(u,v)+d(v,w)$. Taking all triples $\{u,v,w\}$ such that $v$ is between $u$ and $w$, one can associate a 3-uniform hypergraph with each finite metric space $M$.…
In this paper, we defined three kinds of measures depending on the given finite directed graphs. For the given finite directed graph, we can construct the free semigroupoid, the diagram set and the reduced diagram set, as algebraic…
Measurable sets are defined as those locally approximable, in a certain sense, by sets in the given algebra (or ring). A corresponding measure extension theorem is proved. It is also shown that a set is locally approximable in the mentioned…
$\omega$-periodic graphs are introduced and studied. These are graphs which arise as the limits of periodic extensions of the nearest neighbor graph on the integers. We observe that all bounded degree $\omega$-periodic graphs are ameanable.…
A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…
Adhesive and quasiadhesive categories provide a general framework for the study of algebraic graph rewriting systems. In a quasiadhesive category any two regular subobjects have a join which is again a regular subobject. Vice versa, if…