# Question:How can I implement a simple code to obtain the dimension and basis in the quotient ring by {\tt Maple}?

## Question:How can I implement a simple code to obtain the dimension and basis in the quotient ring by {\tt Maple}?

Maple

Let us consider the following assumptions:

Any set of binomials $B \in R=K[x_1, \cdots, x_n]$ induces an equivalence relation on the set of monomials in $R$ under which $m_1∼m_2$ if and only if $m_1−tm_2\in \langle B \rangle$ for some non-zero $t\in K$. As a k-vector space, the quotient ring $R/B$ s spanned by the equivalence classes of monomials. Now let $f =x^2−y^2$ be a binomial in $K[x, y]$. Among monomials of total degree three, $x^3$ and $xy^2$, as well as $x^2y$ and $y^3$ become equal in $K[x, y] / \langle f\rangle$.

Why the degree three part in the quotient is two-dimensional with one basis vector per equivalence class?

Also, why does the polynomial $f=x^3+xy^2+y^3$ map to a binomial with a coefficient matrix [2, 1]? I think this matrix arises from the matrix [1, 1, 1, 0] by summing the columns corresponding to $x^3$ and $xy^2$ and those for $x^2y$ and $y^3$.

How can I implement a simple code to obtain these results in {\tt Maple}?

I am looking forward to hearing any help and guidance.