Hilbert quasi-polynomial for order domains and application to coding theory (Q1783726)

Let \(K\) be a field and \(R\) a \(K\)-algebra. Furthermore, let \((\Gamma,<)\) be a well-order semigroup. An order function on \(R\) is a surjective function \(\rho:R\longrightarrow \Gamma \cup \{-\infty\}\) such that for each \(f,g,h\in R\) the following conditions hold: \(\rho(f)=-\infty\) iff \(f=0\), \(\rho(af)= \rho(f)\) for each \(0 \neq a\in K\), \(\rho(f+g)\leq \max\{ \rho(f),\rho(g)\}\), if \(\rho(f)<\rho(g)\) and \(h\neq 0\) then \(\rho(hf)<\rho(hg)\), if \(f,g\neq 0\) and \(\rho(f)=\rho(g)\) then there exists \(a\in K\) so that \(\rho(f-ag)<\rho(f)\). A \(K\)-algebra endowed with an order function is called an order domain over \(K\). A weight function on \(R\) is an order function on \(R\) such that \(\rho(f+g)=\rho(f)+\rho(g)\) for each \(f,g\in R\). For example, if we consider \(R=K[x]\) and \(\Gamma=\mathbb{N}\) then the function \(\rho\) defined by \(\rho(f)=\deg(f)\) for each \(f\neq 0\) and \(\rho(0)=-\infty\) represents a weight order function on \(R\) and in consequence \(R\) is an order domain. Assume that \(G\) is a Gröbner basis for an ideal \(I\subset R=K[x_1,\ldots ,x_n]\) with respect to a generalized weighted degree ordering. If the following two conditions hold then Geil in 2009 introduced a weight function on \(R/I\): \(C1\): any element of \(G\) has exactly two monomials of highest weight in its support, \(C2\): no two monomials in the staircase of \(I\) are of the same weight. To a weighted homogeneous ideal, one can associate the Hilbert function, the Hilbert series and the so-called Hilbert quasi-polynomial. In the paper, the authors present first an algorithm for an effective computation of Hilbert quasi-polynomials. Then, given a weighted homogeneous ideal, this computation is used to test whether the condition \(C2\) holds or not. The paper is concluded by discussing some applications of this theory to codes constructed from maximal curves.