Related papers: A Theory of Sub-Barcodes
Lekkerkerker and Boland characterized the minimal forbidden induced subgraphs for the class of interval graphs. We give a linear-time algorithm to find one in any graph that is not an interval graph. Tucker characterized the minimal…
We compare the bicategory of spans with that of bisets (a.k.a. bimodules, distributors, profunctors) in the context of finite groupoids. We construct in particular a well-behaved pseudo-functor from spans to bisets. This yields an…
Given a pointwise finite-dimensional persistence module over a totally ordered set $S$, a theorem of Crawley-Boevey guarantees the existence of a barcode. When the set $S$ is finite, the persistence module is an equioriented type-A quiver…
Variable-length codes are the bases of the free submonoids of a free monoid. There are some important longstanding open questions about the structure of finite maximal codes. In this paper we discuss this conjectures and their relations…
We introduce a general unifying framework for the investigation of pointlike sets. The pointlike functors are considered as distinguished elements of a certain lattice of subfunctors of the power semigroup functor; in particular, we exhibit…
Tannaka Duality describes the relationship between algebraic objects in a given category and their representations; an important case is that of Hopf algebras and their categories of representations; these have strong monoidal forgetful…
We prove a new localization theorem for stable model categories if the localizing subcategory is generated by a precovering class in the model category. We use this to show how one may explicitly realize certain Bousfield localization…
Category theory has foundational importance because it provides conceptual lenses to characterize what is important in mathematics. Originally the main lenses were universal mapping properties and natural transformations. In recent decades,…
This article is first in a series of papers where we reprove the statements in constructing the Enhanced Operation Map and the abstract six-functor formalism developed by Liu-Zheng. In this paper, we prove a theorem regarding constructing…
With the resurgence of interest in neural networks, representation learning has re-emerged as a central focus in artificial intelligence. Representation learning refers to the discovery of useful encodings of data that make domain-relevant…
In this paper we introduce and investigate the notion of semiseparable functor. One of its first features is that it allows a novel description of separable and naturally full functors in terms of faithful and full functors, respectively.…
In this paper we develop the theory of topological categories over a base category, that is, a theory of topological functors. Our notion of topological functor is similar to (but not the same) the existing notions in the literature (see…
We characterize the class of persistence modules indexed over $\mathbb{R}^2$ that are decomposable into summands whose support have the shape of a {\em block}---i.e. a horizontal band, a vertical band, an upper-right quadrant, or a…
Given a pair of adjoint functors between two arbitrary categories it induces mutually inverse equivalences between the full subcategories of the initial ones, consisting of objects for which the arrows of adjunction are isomorphisms. We…
Binary classification is one of the most common problem in machine learning. It consists in predicting whether a given element belongs to a particular class. In this paper, a new algorithm for binary classification is proposed using a…
Given a DG-category A we introduce the bar category of modules Modbar(A). It is a DG-enhancement of the derived category D(A) of A which is isomorphic to the category of DG A-modules with A-infinity morphisms between them. However, it is…
Pseudo-Boolean constraints are omnipresent in practical applications, and thus a significant effort has been devoted to the development of good SAT encoding techniques for them. Some of these encodings first construct a Binary Decision…
The linear model, in which a set of observations is assumed to be given by a linear combination of columns of a matrix, has long been the mainstay of the statistics and signal processing literature. One particular challenge for inference…
Submodular maximization subject to matroid constraints is a central problem with many applications in machine learning. As algorithms are increasingly used in decision-making over datapoints with sensitive attributes such as gender or race,…
We introduce two novel complementary notions of the Lefschetz number for a functor from a finite acyclic category to itself and we prove a Lefschetz fixed-object theorem and a Lefschetz fixed-morphism theorem. In order to do so, we use the…