this is for holding javascript data
Michela Ceria edited section_Multivariate_polynomials_on_bits__.tex
about 6 years ago
Commit id: ca7c55dc2b9d6b28d5ecccb9d393f7583f1439c3
deletions | additions
diff --git a/section_Multivariate_polynomials_on_bits__.tex b/section_Multivariate_polynomials_on_bits__.tex
index cf0febe..79fe381 100644
--- a/section_Multivariate_polynomials_on_bits__.tex
+++ b/section_Multivariate_polynomials_on_bits__.tex
...
$deg_3(x_1x_3^5)=5$ and $deg(x_1x_3^5)=6$. \\
The \emph{degree of a polynomial} $f\in \Fb[x_1,...,x_n] $ is the maximal degree of the monomials appearing
in $f$ with nonzero coefficient, so, if $f=x^3y+xz^6-z^2\in \Fb[x,y,z]$, $deg(f)=7$ and if $g=x^3+0y^{12}$ then $deg(g)=3$.
\\ \begin{Exercise}\label{Gradi}
In $\Fb[x_1,x_2x_3]$ what is...
\begin{itemize}
\item the $2$-degree of $x_2^3x_3$?
\item the degree of $x_2^3x_3+x_2$?
\item the degree of $x_1^7+x_2^4x_3^3$?
\end{itemize}
\end{Exercise}
Two polynomials $f,g \in \Fb[x_1,...,x_n]$ are called \emph{equal} if
\begin{center}
\emph{a term $x_1^{i_1}\cdots x_n^{i_n}$ appears in $f$ with nonzero coefficient $a_{i_1...i_n}$ \\