Related papers: N^d-indexed persistence modules, higher dimensiona…
Multiparameter persistent homology has been largely neglected as an input to machine learning algorithms. We consider the use of lattice-based convolutional neural network layers as a tool for the analysis of features arising from…
In recent years, persistence modules have been viewed as graded modules with gradation over a preordered set serving as the indexing set. We provide sufficient criteria for a projective module over a PID to be free when the indexing set is…
A long-standing question is what invariant sets can be shared by two maps acting on the same space. A similar question stands for invariant measures. A particular interesting case are expanding Markov maps of the circle. If the two involved…
We investigate the correspondence between generalized persistence modules and graded modules in the case the indexing set has a monoid action. We introduce the notion of an action category over a monoid graded ring. We show that the…
Persistent homology was shown by Carlsson and Zomorodian to be homology of graded chain complexes with coefficients in the graded ring $\kk[t]$. As such, the behavior of persistence modules -- graded modules over $\kk[t]$ is an important…
The nonlocal properties for a kind of generic N-dimensional bipartite quantum systems are investigated. A complete set of invariants under local unitary transformations is presented. It is shown that two generic density matrices are locally…
Random network coding recently attracts attention as a technique to disseminate information in a network. This paper considers a non-coherent multi-shot network, where the unknown and time-variant network is used several times. In order to…
Several natural partial orders on integral partitions, such as the embeddability, the stable embeddability, the bulk embeddability and the supermajorization, raise in the quantum computation, bin-packing and matrix analysis. We find the…
In recent years, many results have been established regarding classifications of varieties whose colength sequences are bounded by a fixed constant. In this work, we explore this theme in the setting of algebras endowed with a graded…
We consider the design of regenerating codes for distributed storage systems that enjoy the property of local, exact and uncoded repair, i.e., (a) upon failure, a node can be regenerated by simply downloading packets from the surviving…
We establish the essential normality of a large new class of homogeneous submodules of the finite rank d-shift Hilbert module. The main idea is a notion of essential decomposability that determines when an arbitrary submodule can be…
In 1991, Roth introduced a natural generalization of rank metric codes, namely tensor codes. The latter are defined to be subspaces of $r$-tensors where the ambient space is endowed with the tensor rank as a distance function. In this work,…
The matrix rank and its positive versions are robust for small approximations, i.e. they do not decrease under small perturbations. In contrast, the multipartite tensor rank can collapse for arbitrarily small errors, i.e. there may be a gap…
We consider the local rank-modulation scheme in which a sliding window going over a sequence of real-valued variables induces a sequence of permutations. Local rank-modulation is a generalization of the rank-modulation scheme, which has…
We define a class of multiparameter persistence modules that arise from a one-parameter family of functions on a topological space and prove that these persistence modules are stable. We show that this construction can produce…
As distributed systems increase in size, the need for scalable algorithms becomes more and more important. We argue that in the context of system identification, an essential building block of any scalable algorithm is the ability to…
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…
This article grew out of the theoretical part of my Master's thesis at the Faculty of Mathematics and Information Science at Ruprecht-Karls-Universit\"at Heidelberg under the supervision of PD Dr. Andreas Ott. Following the work of G.…
The use of topological persistence in contemporary data analysis has provided considerable impetus for investigations into the geometric and functional-analytic structure of the space of persistence modules. In this paper, we isolate a…
Let $\Lambda$ be a basic finite dimensional algebra over an algebraically closed field, presented as a path algebra modulo relations; further, assume that $\Lambda$ is graded by lengths of paths. The paper addresses the classifiability, via…