Related papers: The structure and stability of persistence modules

We construct the irreducible unipotent modules of the finite general linear groups using tableaux. Our construction is analogous to that of James (1976) for the symmetric groups, answering an open question as to whether such a construction…

Coherence theorems for covariant structures carried by a category have traditionally relied on the underlying term rewriting system of the structure being terminating and confluent. While this holds in a variety of cases, it is not a…

We investigate the stability properties of an abstract class of semi-linear systems. Our main result establishes rational rates of decay for classical solutions assuming a certain non-uniform observability estimate for the linear part and…

The consistency problem for a class of algebraic structures asks for an algorithm to decide for any given conjunction of equations whether it admits a non-trivial satisfying assignment within some member of the class. By Adyan (1955) and…

We investigate dynamics near Turing patterns in reaction-diffusion systems posed on the real line. Linear analysis predicts diffusive decay of small perturbations. We construct a "normal form" coordinate system near such Turing patterns…

One of the most elusive challenges within the area of topological data analysis is understanding the distribution of persistence diagrams. Despite much effort, this is still largely an open problem. In this paper, we present a series of…

We show that static data structure lower bounds in the group (linear) model imply semi-explicit lower bounds on matrix rigidity. In particular, we prove that an explicit lower bound of $t \geq \omega(\log^2 n)$ on the cell-probe complexity…

We prove a regularity lemma with respect to arbitrary Keisler measures mu on V, nu on W where the bipartite graph (V,W,R) is definable in a saturated structure M and the formula R(x,y) is stable. The proof is rather quick and uses local…

We conduct a study of real-valued multi-parameter persistence modules as sheaves and cosheaves. Using the recent work on the homological algebra for persistence modules, we define two different convolution operations between derived…

In this paper, we introduce a persistent (co)homology theory for Cayley digraph grading. We give the algebraic structures of Cayley-persistence object. Specifically, we consider the module structure of persistent (co)homology and show the…

We offer elementary proofs for several results in consecutive pattern containment that were previously demonstrated using ideas from cluster method and analytical combinatorics. Furthermore, we establish new general bounds on the growth…

We see how nested sequents, a natural generalisation of hypersequents, allow us to develop a systematic proof theory for modal logics. As opposed to other prominent formalisms, such as the display calculus and labelled sequents, nested…

A lower bound for the interleaving distance on persistence vector spaces is given in terms of rank invariants. This offers an alternative proof of the stability of rank invariants.

The bedrock of persistence theory over a single parameter is decomposition of persistence modules into intervals. In [HLM24], the authors leveraged interval decomposition to produce a cell decomposition of the minimal model of a simply…

We study the persistence in a class of continuous stochastic processes that are stationary only under integer shifts of time. We show that under certain conditions, the persistence of such a continuous process reduces to the persistence of…

Homological algebra of modules over posets is developed, as closely parallel as possible to that of finitely generated modules over noetherian commutative rings, in the direction of finite presentations and resolutions. Centrally at issue…

The stable Ramsey's theorem for pairs has been the subject of numerous investigations in mathematical logic. We introduce a weaker form of it by restricting from the class of all stable colorings to subclasses of it that are non-null in a…

We propose a framework for studying the stability of discrete-event systems modelled as switching max-plus linear systems. In this framework, we propose a set of notions of stability for generic discrete-event systems in the max-plus…

We show that certain tilting results for quivers are formal consequences of stability, and as such are part of a formal calculus available in any abstract stable homotopy theory. Thus these results are for example valid over arbitrary…

We investigate the relations between algebraic structures, spectral invariants, and persistence modules, in the context of monotone Lagrangian Floer homology with Hamiltonian term. Firstly, we use the newly introduced method of filtered…