Faculty Mentor

Dr. Florian Enescu

Proposal Type

Poster

Start Date

2-11-2019 10:20 AM

End Date

2-11-2019 11:30 AM

Location

Cleveland Ballroom

Abstract

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.

Share

COinS
 
Nov 2nd, 10:20 AM Nov 2nd, 11:30 AM

#40 - Numerical evidence towards establishing a new relation satisfied by the coefficients of the Hilbert quasi-polynomial of a polynomial ring with general grading

Cleveland Ballroom

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.