Abstract
We present an algorithm to compute the Hilbert series of a homogeneous ideal in a polynomial ring. From an ideal I, generated by the principal monomials of a Gröbner basis, we compute the Hilbert series \(Hilb_{k[x_1 ,...,x_n ]/I}\)(t)=T I (t)/(1−t)n. The polynomial T I is computed by recursively factoring out a monomial m of degree d at each step
.
Supported by the Swedish National Board for Technical Development.
This article was processed using the LATEX macro package with LMAMULT style
Preview
Unable to display preview. Download preview PDF.
References
J. Backelin and R. Fröberg: How we proved that there are exactly 924 cyclic 7-roots. In S. M. Watt, editor, Proc. ISSAC '91, pages 103–111. ACM, July 1991.
D. Bayer: Talk given at COCOA-II, Genova, Italy 1990.
G. Björck: Functions of modulus on Z p whose Fourier transforms have constant modulus, Proc. A. Haar Memorial Conf., Budapest, Colloquia Mathematica Societatis János Bolyai 49 (1985), 193–197.
B. Buchberger: Gröbner-bases: An algorithmic method in polynomial ideal theory. Multidimensional Systems Theory (Ed. N.K. Bose). D. Reidel Publishing Company 1985, 184–232.
B.W. Char, K.O. Geddes, G.H. Gonnet, and S.M. Watt: Maple User's Guide, WATCOM Publications, Waterloo 1985.
R. Fröberg and J. Hollman: Hilbert series for ideals generated by generic forms, Technical report, available from the author.
A.C. Hearn: Reduce user's manual, Version 3.3. Report CP 78, The RAND Corporation, July 1987.
F. S. Macaulay: Some properties of enumeration in the theory of modular systems, Proc. London Math. Soc. 26, 531–555 (1927).
H. Melenk, H.M. Möller, and W. Neun: A Package for Calculating Groebner Bases Available from reduce-netlibrand.org
F. Mora and H. M. Möller: The computation of the Hilbert Function. Proceedings EUROCAM 1983, Springer L.N. in Comp. Sci. Vol. 162, pp. 157–167 (1983).
Maureen Stillman, Michael Stillman, and D. Bayer: Macaulay User Manual Available via anonymous ftp on zariski.harvard.edu
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hollman, J. (1992). On the computation of the Hilbert series. In: Simon, I. (eds) LATIN '92. LATIN 1992. Lecture Notes in Computer Science, vol 583. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023835
Download citation
DOI: https://doi.org/10.1007/BFb0023835
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55284-0
Online ISBN: 978-3-540-47012-0
eBook Packages: Springer Book Archive