The lex game and some applications (Q2457356)

This paper introduces a new game on finite subsets \(V\) of finite dimension vector space \({\mathbb F}^n\) over the field \(\mathbb F\) called ``lex game''. This yields a combinatorial description of standard monomials of the polynomial ideal vanishing on \(V.\) With this help they developed a fast algorithm to compute lexicographic standard monomials. The method then is applied for special cases of \(V.\)