Related papers: On the Problem of Separating Variables in Multivar…

Let F denote either the real or complex field. An ideal I in the free *-algebra F<x,x*> in g freely noncommuting variables and their formal adjoints is a *-ideal if I = I*. When a real *-ideal has finite codimension, it satisfies a strong…

Given an arbitrary integer $d>0$, we construct a homogeneous ideal $I$ of the polynomial ring $S = K[x_1, \ldots, x_{3d}]$ in $3d$ variables over a filed $K$ for which $S/I$ is a Cohen--Macaulay ring of dimension $d$ with the property that,…

We consider the simplest quartic number fields $\mathbb{K}_m$ defined by the irreducible quartic polynomials $$x^4-mx^3-6x^2+mx+1,$$ where $m$ runs over the positive rational integers such that the odd part of $m^2+16$ is squarefree. In…

Let f and g be nonconstant polynomials over an arbitrary field K. In this paper we study the intersection of the polynomial rings K[f] and K[g], and in particular we ask whether this intersection is larger than K. We completely resolve this…

We study the ideal generated by polynomials vanishing on a semialgebraic set and propose an algorithm to calculate the generators, which is based on some techniques of the cylindrical algebraic decomposition. By applying these, polynomial…

Let $f$ be a polynomial in the free algebra over a field $K$, and let $A$ be a $K$-algebra. We denote by $\S_A(f)$, $\A_A(f)$ and $\I_A(f)$, respectively, the `verbal' subspace, subalgebra, and ideal, in $A$, generated by the set of all…

Assume that $K$ is a field and $I_{1}\subsetneq ...\subsetneq I_{t}$ is an ascending chain (of length $t$) of ideals in the polynomial ring $K[x_{1},,...,x_{m}]$, for some $m\geq 1$. Suppose that $I_{j}$ is generated by polynomials of…

In this article we investigate when a homogeneous ideal in a graded ring is normal, that is, when all positive powers of the ideal are integrally closed. We are particularly interested in homogeneous ideals in an N-graded ring generated by…

Given an affine algebra $R=P/I$, where $P=K[x_1,\dots,x_n]$ is a polynomial ring over a field $K$ and $I$ is an ideal in $P$, we study re-embeddings of the affine scheme ${\rm Spec}(R)$, i.e., presentations $R \cong P'/I'$ such that $P'$ is…

Suppose L is any finite algebraic extension of either the ordinary rational numbers or the p-adic rational numbers. Also let g_1,...,g_k be polynomials in n variables, with coefficients in L, such that the total number of monomial terms…

We determine, in a polynomial ring over a field, the arithmetical rank of certain ideals generated by a set of monomials and one binomial.

With a simple graph $G$ on $[n]$, we associate a binomial ideal $P_G$ generated by diagonal minors of an $n \times n$ matrix $X=(x_{ij})$ of variables. We show that for any graph $G$, $P_G$ is a prime complete intersection ideal and…

We classify the pairs of polynomials $f,g$ over a field $K$, such that $f(X)-g(Y)$ has a factor of total degree at most 2. This was done by Y. Bilu for characteristic 0 fields $K$. As his method does not work in positive characteristic, we…

A new algorithm is presented for computing the largest degree invariant factor of the Sylvester matrix (with respect either to $x$ or $y$) associated to two polynomials $a$ and $b$ in $\mathbb F_q[x,y]$ which have no non-trivial common…

Suppose we are given black-box access to a finite ring R, and a list of generators for an ideal I in R. We show how to find an additive basis representation for I in poly(log |R|) time. This generalizes a quantum algorithm of Arvind et al.…

The variety $ \mathrm{Sing}_{n, m} $ consists of all tuples $ X = (X_1,\ldots, X_m) $ of $ n\times n $ matrices such that every linear combination of $ X_1,\ldots, X_m $ is singular. Equivalently, $X\in\mathrm{Sing}_{n,m}$ if and only if…

We study conditions on polynomials such that the ideal generated by their orbits under the symmetric group action becomes a monomial ideal or has a monomial radical. If the polynomials are homogeneous, we expect that such an ideal has a…

We describe an algorithm which finds binomials in a given ideal $I\subset\mathbb{Q}[x_1,\dots,x_n]$ and in particular decides whether binomials exist in $I$ at all. Binomials in polynomial ideals can be well hidden. For example, the lowest…

Based on the partition of parameter space, two algorithms for computing the rational univariate representation of zero-dimensional ideals with parameters are presented in the paper. Unlike the rational univariate representation of…

The intention of this note is two-fold. First, we study integer optimization problems in standard form defined by $A \in\mathbb{Z}^{m\times{}n}$ and present an algorithm to solve such problems in polynomial-time provided that both the…