Related papers: Numerical primary decomposition

Under the name prime decomposition (pd), a unique decomposition of an arbitrary $N$-dimensional density matrix $\rho$ into a sum of seperable density matrices with dimensions given by the coprime factors of $N$ is introduced. For a class of…

We present an algorithm to compute the primary decomposition of a submodule $\mathcal{N}$ of the free module $\Z[x_1, \ldots, x_n]^m$. For this purpose we use algorithms for primary decomposition of ideals in the polynomial ring over the…

An irreducible algebraic decomposition $\cup_{i=0}^{d}X_i=\cup_{i=0}^{d} (\cup_{j=1}^{d_i}X_{ij})$ of an affine algebraic variety X can be represented as an union of finite disjoint sets $\cup_{i=0}^{d}W_i=\cup_{i=0}…

Over the past decades, the increasing dimensionality of data has increased the need for effective data decomposition methods. Existing approaches, however, often rely on linear models or lack sufficient interpretability or flexibility. To…

We present an effective method for computing parametric primary decomposition via comprehensive Gr\"obner systems. In general, it is very difficult to compute a parametric primary decomposition of a given ideal in the polynomial ring with…

Let $M$ be a finitely generated module over a Noetherian ring $R$ and $N$ a submodule. The index of reducibility ir$_M(N)$ is the number of irreducible submodules that appear in an irredundant irreducible decomposition of $N$ (this number…

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 problem of decomposing non-manifold object has already been studied in solid modeling. However, the few proposed solutions are limited to the problem of decomposing solids described through their boundaries. In this thesis we study the…

An algorithm for irreducible decomposition of representations of finite groups over fields of characteristic zero is described. The algorithm uses the fact that the decomposition induces a partition of the invariant inner product into a…

We demonstrate that the integration of the recently developed dynamic mode decomposition (DMD) with a multi-resolution analysis allows for a decomposition method capable of robustly separating complex systems into a hierarchy of…

We study primary submodules and primary decompositions from a differential and computational point of view. Our main theoretical contribution is a general structure theory and a representation theorem for primary submodules of an arbitrary…

We study a family of determinantal ideals whose decompositions encode the structural zeros in conditional independence models with hidden variables. We provide explicit decompositions of these ideals and, for certain subclasses of models,…

In this paper we describe the method which we applied to successfully compute the primary decomposition of a certain ideal coming from applications in combinatorial algebra and algebraic statistics regarding conditional independence…

In this paper, we propose a probabilistic model for computing an interpolative decomposition (ID) in which each column of the observed matrix has its own priority or importance, so that the end result of the decomposition finds a set of…

We present an algorithm for computing discriminants and prime ideal decomposition in number fields. The algorithm is a refinement of a p-adic factorization method based on Newton polygons of higher order. The running-time and memory…

We propose a method to address challenges in unconstrained face detection, such as arbitrary pose variations and occlusions. First, a new image feature called Normalized Pixel Difference (NPD) is proposed. NPD feature is computed as the…

An ideal in a polynomial ring encodes a system of linear partial differential equations with constant coefficients. Primary decomposition organizes the solutions to the PDE. This paper develops a novel structure theory for primary ideals in…

Let $D$ be a principal ideal domain and $R(D) = \{\begin{pmatrix} a & b 0 & a \end{pmatrix} \mid a, b \in D\}$ be its self-idealization. It is known that $R(D)$ is a commutative noetherian ring with identity, and hence $R(D)$ is atomic…

This paper presents a novel non-linear model reduction method: Probabilistic Manifold Decomposition (PMD), which provides a powerful framework for constructing non-intrusive reduced-order models (ROMs) by embedding a high-dimensional system…

We propose an effective method for primary decomposition of symmetric ideals. Let $K[X]=K[x_1,\ldots,x_n]$ be the $n$-valuables polynomial ring over a field $K$ and $\mathfrak{S}_n$ the symmetric group of order $n$. We consider the…