Skip to main content


Our research is centered around studying the Hilbert quasi-polynomial of a polynomial ring 𝑅 in finitely many variables over a field 𝐾, with general grading. In our case, the Hilbert quasi-polynomial of R describes the Hilbert function of R. The Hilbert function is the function 𝑓(𝑛) such that 𝑓(𝑛) equals the 𝐾-dimension of the vector space of all polynomials from 𝑅 of degree 𝑛. The Hilbert theory says that 𝑓(𝑛) is a quasi-polynomial in 𝑛. In particular, let 𝑑( =degree of the variable 𝑥( in 𝑅, 𝑖 = 1, ... , 𝑚, and let 𝐷=lcm(𝑑1, ... , 𝑑2). We are interested in the polynomial h(𝑛) such that h(𝑛𝐷) = 𝑓(𝑛𝐷), for all 𝑛. Our work is around gathering numerical evidence for the claim that h(𝑛 − 1) is a polynomial with nonnegative coefficients. We are running tests and examples through algebraic software such as Singular and Polymake to gather examples in this direction. Gathering such evidence would give an indication that this feature of the h(𝑛) is true and provide ideas on how to approach a proof of this claim. This claim is important in the theory of Frobenius complexity. In addition, it would provide a surprising set of new features of the Hilbert quasi-polynomial, of interest in enumerative combinatorics and discrete geometry.


File nameDate UploadedVisibilityFile size
19 Jul 2022
26.1 kB



  • Event location
    • Cleveland Ballroom

  • Event date
    • 2 November 2019

  • Date submitted

    19 July 2022