相关论文: An Algorithm to Compute a Primary Decomposition of…

Let $R$ be a commutative ring with non-zero identity and $M$ be a unitary $R$-module. The goal of this paper is to extend the concept of 1-absorbing primary ideals to 1-absorbing primary submodules. A proper submodule $N$ of $M$ is said to…

Let A \subseteq B be cancellative abelian semigroups, and let R be an integral domain. We show that the semigroup ring R[B] can be decomposed, as an R[A]-module, into a direct sum of R[A]-submodules of the quotient ring of R[A]. In the case…

We consider the Rosenfeld-Groebner algorithm for computing a regular decomposition of a radical differential ideal generated by a set of ordinary differential polynomials in n indeterminates. For a set of ordinary differential polynomials…

In this paper we study primality and primary decomposition of certain ideals which are generated by homogeneous degree $2$ polynomials and occur naturally from determinantal conditions. Normality is derived from these results.

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…

In this paper, we prove that every binomial ideal in a polynomial ring over an algebraically closed field of characteristic zero admits a canonical primary decomposition into binomial ideals. Moreover, we prove that this special…

We construct an explicit minimal strong Groebner basis of the ideal of vanishing polynomials in the polynomial ring over Z/m for m>=2. The proof is done in a purely combinatorial way. It is a remarkable fact that the constructed Groebner…

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…

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,…

A Random SubMatrix method (RSM) is proposed to calculate the low-rank decomposition of large-scale matrices with known entry percentage \rho. RSM is very fast as the floating-point operations (flops) required are compared favorably with the…

Let $K$ be a field and $P=K[x_1,\dots,x_n]$. The technique of elimination by substitution is based on discovering a coherently $Z=(z_1,\dots,z_s)$-separating tuple of polynomials $(f_1,\dots,f_s)$ in an ideal $I$, i.e., on finding…

We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…

We present a new algorithm to compute the classical modular polynomial Phi_n in the rings Z[X,Y] and (Z/mZ)[X,Y], for a prime n and any positive integer m. Our approach uses the graph of n-isogenies to efficiently compute Phi_n mod p for…

We present an efficient algorithm for computing the leading monomials of a minimal Groebner basis of a generic sequence of homogeneous polynomials. Our approach bypasses costly polynomial reductions by exploiting structural properties…

We describe the support of $F$-finite $F$-modules over polynomial rings $R$ of prime characteristic. Our description yields an algorithm to compute the support of such modules; the complexity of our algorithm is also analyzed. To the best…

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…

Given a graded associative algebra $A$, its lower central series is defined by $L_1 = A$ and $L_{i+1} = [L_i, A]$. We consider successive quotients $N_i(A) = M_i(A) / M_{i+1}(A)$, where $M_i(A) = AL_i(A) A$. These quotients are direct sums…

Students studying the Lasker-Noether theorem on primary decomposition of ideals may want to see an example of an ideal (necessarily in a non-Noetherian ring) which does not have a primary decomposition. The most well-known counterexample is…

We present a new probabilistic algorithm to compute modular polynomials modulo a prime. Modular polynomials parameterize pairs of isogenous elliptic curves and are useful in many aspects of computational number theory and cryptography. Our…

We study the deformation theory of quotients of polynomial rings by quadratic monomial ideals. More precisely we compute the first cotangent cohomology module of such rings. We also give a criterion for vanishing of second cotangent…