相关论文: Normalization of monomial ideals and Hilbert funct…

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…

We give a generalization of Hochster's formula for local cohomologies of square-free monomial ideals to monomial ideals, which are not necessarily square-free. Using this formula, we give combinatorial characterizations of generalized…

In a recent paper by Harada, Seceleanu, and \c{S}ega, the Hilbert function, betti table, and graded minimal free resolution of a general principal symmetric ideal are determined when the number of variables in the polynomial ring is…

We consider the non-positivity of the Hilbert coefficients for a parameter ideal of a commutative Noetherian local ring. In particular, we show that the second Hilbert coefficient of a parameter ideal of depth at least d-1 is always…

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 field and $S=K[x_1,\ldots,x_n]$, the ring of polynomials in $n$ variables, over $K$. Using the fact that the Hilbert depth is an upper bound for the Stanley depth of a quotient of squarefree monomial ideals $0\subset…

The cosmological polytope of a graph $G$ was recently introduced to give a geometric approach to the computation of wavefunctions for cosmological models with associated Feynman diagram $G$. Basic results in the theory of positive…

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…

Let $k[X] = k[x_{i,j}: i = 1,..., m; j = 1,..., n]$ be the polynomial ring in $m n$ variables $x_{i,j}$ over a field $k$ of arbitrary characteristic. Denote by $I_2(X)$ the ideal generated by the $2 \times 2$ minors of the generic $m \times…

In this paper we investigate the parallelization of two modular algorithms. In fact, we consider the modular computation of Gr\"obner bases (resp. standard bases) and the modular computation of the associated primes of a zero-dimensional…

A formula for evaluating the quadratic normalization integrals of orthogonal Heun functions over the real interval 0 <= x <= 1 is derived using a simple limiting procedure based upon the associated differential equation. The resulting…

This paper presents two enumeration techniques based on Hilbert functions. The paper illustrates these techniques by solving two chessboard problems.

In this work, we explore the relationship between free resolution of some monomial ideals and Generalized Hamming Weights (GHWs) of binary codes. More precisely, we look for a structure smaller than the set of codewords of minimal support…

In this paper we prove some normality criteria for a family of meromorphic functions, which involves the zeros of certain differential polynomials generated by the members of the family.

The Hilbert function of a module over a positively graded algebra is of quasi-polynomial type (Hilbert--Serre). We derive an upper bound for its grade, i.e. the index from which on its coefficients are constant. As an application, we give a…

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…

In this paper, we prove normality criteria for families of meromorphic functions involving sharing of a holomorphic function by a certain class of differential polynomials. Results in this paper extends the works of different authors…

Recently several authors have proved results on Ehrhart series of free sums of rational polytopes. In this note we treat these results from an algebraic viewpoint. Instead of attacking combinatorial statements directly, we derive them from…

We derive here the Friedland-Tverberg inequality for positive hyperbolic polynomials. This inequality is applied to give lower bounds for the number of matchings in $r$-regular bipartite graphs. It is shown that some of these bounds are…

The paper presents two algorithms for finding irreducible decomposition of monomial ideals. The first one is recursive, derived from staircase structures of monomial ideals. This algorithm has a good performance for highly non-generic…