Related papers: A Theory of Sub-Barcodes

We consider all Bott-Samelson varieties ${\rm BS}(s)$ for a fixed connected semisimple complex algebraic group with maximal torus $T$ as the class of objects of some category. The class of morphisms of this category is an extension of the…

The purpose of this paper is to develop a theory of bimonads and Hopf monads on arbitrary categories thus providing the possibility to transfer the essentials of the theory of Hopf algebras in vector spaces to more general settings. There…

The definition of a pseudo-dualizing complex is obtained from that of a dualizing complex by dropping the injective dimension condition, while retaining the finite generatedness and homothety isomorphism conditions. In the specific setting…

A super-modular category is a unitary pre-modular category with M\"uger center equivalent to the symmetric unitary category of super-vector spaces. Super-modular categories are important alternatives to modular categories as any unitary…

We introduce a 3-dimensional categorical structure which we call intercategory. This is a kind of weak triple category with three kinds of arrows, three kinds of 2-dimensional cells and one kind of 3-dimensional cells. In one dimension, the…

A notion of a coring extension is defined and it is related to the existence of an additive functor between comodule categories that factorises through forgetful functors. This correspondence between coring extensions and factorisable…

Using full images of accessible functors, we prove some results about combinatorial and accessible model categories. In particular, we give an example of a weak factorization system on a locally presentable category which is not accessible.

This paper develops the idea of homology for 1-parameter families of topological spaces. We express parametrized homology as a collection of real intervals with each corresponding to a homological feature supported over that interval or,…

In network coding, a flag code is a collection of flags, that is, sequences of nested subspaces of a vector space over a finite field. Due to its definition as the sum of the corresponding subspace distances, the flag distance parameter…

We construct a diagram D, indexed by a finite partially ordered set, of finite Boolean semilattices and (v,0,1)-embeddings, with top semilattice $2^4$, such that for any variety V of algebras, if D has a lifting, with respect to the…

We introduce a new higher categorical structure called a weakly globular n-fold category. This structure is based on iterated internal categories and on the notion of weak globularity. We identify a suitable class of pseudo-functors whose…

Latent fibrations are an adaptation, appropriate for categories of partial maps (as presented by restriction categories), of the usual notion of fibration. The paper initiates the development of the basic theory of latent fibrations and…

This paper approaches, using structural complexity theory, the question of whether there is a chasm between knowing an object exists and getting one's hands on the object or its properties. In particular, we study the nontransparency of…

Half graphs and their variants, such as ladders, semi-ladders and co-matchings, are combinatorial objects that encode total orders in graphs. Works by Adler and Adler (Eur. J. Comb.; 2014) and Fabia\'nski et al. (STACS; 2019) prove that in…

Symmetry plays a fundamental role in understanding natural phenomena and mathematical structures. This work develops a comprehensive theory for studying the persistent symmetries and degree of asymmetry of finite point configurations over…

The hull of a linear code is defined as the intersection of the code and its dual. This concept was initially introduced to classify finite projective planes. The hull plays a crucial role in determining the complexity of algorithms used to…

We define a unified categorical framework for studying six subproblems arising from the classical Four Subspace Problem. For each subproblem, we construct a functor from its associated category to the category of representations of the…

Conventional unsupervised hashing methods usually take advantage of similarity graphs, which are either pre-computed in the high-dimensional space or obtained from random anchor points. On the one hand, existing methods uncouple the…

In this paper we propose and lay the foundations of a functorial framework for representing signals. By incorporating additional category-theoretic relative and generative perspective alongside the classic set-theoretic measure theory the…

The interleaving distance was originally defined in the field of Topological Data Analysis (TDA) by Chazal et al. as a metric on the class of persistence modules parametrized over the real line. Bubenik et al. subsequently extended the…