Let $\Delta$ be a pure simplicial complex on the vertex set $\left[n\right]=\{1,...,n\}$ and $I_{\Delta }$ its Stanley-Reisner ideal in the polynomial ring $S=K[x_1,...,x_n]$. We show that $\Delta$ is a matroid (complete intersection) if and only if $S/I_{\Delta }^{\left(m\right)}$ ($S/I_{\Delta }^m$) is clean for all $m\in \mathbb{N}$ and this is equivalent to saying that $S/I_{\Delta }^{\left(m\right)}$ ($S/I_{\Delta }^m$, respectively) is Cohen-Macaulay for all $m\in \mathbb{N}$. By this result, we show that there exists a monomial ideal $I$ with (pretty) cleanness property while $S/I^m$ or $S/I^{\left(m\right)}$ is not (pretty) clean for all integer $m\ge 3$. If $dim\left(\Delta \right)=1$, we also prove that $S/I_{\Delta }^{\left(2\right)}$ ($S/I_{\Delta }^2$) is clean if and only if $S/I_{\Delta }^{\left(2\right)}$ ($S/I_{\Delta }^2$,...

We describe the polynomials P ∈ ℂ[x,y] such that $P(1/vⁿ,A₁vⁿ+A₂v^{2n}+...+A_{m-1}{v}^{n(m-1)}+v^{nm-k}w)\in ℂ[v,w]$. As applications we give new examples of bad field generators and examples of families of polynomials with smooth and irreducible fibers.

We present some facts, observations and remarks concerning the problem of finiteness of the rings of constants for derivations of polynomial rings over a commutative ring k containing the field ℚ of rational numbers.

It is known that it is sufficient to consider in the Jacobian Conjecture only polynomial mappings of the form $F(x₁,...,x_n)=x-H\left(x\right):=(x₁-H₁(x₁,...,x_n),...,x_n-H_n(x₁,...,x_n))$, where $H_j$ are homogeneous polynomials of degree 3 with real coefficients (or $H_j=0$), j = 1,...,n and H’(x) is a nilpotent matrix for each $x=(x₁,...,x_n)\in {ℝ}^n$. We give another proof of Yu’s theorem that in the case of non-negative coefficients of H the mapping F is a polynomial automorphism, and we moreover prove that in that case $deg{F}^{-1}\le {\left(degF\right)}^{indF-1}$, where $indF:=maxind{H}^{\text{'}}\left(x\right):x\in {ℝ}^n$. Note that the above inequality is not true when the coefficients of...

For each squarefree monomial ideal $I\subset S=k[x_1,...,x_n]$, we associate a simple finite graph $G_I$ by using the first linear syzygies of $I$. The nodes of $G_I$ are the generators of $I$, and two vertices $u_i$ and $u_j$ are adjacent if there exist variables $x,y$ such that $x{u}_i=y{u}_j$. In the cases, where $G_I$ is a cycle or a tree, we show that $I$ has a linear resolution if and only if $I$ has linear quotients and if and only if $I$ is variable-decomposable. In addition, with the same assumption on $G_I$, we characterize all squarefree monomial ideals with a...