Related papers: N^d-indexed persistence modules, higher dimensiona…
The topological properties of a material depend on its symmetries, parameters, and spatial dimension. Changes in these properties due to parameter and symmetry variations can be understood by computing the corresponding topological…
A persistent dynamical system in $\mathbb{R}^d_{> 0}$ is one whose solutions have positive lower bounds for large $t$, while a permanent dynamical system in $\mathbb{R}^d_{> 0}$ is one whose solutions have uniform upper and lower bounds for…
Over fields of characteristic unequal to $2$, we can identify symmetric matrices with homogeneous polynomials of degree $2$. This allows us to view symmetric rank-metric codes as living inside the space of such polynomials. In this paper,…
Entanglement is known to serve as an order parameter for true topological order in two-dimensional systems. We show how entanglement of disconnected partitions defines topological invariants for one-dimensional topological superconductors.…
We consider different notions of equivalence for Morse functions on the sphere in the context of persistent homology, and introduce new invariants to study these equivalence classes. These new invariants are as simple, but more discerning…
We show that a positive homogeneous function that is invariant under determinant-1 stochastic local operations and classical communication (SLOCC) transformations defines an N-qubit entanglement monotone if and only if the homogeneous…
For the class of stably dissipative Lotka-Volterra systems we prove that the rank of its defining matrix, which is the dimension of the associated invariant foliation, is completely determined by the system's graph.
This paper presents a new decoding for polynomial residue codes, called the minimum degree-weighted distance decoding. The newly proposed decoding is based on the degree-weighted distance and different from the traditional minimum Hamming…
Webs yield an especially important realization of certain Specht modules, irreducible representations of symmetric groups, as they provide a pictorial basis with a convenient diagrammatic calculus. In recent work, the last three authors…
Let $X$ be a complex projective variety defined over $\mathbb R$. Recently, Bernardi and the first author introduced the notion of admissible rank with respect to $X$. This rank takes into account only decompositions that are stable under…
Determinant codes are a class of exact-repair regenerating codes for distributed storage systems with parameters (n, k = d, d). These codes cover the entire trade-off between per-node storage and repair-bandwidth. In an earlier work of the…
(Partial) Unit Memory ((P)UM) codes provide a powerful possibility to construct convolutional codes based on block codes in order to achieve a high decoding performance. In this contribution, a construction based on Gabidulin codes is…
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…
In a recent paper on a study of the Sylow 2-subgroups of the symmetric group with 2^n elements it has been show that the growth of the first (n-2) consecutive indices of a certain normalizer chain is linked to the sequence of partitions of…
Regarding non-unique factorization of integer-valued polynomials over a discrete valuation domain $(R,M)$ with finite residue field, it is known that there exist absolutely irreducible elements, that is, irreducible elements all of whose…
In this paper an approach to generate multi-dimensionally consistent $N$-component systems is proposed. The approach starts from scalar multi-dimensionally consistent quadrilateral systems and makes use of the cyclic group. The obtained…
We define persistent homology groups over any set of spaces which have inclusions defined so that the corresponding directed graph between the spaces is acyclic, as well as along any subgraph of this directed graph. This method…
In this paper, we have considered the dense rank for assigning positions to alternatives in weak orders. If we arrange the alternatives in tiers (i.e., indifference classes), the dense rank assigns position 1 to all the alternatives in the…
We study decompositions of the global NVALUE constraint. Our main contribution is theoretical: we show that there are propagators for global constraints like NVALUE which decomposition can simulate with the same time complexity but with a…
In this paper, we characterize rank one preserving module maps on a Hilbert $C^\ast-$module and study its applications on free probability theory.