Related papers: Primary Decomposition of Symmetric Ideals

For a polynomial ring S in n variables, we consider the natural action of the symmetric group S_n on S by permuting the variables. For an S_n-invariant monomial ideal I in S and j >= 0, we give an explicit recipe for computing the modules…

Let $S=K[x_1,\dots,x_n]$ be the polynomial ring over a field $K$, and let $I\subset S$ be a monomial ideal. In this paper, we introduce the $i$th \textit{homological shift algebras}…

In this paper we continue the development of a new technique for computing elimination ideals by substitution which has been called $Z$-separating re-embeddings. Given an ideal $I$ in the polynomial ring $K[x_1,\dots,x_n]$ over a field $K$,…

Let $\mathbb{F}[X]$ be the polynomial ring over the variables $X=\{x_1,x_2, \ldots, x_n\}$. An ideal $I=\langle p_1(x_1), \ldots, p_n(x_n)\rangle$ generated by univariate polynomials $\{p_i(x_i)\}_{i=1}^n$ is a \emph{univariate ideal}. We…

Let $K$ be a number field, $\mathfrak{q}$ be an integral ideal, and $\mathrm{Cl}(\mathfrak{q})$ be the associated ray class group. Suppose $\mathrm{Cl}(\mathfrak{q})$ possesses a real exceptional character $\psi$, possibly principal, with a…

Let $K$ be an algebraically closed field of characteristic zero and ${P_n=K[x_1,\ldots,x_n]}$ the polynomial ring. Any $K$-derivation $D$ on $P_n$ is of the form ${ D=\sum_{i=1}^n f_i(x_1,\ldots,x_n)\frac{\partial}{\partial x_i} },$ where…

Certifying the positivity of trigonometric polynomials is of first importance for design problems in discrete-time signal processing. It is well known from the Riesz-Fej\'ez spectral factorization theorem that any trigonometric univariate…

Suppose that $A \in \mathbb{R}^{N \times N}$ is symmetric positive semidefinite with rank $K \le N$. Our goal is to decompose $A$ into $K$ rank-one matrices $\sum_{k=1}^K g_k g_k^T$ where the modes $\{g_{k}\}_{k=1}^K$ are required to be as…

Let $R$ be a noncommutative ring, and let $S$ be an $m$-system of $R$. In this paper, we give more results on the concept of almost prime (right) ideals, that were introduced by the first two authors, especially in (right) $S$-unital rings,…

We study the symmetric outer product decomposition which decomposes a fully (partially) symmetric tensor into a sum of rank-one fully (partially) symmetric tensors. We present iterative algorithms for the third-order partially symmetric…

Let \( K \) be a number field. We provide quantitative estimates for the size of the Zsigmondy set of an integral ideal sequence generated by iterating a polynomial function \(\varphi(z) \in K[z]\) at a wandering point \(\alpha \in K.\)

Let $R$ be the polynomial ring $K[x_{i,j}]$ where $1 \le i \le r$ and $j \in \mathbb{N}$, and let $I$ be an ideal of $R$ stable under the natural action of the infinite symmetric group $S_{\infty}$. Nagel--R\"omer recently defined a Hilbert…

This paper investigates atomic factorizations in the monoid $\mathcal I(R)$ of nonzero ideals of a multivariate polynomial ring $R$, under ideal multiplication. Building on recent advances in factorization theory for unit-cancellative…

The aim of this paper is to unveil an unexpected relationship between the normal form of a polynomial with respect to a polynomial ideal and the more geometric concept of orthogonality. We present a new way to calculate the normal form of a…

We define a family of ideals $I_h$ in the polynomial ring $\mathbb{Z}[x_1,...,x_n]$ that are parametrized by Hessenberg functions $h$ (equivalently Dyck paths or ample partitions). The ideals $I_h$ generalize algebraically a family of…

Let R be a commutative ring with identity and N(R) be the set of all nilpotent elements of R. The aim of this paper is to introduce and study the notion of nil-prime ideals as a generalization of prime ideals. We say that a proper ideal P…

Consider a height two ideal, $I$, which is minimally generated by $m$ homogeneous forms of degree $d$ in the polynomial ring $R=k[x,y]$. Suppose that one column in the homogeneous presenting matrix $\f$ of $I$ has entries of degree $n$ and…

An ideal of a local polynomial ring can be described by calculating a standard basis with respect to a local monomial ordering. However standard basis algorithms are not numerically stable. Instead we can describe the ideal numerically by…

We present new results and an algorithm for standard basis computations of a 0-dimensional ideal I in a power series ring or in the localization of a polynomial ring in finitely many variables over a field K. The algorithm provides a…

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…