相关论文: How to compute the Hilbert depth of a graded ideal

In this paper, we obtain explicit formulas for the Hilbert series and Hilbert depth of squarefree Veronese ideals in a standard graded polynomial ring.

The aim of this paper is to introduce a method for computing Hilbert decompositions (and consequently the Hilbert depth) of a finitely generated multigraded module $M$ over the polynomial ring $K[X_1,..., X_n]$ by reducing the problem to…

The Hilbert depth of a module M is the maximum depth that occurs among all modules with the same Hilbert function as M. In this note we compute the Hilbert depths of the powers of the irrelevant maximal ideal in a standard graded polynomial…

Let $\mathbf m=(x_1,\ldots,x_n)$ be the maximal graded ideal of $S:=K[x_1,\ldots,x_n]$. We present a new method for computing the Hilbert depth of powers of $\mathbf m$.

Let $S=K[x_1,\ldots,x_n]$ be the ring of polynomials over a field $K$. Given two monomial ideals $0\subset I\subsetneq J \subset S$, we present a new method to compute the Hilbert depth of $J/I$. As an application, we show that if $u\in S$…

Let $I\subset S=\KK[x_1,...,x_n]$ be a lexsegment ideal, generated by monomials of degree $d$. The main aim of this paper is to characterize when the Hilbert depth of $I$ will be 1, in the standard graded case. In addition to this, we will…

A method for computing the multigraded Hilbert depth of a module was presented in [16]. In this paper we improve the method and we introduce an effective algorithm for performing the computations. In a particular case, the algorithm may…

Let $A = K[x_1, ..., x_n]$ denote the polynomial ring in $n$ variables over a field $K$ with each $\deg x_i = 1$. Let $I$ be a homogeneous ideal of $A$ with $I \ne A$ and $H_{A/I}$ the Hilbert function of the quotient algebra $A / I$. Given…

In [7] we obtained a formula for the Hilbert depth of squarefree Veronese ideals in a standard graded polynomial ring by relating it to the Hilbert depth of powers of the irrelevant maximal ideal. In this paper, we prove that these two…

In this article we mainly consider the positively Z-graded polynomial ring R=F[X,Y] over an arbitrary field F and Hilbert series of finitely generated graded R-modules. The central result is an arithmetic criterion for such a series to be…

We present an algorithm which computes the Hilbert depth of a graded module based on a theorem of Uliczka. Connected to a Herzog's question we see that the Hilbert depth of a direct sum of modules can be strictly bigger than the Hilbert…

In this paper we present an algorithm for computing Groebner bases of linear ideals in a difference polynomial ring over a ground difference field. The input difference polynomials generating the ideal are also assumed to be linear. The…

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 introduce the multigraded Hilbert scheme, which parametrizes all homogeneous ideals with fixed Hilbert function in a polynomial ring that is graded by any abelian group. Our construction is widely applicable, it provides explicit…

We compute the Hilbert coefficients of a graded module with pure resolution and discuss lower and upper bounds for these coefficients for arbitrary graded modules.

We study the normalization of a monomial ideal, and show how to compute its Hilbert function (using Ehrhart polynomials) if the ideal is zero dimensional. A positive lower bound for the second coefficient of the Hilbert polynomial is shown.

We present and analyze two algorithms for computing the Hilbert class polynomial $H_D$ . The first is a p-adic lifting algorithm for inert primes p in the order of discriminant D < 0. The second is an improved Chinese remainder algorithm…

We study existence and computability of finite bases for ideals of polynomials over infinitely many variables. In our setting, variables come from a countable logical structure A, and embeddings from A to A act on polynomials by renaming…

Let $h:\mathbb Z \to \mathbb Z_{\geq 0}$ be a nonzero function with $h(k)=0$ for $k\ll 0$. We define the Hilbert depth of $h$ by $\operatorname{hdepth}(h)=\max\{d\;:\; \sum_{j\leq k} (-1)^{k-j}\binom{d-j}{k-j}h(j)\geq 0\text{ for all }k\leq…

Let $K$ be a infinite field, $S=K[x_1,\ldots,x_n]$ and $0\subset I\subsetneq J\subset S$ two squarefree monomial ideals. In a previous paper we proved a new formula for the Hilbert depth of $J/I$. In this paper, we illustrate how one can…