Related papers: N^d-indexed persistence modules, higher dimensiona…
For any prime p, we construct, and simultaneously count, all of the complex Specht modules in a given p-block of the symmetric group which remain irreducible when reduced modulo p. We call the Specht modules with this property p-irreducible…
Polynomial remainder codes are a large class of codes derived from the Chinese remainder theorem that includes Reed-Solomon codes as a special case. In this paper, we revisit these codes and study them more carefully than in previous work.…
In this paper, we show that the pointwise finite-dimensional two-parameter persistence module $\mathbb{HF}_*^{(\bullet,\bullet]}$, defined in terms of interlevel filtered Floer homology, is rectangle-decomposable. This allows for the…
This paper has two parts. In the first one, we prove that an invariant dp-minimal type is either finitely satisfiable or definable. We also prove that a definable version of the (p,q)-theorem holds in dp-minimal theories of small or medium…
We characterize which graph invariants are partition functions of a spin model over the complex numbers, in terms of the rank growth of associated `connection matrices'.
We show that the sequence of dimensions of the linear spaces, generated by a given rank-metric code together with itself under several applications of a field automorphism, is an invariant for the whole equivalence class of the code. These…
We demonstrate that an equivalence of categories using $\varepsilon$-interleavings as a fundamental component exists between the model of persistence modules as graded modules over a polynomial ring and the model of persistence modules as…
In this paper, we construct indecomposable integrally closed modules of arbitrary rank over a two-dimensional regular local ring. The modules are quite explicitly constructed from a given complete monomial ideal. We also give structural and…
In this paper we introduce the persistent magnitude, a new numerical invariant of (sufficiently nice) graded persistence modules. It is a weighted and signed count of the bars of the persistence module, in which a bar of the form $[a,b)$ in…
Levels of cancellativity in commutative monoids $M$, determined by stable rank values in $\mathbb{Z}_{> 0} \cup \{\infty\}$ for elements of $M$, are investigated. The behavior of the stable ranks of multiples $ka$, for $k \in \mathbb{Z}_{>…
We study Coxeter racks over $\mathbb{Z}_n$ and the knot and link invariants they define. We exploit the module structure of these racks to enhance the rack counting invariants and give examples showing that these enhanced invariants are…
A famous result due to L. S. Levy provides a classification of all finitely generated indecomposable modules over Dedekind-like rings. This motivates us to outline an approach to the classification of indecomposable pseudo-absorbing primary…
One of the main reasons for topological persistence being useful in data analysis is that it is backed up by a stability (isometry) property: persistence diagrams of $1$-parameter persistence modules are stable in the sense that the…
In this paper, we investigate completely decomposable rank-metric codes, i.e. rank-metric codes that are the direct sum of 1-dimensional maximum rank distance codes. We study the weight distribution of such codes, characterizing codewords…
We introduce a modified rack algebra Z[X] for racks X with finite rack rank N. We use representations of Z[X] into rings, known as rack modules, to define enhancements of the rack counting invariant for classical and virtual knots and…
We study the representations of a class of non-commutative polynomial algebras truncated at degree 3, with one additional relation. We determine the irreducible components of their varieties of representations. We do this by showing that…
We study finite and countably infinite systems of stochastic differential equations, in which the drift and diffusion coefficients of each component (particle) are determined by its rank in the vector of all components of the solution. We…
We exhibit explicit expressions, in terms of components, of discriminants, determinants, characteristic polynomials and polynomial identities for matrices of higher rank. We define permutation tensors and in term of them we construct…
Invariants for complicated objects such as those arising in phylogenetics, whether they are invariants as matrices, polynomials, or other mathematical structures, are important tools for distinguishing and working with such objects. In this…
Multiparameter persistence modules can be uniquely decomposed into indecomposable summands. Among these indecomposables, intervals stand out for their simplicity, making them preferable for their ease of interpretation in practical…