Related papers: A Theory of Sub-Barcodes
A natural connection between rational functions of several real or complex variables, and subspace collections is explored. A new class of function, superfunctions, are introduced which are the counterpart to functions at the level of…
We state and prove a stratification result that allows us to classify the tensor ideal localizing subcategories for the stable module category $\text{Stab}(\mathcal{C}_{(\mathfrak{g}, \mathfrak{g}_{\bar 0})})$ of Lie superalgbera…
A persistence module is a functor $f: \mathbf{I} \to \mathsf{E}$, where $\mathbf{I}$ is the poset category of a totally ordered set. This work introduces saecular decomposition: a categorically natural method to decompose $f$ into simple…
We study locally presentable categories equipped with a cofibrantly generated weak factorization system. Our main result is that these categories are closed under 2-limits, in particular under pseudopullbacks. We give applications to…
An emerging theory of "linear-algebraic pseudorandomness" aims to understand the linear-algebraic analogs of fundamental Boolean pseudorandom objects where the rank of subspaces plays the role of the size of subsets. In this work, we study…
Submodular functions have been studied extensively in machine learning and data mining. In particular, the optimization of submodular functions over the integer lattice (integer submodular functions) has recently attracted much interest,…
Submodular set-functions have many applications in combinatorial optimization, as they can be minimized and approximately maximized in polynomial time. A key element in many of the algorithms and analyses is the possibility of extending the…
We introduce graphcodes, a novel multi-scale summary of the topological properties of a dataset that is based on the well-established theory of persistent homology. Graphcodes handle datasets that are filtered along two real-valued scale…
We introduce a new combinatorial structure: the superselector. We show that superselectors subsume several important combinatorial structures used in the past few years to solve problems in group testing, compressed sensing, multi-channel…
As well-known, inner functions play an important role in the study of bounded analytic function theory. In recent years, persistence module theory, as a main tool applied to Topological Data Analysis, has received widespread attention. In…
An ideal invariant for multiparameter persistence would be discriminative, computable and stable. In this work we analyse the discriminative power of a stable, computable invariant of multiparameter persistence modules: the fibered bar…
The theory of persistence, which arises from topological data analysis, has been intensively studied in the one-parameter case both theoretically and in its applications. However, its extension to the multi-parameter case raises numerous…
A subunit in a monoidal category is a subobject of the monoidal unit for which a canonical morphism is invertible. They correspond to open subsets of a base topological space in categories such as those of sheaves or Hilbert modules. We…
In this paper, we introduce the signed barcode, a new visual representation of the global structure of the rank invariant of a multi-parameter persistence module or, more generally, of a poset representation. Like its unsigned counterpart…
We give a simple order-theoretic construction of a Cartesian closed category of sequential functions. It is based on bistable biorders, which are sets with a partial order -- the extensional order -- and a bistable coherence, which captures…
Category theory provides a collective description of many arrangements in mathematics, such as topological spaces, Banach spaces and game theory. Within this collective description, the perspective from any individual member of the…
In differential geometry, the existence of pullbacks is a delicate matter, since the category of smooth manifolds does not admit all of them. When pullbacks are required, often submersions are employed as an ideal class of maps which…
Effective descent morphisms, originally defined in Grothendieck descent theory, form a class of special morphisms within a category. Essentially, an effective descent morphism enables bundles over its codomain to be fully described as…
Two classes of turbo codes over high-order finite fields are introduced. The codes are derived from a particular protograph sub-ensemble of the (dv=2,dc=3) low-density parity-check code ensemble. A first construction is derived as a…
It is well-known that the category of presheaf functors is complete and cocomplete, and that the Yoneda embedding into the presheaf category preserves products. However, the Yoneda embedding does not preserve coproducts. It is perhaps less…