Universal Lex Ideal Approximations of Extended Hilbert Functions and Hamilton Numbers

preprint2020arXivOpen access

Abstract

Let RhR^h denote the polynomial ring in variables x1, …, xhx_1,\,\ldots,\, x_h over a specified field KK. We consider all of these rings simultaneously, and in each use lexicographic (lex) monomial order with x1>⋯>xhx_1 > \cdots > x_h. Given a fixed homogeneous ideal II in RhR^h, for each dd there is unique lex ideal generated in degree at most dd whose Hilbert function agrees with the Hilbert function of II up to degree dd. When we consider IRNIR^N for N≥hN \geq h, the set Bd(I,N)\mathfrak{B}_d(I,N) of minimal generators for this lex ideal in degree at most dd may change, but Bd(I,N)\mathfrak{B}_d(I,N) is constant for all N≫0N \gg 0. We let Bd(I)\mathfrak{B}_d(I) denote the set of generators one obtains for all N≫0N \gg 0, and we let bd=bd(I)b_d = b_d(I) be its cardinality. The sequences b1, …, bd, …b_1, \, \ldots, \, b_d, \, \ldots obtained in this way may grow very fast. Remarkably, even when I=(x12,x22)I = (x_1^2, x_2^2), one obtains a very interesting sequence, 0, 2, 3, 4, 6, 12, 924, 409620, …\,\ldots. This sequence is the same as Hd−1+1H_{d-1} + 1 for d≥2d \geq 2, where HdH_d is the d d\,th Hamilton number. The Hamilton numbers were studied by Hamilton and by Hammond and Sylvester because of their occurrence in a counting problem connected with the use of Tschirnhaus transformations in manipulating polynomial equations.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.