Ask Your Question

Simplify multivariate polynomial modulo ideal generators

asked 2022-10-18 22:14:20 +0200

Road gravatar image

updated 2022-10-18 22:15:00 +0200

Suppose we have some multivariate polynomials $f, g_1, g_2, g_3 \in F[x,y,z, ... ]$ where $F$ is some field, e.g $\mathbb{Q}$ or some finite field. I'm asking for an algorithm that "simplifies" $f$ assuming $g_1 = g_2 = g_3 = 0$. That is, I want to find a simple/short representative of $f$ in the quotient ring $F[x,y,z,...]/\langle g_1, g_2, g_3 \rangle$. I suspect it has something to do with Grobner bases but I haven't found anything concrete yet.

Thank you.

edit retag flag offensive close merge delete

1 Answer

Sort by ยป oldest newest most voted

answered 2022-10-18 23:58:03 +0200

Max Alekseyev gravatar image

You need to define the ideal generated by $g_i$ and then use its .reduce() method on $f$. See the docs.

edit flag offensive delete link more

Your Answer

Please start posting anonymously - your entry will be published after you log in or create a new account.

Add Answer

Question Tools

1 follower


Asked: 2022-10-18 22:14:20 +0200

Seen: 98 times

Last updated: Oct 18 '22