Related papers: On primary decomposition of modules
We settle the fusion product decomposition theorem for higher-level affine Demazure modules for the cases $E^{(1)}_{6, 7, 8}, F^{(1)}_4$ and $E^{(2)}_{6}$, thus completing the main theorems of Chari et al. (J. Algebra, 2016) and Kus et al.…
A framework to systematically decouple high order elliptic equations into combination of Poisson-type and Stokes-type equations is developed. The key is to systematically construct the underling commutative diagrams involving the complexes…
In this survey, we first review some known results on the representation theory of algebras with triangular decomposition, including the classification of the simple modules. We then discuss a recipe to construct Hopf algebras with…
The study of persistent homology has contributed new insights and perspectives into a variety of interesting problems in science and engineering. Work in this domain relies on the result that any finitely-indexed persistence module of…
The coprimary filtration is a basic construction in commutative algebra. In this article, we prove the existence and uniqueness of coprimary filtration of modules (not necessarily finitely generated) over a Noetherian ring. Moreover, we…
We propose a simple approach to formal deformations of associative algebras. It exploits the machinery of multiplicative coresolutions of an associative algebra A in the category of A-bimodules. Specifically, we show that certain…
Primary decomposition of commutative monoid congruences is insensitive to certain features of primary decomposition in commutative rings. These features are captured by the more refined theory of mesoprimary decomposition of congruences,…
This article explains basic constructions and results on group algebras and their cohomology, starting from the point of view of commutative algebra. It provides the background necessary for a novice in this subject to begin reading Dave…
We study the $H_n(0)$-module $\mathbf{S}^\sigma_\alpha$ due to Tewari and van Willigenburg, which was constructed using new combinatorial objects called standard permuted composition tableaux and decomposed into cyclic submodules. First, we…
Hessenberg decomposition is the basic tool used in computational linear algebra to approximate the eigenvalues of a matrix. In this article, we generalize Hessenberg decomposition to continuous matrix fields over topological spaces. This…
We propose new primal-dual decomposition algorithms for solving systems of inclusions involving sums of linearly composed maximally monotone operators. The principal innovation in these algorithms is that they are block-iterative in the…
Optimization decomposition methods are a fundamental tool to develop distributed solution algorithms for large scale optimization problems arising in fields such as machine learning and optimal control. In this paper, we present an…
We introduce differential primary decompositions for ideals in a commutative ring. Ideal membership is characterized by differential conditions. The minimal number of conditions needed is the arithmetic multiplicity. Minimal differential…
The main object of this work is to show how some rather elementary techniques based upon certain inverse pairs of symbolic operators would lead us easily to several decomposition formulas associated with confluent hypergeometric functions…
We present Binomials, a package for the computer algebra system Macaulay2, which specializes well known algorithms to binomial ideals. These come up frequently in algebraic statistics and commutative algebra, and it is shown that…
We present an alternative method for computing primary decomposition of zero-dimensional ideals over finite fields. Based upon the further decomposition of the invariant subspace of the Frobenius map acting on the quotient algebra in the…
In Finite Group Modular Representation Theory, the basic objects are the indecomposable and simple modules. This paper offers a new classification of these objects that refines the Green Theory Classification of indecomposable and simple…
In this paper, a new triangular decomposition algorithm is proposed for ordinary differential polynomial systems, which has triple exponential computational complexity. The key idea is to eliminate one algebraic variable from a set of…
We consider the decomposition of bounded linear operators on Hilbert spaces in terms of functions forming frames. Similar to the singular-value decomposition, the resulting frame decompositions encode information on the structure and…
Over any partially ordered abelian group whose positive cone is closed in an appropriate sense and has finitely many faces, modules that satisfy a weak finiteness condition admit finite primary decompositions. This conclusion rests on the…