# ApCoCoA-1:NCo.MRHF

This article is about a function from ApCoCoA-1. |

## NCo.MRHF

Enumerate values of the Hilbert function of a finitely generated `K`-algebra.

### Syntax

NCo.MRHF(X:STRING, Ordering:STRING, Relations:LIST, G:LIST[, DB:INT]):LIST

### Description

Let `P=K<X|R>` be a finitely generated monoid ring, and let `I` be a finitely generated two-sided ideal in `P`. Then `P/I` is a finitely generated `K`-algebra. For every integer `i` in `N`, we let `F_{i}` be the `K`-vector subspace generated by the words of length less than or equal to `i`. Then `{F_{i}}` is a filtration of `K<X>`. Further, the filtration `{F_{i}}` induces a filtration `{F_{i}/(F_{i} intersects I)}` of `P/I`. The *Hilbert function* of `P/I` is a map `HF: N -->` N defined by `HF(i)=dim(F_{i}/(F_{i} intersects I))-dim(F_{i-1}/(F_{i-1} intersects I))`, i.e. `HF(i)` is equal to the number of words of length `i` in a Macaulay's basis (see NCo.MRMB) of `P/I`.

*Please note:* The function(s) explained on this page is/are using the *ApCoCoAServer*. You will have to start the ApCoCoAServer in order to use it/them.

Please set coefficient field via the function NCo.SetFp (or NCo.UnsetFp) before calling this function. The default coefficient field is the field of rational numbers, i.e. RAT in CoCoAL. For more information, please check the relevant functions.

@param

*X:*a finite alphabet (or set of indeterminates). It is of STRING type. Note that every letter in X MUST appear only once.The order of letters in X induces word orderings.@param

*Ordering:*a length compatible word ordering induced by the order of letters in X. It is a STRING, which is a shortened-form of the name of corresponding word ordering. Note that the package currently supports two length compatible words orderings, i.e. "LLEX" (the length-lexicographic ordering) and "LRLEX" (the length-reverse-lexicographic ordering). See NCo.SetOrdering for more details.@param

*Relations:*a finite set of relations. It is of LIST type. Each element in Relations is of the form [W1, W2], where W1 and W2 are words in`<X>`. Each word is represented as a STRING. For example, the word`xy^2x`is represented as "xyyx", and the identity is represented as the empty string "". Thus, the relation`(yx, xy)`is represented as ["yx", "xy"], and the set of relations`{(yx, xy),(zx,xz),(zy,yz)}`is represented as [["yx", "xy"],["zx", "xz"],["zy", "yz"]].@param

*G:*a LIST of non-zero polynomials forming a Groebner basis with respect to the length compatible word ordering Ordering. Each polynomial is represented as a LIST of monomials, which are pairs of the form [C, W] where W is a word in`<X>`and C is the coefficient of W. For example, the polynomial`f=xy-y+1`is represented as F:=[[1,"xy"], [-1, "y"], [1,""]].*Warning:*users should take responsibility to make sure that G is indeed a Groebner basis with respect to a length compatible word ordering! In the case that G is a partical Groebner basis, the function enumerates pseudo values.@return: a LIST of non-negative integers, which are values of the Hilbert function of the

`K`-algebra`K<X>/(G,Relations)`.

Optional parameter:

@param

*DB:*a positive INT, which is a degree bound of the Hilbert function. Note that we set DB=32 by default. Thus, in the case that the`K`dimension of`K<X>/<G,Relations>`is finite, it is necessary to set DB to a large enough INT in order to compute all the values of the Hilbert function.

#### Example

X := "xyzt"; Ordering := "LLEX"; Relations:=[]; F1 := [[1,"xx"], [-1,"yx"]]; F2 := [[1,"xy"], [-1,"ty"]]; F3 := [[1,"xt"], [-1, "tx"]]; F4 := [[1,"yt"], [-1, "ty"]]; G := [F1, F2,F3,F4]; NCo.MRHF(X, Ordering, Relations, G, 5); --G is a partical Groebner basis [1, 4, 12, 36, 108, 324] ------------------------------- G:= [[[1, "yt"], [-1, "ty"]], [[1, "xt"], [-1, "tx"]], [[1, "xy"], [-1, "ty"]], [[1, "xx"], [-1, "yx"]], [[1, "tyy"], [-1, "tty"]], [[1, "yyx"], [-1, "tyx"]]]; NCo.MRHF(X, Ordering, Relations, G, 5); --G is a Groeber basis (w.r.t. LLEX) of the two-sided ideal generated by G [1, 4, 12, 34, 100, 292] -------------------------------

### See also