Related papers: On Interval Decomposability of 2D Persistence Modu…
Decomposition is a proven way to shrink deep networks without changing input-output dimensionality or interface semantics. We bring this idea to hyperdimensional computing (HDC), where footprint cuts usually shrink the feature axis and…
The decomposition of the polynomials on the quaternionic unit sphere in $\Hd$ into irreducible modules under the action of the quaternionic unitary (symplectic) group and quaternionic scalar multiplication has been studied by several…
A natural generalization of the recognition problem for a geometric graph class is the problem of extending a representation of a subgraph to a representation of the whole graph. A related problem is to find representations for multiple…
Let $k$ be an algebraically closed field of characteristic 2. We compute the vertices of all indecomposable $kD_8$-modules for the dihedral group $D_8$ of order 8. We also give a conjectural formula of the induced module of a string module…
We show that the moduli problem of deformations of nilpotent displays by quasi-isogenies is representable, without using $p$-divisible groups. The main ingredients are Artin's criterion and the theory of truncated displays. This gives in…
Local conditions for the direct summands of a persistence module to belong to a certain class of indecomposables have been proposed in the 2-parameter setting, notably for the class of indecomposables called block modules, which plays a…
Let V be the space of 2x2x2 complex hypermatrices, endowed with the natural group action of GL=GL(2,C)^3. The category of GL-equivariant coherent D-modules on V is equivalent to the category of representations of a quiver with relations. In…
Temporal or spatial structures are readily extracted from complex data by modal decompositions like Proper Orthogonal Decomposition (POD) or Dynamic Mode Decomposition (DMD). Subspaces of such decompositions serve as reduced order models…
Given a linear category over a finite field such that the moduli space of its objects is a smooth Artin stack (and some additional conditions) we give formulas for an exponential sum over the set of absolutely indecomposable objects and a…
Let $\mathbf{k}$ be an algebraically closed field. Recently, K. Erdmann classified the symmetric $\mathbf{k}$-algebras $\Lambda$ of finite representation type such that every non-projective module $M$ has period dividing four. The goal of…
The ability to learn disentangled representations that split underlying sources of variation in high dimensional, unstructured data is important for data efficient and robust use of neural networks. While various approaches aiming towards…
Matrix reduction is the standard procedure for computing the persistent homology of a filtered simplicial complex with $m$ simplices. Its output is a particular decomposition of the total boundary matrix, from which the persistence diagrams…
Persistent homology encodes the evolution of homological features of a multifiltered cell complex in the form of a multigraded module over a polynomial ring, called a multiparameter persistence module, and quantifies it through invariants…
Using a representation theoretic parameterization for the orbits in the enhanced cyclic nilpotent cone, derived by the authors in a previous article, we compute the fundamental group of these orbits. This computation has several…
Combining results from Keller and Buchweitz, we describe the 1-periodic derived category of a finite dimensional algebra $A$ of finite global dimension as the stable category of maximal Cohen-Macaulay modules over some Gorenstein algebra…
An integer sequence that is defined by initial values and a linear recurrence with constant integer coefficients, can be represented by the difference of two arithmetic terms containing exponentiation. All constants occuring in the term are…
This article develops a theory of cell combinatorics and cell 2-representations for differential graded 2-categories. We introduce two types of partial preorders, called the strong and weak preorder. We then analyse and compare them. The…
It has been shown that $1$-parameter persistence modules have a very simple classification, namely there is a discrete invariant called a barcode that completely characterizes $1$-parameter persistence modules up to isomorphism. In…
This paper introduces a novel approach to multi-parameter persistence using 2-categorical structures. We develop a framework that captures hierarchical interactions between filter parameters, overcoming fundamental limitations of…
We introduces the umodules, a generalisation of the notion of graph module. The theory we develop captures among others undirected graphs, tournaments, digraphs, and $2-$structures. We show that, under some axioms, a unique decomposition…