Related papers: On primary decomposition of modules
We propose new algorithms for computing triangular decompositions of polynomial systems incrementally. With respect to previous works, our improvements are based on a {\em weakened} notion of a polynomial GCD modulo a regular chain, which…
Consider an ideal $I \subset R = \bC[x_1,...,x_n]$ defining a complex affine variety $X \subset \bC^n$. We describe the components associated to $I$ by means of {\em numerical primary decomposition} (NPD). The method is based on the…
Recently, we have endowed various categories of groups with topologies. The purpose of this paper is to introduce on these categories others topologies which are statistically more suitable to study well-known problems in groups theory. We…
In the persistent homology of filtrations, the indecomposable decompositions provide the persistence diagrams. However, in almost all cases of multidimensional persistence, the classification of all indecomposable modules is known to be a…
We introduce for any Poisson algebra a bicomplex of free Poisson modules, and use it to show that the Poisson cohomology theory introduced in the paper "[M. Flato, M. Gerstenhaber and A. A. Voronov, Cohomology and Deformation of Leibniz…
A necessary and sufficient condition is provided for the solvability of a binomial congruence with a composite modulus, circumventing its prime factorization. This is a generalization of Euler's Criterion through that of Euler's Theorem,…
Let $A$ be a finite-dimensional algebra over an algebraically closed field $\Bbbk$. For any finite-dimensional $A$-module $M$ we give a general formula that computes the indecomposable decomposition of $M$ without decomposing it, for which…
An orthogonal decomposition problem of Lie algebras over the complex numbers has been studied since the 1980s. It has many applications and relations to other areas of mathematics and sciences. In this paper, we consider this decomposition…
In this paper, we mainly focus on formal deformation theory of module homomorphisms. We first introduce the cohomology of module homomorphisms and study formal one-parameter deformation. We obtain some properties about obstructions. Then we…
The classical persistence algorithm computes the unique decomposition of a persistence module implicitly given by an input simplicial filtration. Based on matrix reduction, this algorithm is a cornerstone of the emergent area of topological…
The main purpose of this article is to develop an explicit derived deformation theory of algebraic structures at a high level of generality, encompassing in a common framework various kinds of algebras (associative, commutative, Poisson...)…
Constructing complex computation from simpler building blocks is a defining problem of computer science. In algebraic automata theory, we represent computing devices as semigroups. Accordingly, we use mathematical tools like products and…
We will use commutators to provide decompositions of $3\times 3$ matrices as sums whose terms satisfy some polynomial identities, and we apply them to bounded linear operators and endomorphisms of free modules of infinite rank. In…
The main objective of this project is to determine all irreducible modules of a given modular Lie algebra. In contrast to ordinary Lie algebras, modular Lie algebras require an additional structure known as the p-mapping. The minimal…
Hochschild (co)homology and Pirashvili's higher order Hochschild (co)homology are useful tools for a variety of applications including deformations of algebras. When working with higher order Hochschild (co)homology, we can consider the…
The aim of this work is to show how we can decompose a module (if decomposable) into an indecomposable module with the help of the minimization process.
This chapter describes modal decompositions in the framework of matrix factorizations. We highlight the differences between classic space-time decompositions and 2D discrete transforms and discuss the general architecture underpinning…
Let $R=\bigoplus_{\underline{n} \in \mathbb{N}^t}R_{\underline{n}}$ be a commutative Noetherian $\mathbb{N}^t$-graded ring, and $L = \bigoplus_{\underline{n}\in\mathbb{N}^t}L_{\underline{n}}$ be a finitely generated $\mathbb{N}^t$-graded…
We propose an algebraic framework generalizing several variants of Prony's method and explaining their relations. This includes Hankel and Toeplitz variants of Prony's method for the decomposition of multivariate exponential sums,…
We present the first known efficient decoding algorithm for correcting multiple insertion-deletion errors in Helberg codes and their non-binary generalizations, extending a known algorithm for correcting multiple deletion errors.