Related papers: On primary decomposition of modules

We define pullback and separated presentations of modules over pullback rings, and, if the ring is a pullback of epimorphisms over a semisimple ring, an algorithm reducing such a presentation of a module to an $R$-diagram. The latter is the…

We introduce the notion of E-depth of graded modules over polynomial rings to measure the depth of certain Ext modules. First, we characterize graded modules over polynomial rings with (sufficiently) large E-depth as those modules whose…

We calculate the decomposition series of the D-module defined as the push-forward of a rank one linear system on the complement of a normal crossings hyperplane configuration and use data of a resolution of singularities to give a…

We consider the D-module defined as the push-forward of a rank one linear system on the complement of a central plane hyperplane arrangement, and calculate its decomposition series, using algebraic calculations in the Weyl algebra.

Potential-based formulation with generalized Lorenz gauge can be used in the quantization of electromagnetic fields in inhomogeneous media. However, one often faces the redundancy of modes when finding eigenmodes from potential-based…

The decomposition matrix of a finite group in prime characteristic p records the multiplicities of its p-modular irreducible representations as composition factors of the reductions modulo p of its irreducible representations in…

This diploma thesis is concerned with functional decomposition $f = g \circ h$ of polynomials. First an algorithm is described which computes decompositions in polynomial time. This algorithm was originally proposed by Zippel (1991). A…

For linear operators which factor with suitable assumptions concerning commutativity of the factors, we introduce several notions of a decomposition. When any of these hold then questions of null space and range are subordinated to the same…

Generalized Heisenberg algebras $\H(f)$ for any polynomial $f(h)\in\C[h]$ have been used to explain various physical systems and many physical phenomena for the last 20 years. In this paper, we first obtain the center of $\H(f)$, and the…

Decompositions of the unitary group U(n) are useful tools in quantum information theory as they allow one to decompose unitary evolutions into local evolutions and evolutions causing entanglement. Several recursive decompositions have been…

Extending the idea of Even and Lehrer [3], we discuss a general approach to integration based on a given decomposition system equipped with a weighting function, and a decomposition of the integrated function. We distinguish two type of…

For a prime number p, we construct a generating set for the ring of invariants for the p+1 dimensional indecomposable modular representation of a cyclic group of order p^2. We then use the constructed invariants to describe the…

This paper shows that certain decomposition numbers for the Hecke algebras and q-Schur algebras at different roots of unity in characteristic zero are equal. To prove our results we first establish the corresponding theorem for the…

For a cellular algebra $\A$ with a cellular basis $\ZC$, we consider a decomposition of the unit element $1_\A$ into orthogonal idempotents (not necessary primitive) satisfying some conditions. By using this decomposition, the cellular…

Finitely generated Z-modules have canonical decompositions. When such modules are given in a finitely presented form there is a classical algorithm for computing a canonical decomposition. This is the algorithm for computing the Smith…

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…

In its simplest form the Decomposition Theorem asserts that the rational intersection cohomology of a complex projective variety occurs as a summand of the cohomology of any resolution. This deep theorem has found important applications in…

In 1954, Alston S. Householder published Principles of Numerical Analysis, one of the first modern treatments on matrix decomposition that favored a (block) LU decomposition-the factorization of a matrix into the product of lower and upper…

This paper proposes a geometric solution to the problem of prime decomposability of concurrent processes first explored by R. Milner and F. Moller in [MM93]. Concurrent programs are given a geometric semantics using cubical areas, for which…

Submodular functions are at the core of many machine learning and data mining tasks. The underlying submodular functions for many of these tasks are decomposable, i.e., they are sum of several simple submodular functions. In many data…