论文信息 - An algorithm to compute the Hilbert depth

An algorithm to compute the Hilbert depth

We give an algorithm which computes the Hilbert depth of a graded module based on a theorem of Uliczka. Partially answering a question of Herzog, we see that the Hilbert depth of a direct sum of modules can be strictly greater than the Hilbert depth of all the summands.

Adrian Popescu | A. Popescu

[1] Jan Uliczka. Remarks on Hilbert series of graded modules over polynomial rings , 2010 .

[2] Hans Schönemann,et al. SINGULAR: a computer algebra system for polynomial computations , 2001, ACCA.

[3] Bogdan Ichim,et al. How to compute the multigraded Hilbert depth of a module , 2012, 1209.0084.

[4] Ricky X. F. Chen. How to compute the Hilbert depth of a graded ideal , 2013, 1308.3205.

[5] Bogdan Ichim,et al. An Algorithm for Computing the Multigraded Hilbert Depth of a Module , 2013, Exp. Math..

[6] C. Krattenthaler,et al. Stanley decompositions and Hilbert depth in the Koszul complex , 2009, 0909.0686.

[7] Yi-Huang Shen. LEXSEGMENT IDEALS OF HILBERT DEPTH 1 , 2012, 1208.1822.

[8] A. Popescu. Signature Standard Bases over Principal Ideal Rings , 2016 .

[9] Winfried Bruns,et al. Cohen–Macaulay Rings: Preface to the revised edition , 1998 .

[10] W. Bruns,et al. Cohen-Macaulay rings , 1993 .

[11] W. Bruns,et al. Hilbert regularity of $\mathbb Z$-graded modules over polynomial rings , 2017 .

[12] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.

[13] Julio Jos'e Moyano-Fern'andez,et al. Hilbert regularity of ZZ-graded modules over polynomial rings , 2013, 1308.2917.

[14] William T. Trotter,et al. Interval partitions and Stanley depth , 2010, J. Comb. Theory, Ser. A.

[15] Richard P. Stanley,et al. Linear diophantine equations and local cohomology , 1982 .