相关论文: Generators for the $C^m$-closures of Ideals

This paper is concerned with determining the number of generators in each degree for minimal sets of homogeneous generators for saturated ideals defining fat point subschemes $Z=m_1p_1+ ... +m_rp_r$ for general sets of points $p_i$ of…

Adem and Reichstein introduced the ideal of truncated symmetric polynomials to present the permutation invariant subring in the cohomology of a finite product of projective spaces. Building upon their work, I describe a generating set of…

Let $K$ be a number field with ring of integers $R$. Given a modulus $\mathfrak{m}$ for $K$ and a group $\Gamma$ of residues modulo $\mathfrak{m}$, we consider the semi-direct product $R\rtimes R_{\mathfrak{m},\Gamma}$ obtained by…

It is well known that the multiplier ideal $\multr{I}$ of an ideal $I$ determines in a straightforward way the multiplier ideal $\multr{f}$ of a sufficiently general element $f$ of $I$. We give an explicit condition on a polynomial $f \in…

In this article we associate to every lattice ideal $I_{L,\rho}\subset K[x_1,..., x_m]$ a cone $\sigma $ and a graph $G_{\sigma}$ with vertices the minimal generators of the Stanley-Reisner ideal of $\sigma $. To every polynomial $F$ we…

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…

A graph-theoretic method, simpler than existing ones, is used to characterize the minimal set of monomial generators for the integral closure of any algebra of polynomials generated by quadratic monomials. The toric ideal of relations…

The dominant theme of this thesis is the construction of matrix representations of finite solvable groups using a suitable system of generators. For a finite solvable group $G$ of order $N = p_{1}p_{2}\dots p_{n}$, where $p_{i}$'s are…

The aim of this paper is to determine the algebraic structure of multidimensional cyclic codes over a finite chain ring $\mathfrak{R}$. An algorithm to find the generator polynomials of $n$ dimensional ($n$D) cyclic codes of length…

Motivated by applications to the theory of error-correcting codes, we give methods for computing a generating set for the ideal generated by $\beta$-graded polynomials vanishing on certain subsets of a simplicial complete toric variety $X$…

Let $R = k[x_1, \dotsc , x_n]$ denote the standard graded polynomial ring over a field $k$. We study certain classes of equigenerated monomial ideals with the property that the so-called complementary ideal has no linear relations on the…

In this paper, for a field $k$ of characteristic zero and a finitely generated $k$-algebra $R$, we give a set of generators for the image ideals of irreducible nice and quasi-nice $R$-derivations on the polynomial ring $R[X,Y]$, where $R$…

Over a field of characteristic $0$, we construct a minimal set of generators of the defining ideals of closures of nilpotent conjugacy class in the set of $n \times n$ matrices. This modifies a conjecture of Weyman and provides a complete…

Let G be a unipotent algebraic subgroup of some GL_m(C) defined over Q. We describe an algorithm for finding a finite set of generators of the subgroup G(Z) = G \cap GL_m(Z). This is based on a new proof of the result (in more general form…

Consider a compact connected Lie group $G$ and the corresponding Lie algebra $\cal L$. Let $\{X_1,...,X_m\}$ be a set of generators for the Lie algebra $\cal L$. We prove that $G$ is uniformly finitely generated by $\{X_1,...,X_m\}$. This…

Consider the polynomial ring $R_n = k[x_1,...,x_n]$, where $k$ is a field. Let $m = (x_1,...,x_n)$ and $I$ be an $m$-primary monomial ideal in $R$. We consider the problem of determining whether such ideals are in the Gorenstein liasion…

Let $R$ be a commutative ring and let $n \geq 1.$ We study $\Gamma(s)$, the generating function and Ann$(s)$, the ideal of characteristic polynomials of $s$, an $n$--dimensional sequence over $R$. We express $f(X_1,\ldots,X_n) \cdot…

A quasi-equigenerated monomial ideal $I$ in the polynomial ring $R= k[x_1, \ldots, x_n]$ is a Freiman ideal if $\mu(I^2) = l(I)\mu(I)- \binom{l(I)}{2}$ where $l(I)$ is the analytic spread of $I$ and $\mu(I)$ is the number of minimal…

We show that if $R$ is a two dimensional standard graded ring (with the graded maximal ideal ${\bf m}$) of characteristic $p>0$ and $I\subset R$ is a graded ideal with $\ell(R/I) <\infty$ then the $F$-threshold $c^I({\bf m})$ can be…

We show that any nonzero polynomial in the ideal generated by the $r \times r$ minors of an $n \times n$ matrix $X$ can be used to efficiently approximate the determinant. For any nonzero polynomial $f$ in this ideal, we construct a small…